PPGCC/CCET

Uma banca de DEFESA de MESTRADO foi cadastrada pelo programa.
DISCENTE: JORGE RODRIGO SILVA E SILVA
DATA: 31/08/2021
HORA: 08:30
LOCAL: Vídeoconferência
TÍTULO: Dynamic Berth Allocation Problem for Tidal Bulk Ports with Inventory Level Constraints
PALAVRAS-CHAVES: ...
PÁGINAS: 56
GRANDE ÁREA: Ciências Exatas e da Terra
ÁREA: Ciência da Computação
RESUMO: Berth Allocation Problem is a proven to be NP-Hard where a set of ships will be served by a set of berths within a given planning horizon. It’s a well known optimization problem, generally related to the combinatorial optimization, having algorithms constructed specifically to deal with problems of that kind. The optimization algorithms can be classified in a general manner in exact, approximate, metaheuristic or hybridized. A common approach is to apply exact methods to solve the problem, since them guarantee the optimum solution, but some cases of a problem is very difficult to be solved by the exact path. In this case the application of approximate or metaheuristic algorithms is taken, but without the assurance of optimality. The objective of this work is to contribute to the study of the berth allocation problem in operational scenarios of bulk ports. The model employed is a discrete and dynamic version of BAP, named Berth Allocation Problem in Tidal Bulk ports with Inventory level conditions (BAPTBS). The model was executed with the Gurobi’s solver, a Greedy Heuristic was proposed and also used as an initial solution constructor to the solver and to a GRASP metaheuristic and Two versions of an Evolutionary Clustering Search (ECS) was executed, on e being the standard version and the other a hybridized version using the solver as local searcher.
MEMBROS DA BANCA:
Presidente - 1091306 - ALEXANDRE CESAR MUNIZ DE OLIVEIRA
Interno - 444.610.973-15 - OMAR ANDRES CARMONA CORTES - IFMA
Externo à Instituição - RICARDO DE ANDRADE LIRA RABÊLO - NENHUMA