A comprehensive study on berth and quay crane scheduling problems at container terminals at seaports is provided. Problems related to both multi-user terminals, where the terminal operator and liner carriers are different parties, and dedicated terminals, where liner carriers lease the terminal, are considered. A lower bound and an effective meta-heuristic algorithm are proposed for a dynamic variant of the Berth Allocation Problem (BAP). The Multiple Berth Allocation Problem (MBAP) is also introduced. Different crane scheduling methods used by terminal operators are analyzed and a tabu search algorithm is designed for a new variant of the Quay Crane Scheduling Problem (QCSP). The Simultaneous Berth and Quay Crane Scheduling Problem (BQCSP) is introduced with a lower bound analysis and an efficient solution method. A computational analysis is performed which exposes the substantial benefit of simultaneous planning over the hierarchical approach currently used by terminal operators. The tactical level Voyage and Berth Scheduling Problem (VBSP) is defined and a mathematical model based on multi-commodity network flow is presented. Constraints related to transshipments, terminal time windows and service level requirements are incorporated into the model, and how to modify instance data to increase schedule reliability is discussed.

This thesis aims to propose a multi-agent based hierarchical model for the operations of container terminals. We have divided our model into four key agents that are involved in each sub processes. The proposed agent allocation policies are recommended for different situations that may occur at a container terminal. A software prototype is developed which implements the hierarchical model. This web based application is used in order to simulate the various processes involved in the following operations on the marine side in a case study of a container terminal in Sweden by adopting a multi-agent based simulation technique. Due to the increase in usage of container transportation, container terminals are experiencing difficulties in the management of the operations. The software provides a decision support capability to terminal managers for scheduling and managing the operations effectively while also visually presenting the time it takes to complete the process and its associated cost. Terminal managers need to implement certain policies to improve the management and operations of the container terminal. The policies are evaluated and tested under various cases to provide a more comparative overview. The results of the simulation experiments indicate that the waiting time for arriving vessels is decreasing when in queue with more than three vessels arriving on same day. / Simulation is a good technique that help analyst to take decision considering each factor of problem that is to be simulated. Simulation in addition with multi agent environment provides better understanding of modeling the entities. The complexity of CT environment and multiple involvement of agents simultaneously enables CT suitable domain for multi agents. We have modeled the four CT operations that are carried out at each CT. These operations are modeled in hierarchical sequence like berth allocation, QCs allocation, Transport vehicles allocation and YCs allocation. The most important factor of simulation is the measurement of dynamic time of each operation. We have simulated and compared different agents active time and service time compared with associated cost. The berth allocation is very important asset from all the operations that are carried out at the CTs. The effective utilization of FCFS berth allocation policy reduces the vessel waiting time in waiting queue. The developed terminal simulator tool allocates all resources dynamically while looking at the number of containers that will be loaded and unloaded at QS and yard storage area. The result of simulation tool presents the good dynamic allocation of transport vehicles. The dynamic resource allocation helps to minimize the congestion and bottlenecks that may occur at CTs. The result of three experiments depicts that the berth allocation and agent allocation is improved and vessel service time is reduced at berth side which automatically reduces vessels waiting time in queue. Besides this the transport allocation and YCs allocation is dynamically assigned by looking at number of containers in the vessels. The terminal simulator helps managers to analyze the simulated results and take better decision at hand.

Cíle diplomové práce jsou popsat procesy probíhající v kontejnerovém přístavním terminálu, vytvořit přehled rozhodovacích problémů vznikajících v kontejnerovém přístavním terminálu z hlediska úrovně jejich typu řízení a plánování (strategické, taktické a operativní) a formulovat vybrané rozhodovací problémy a matematicky je analyzovat.

Orientadores: Luiz Leduino de Salles Neto, Antonio Carlos Moretti / Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Matemática, Estatística e Computação Científica / Made available in DSpace on 2018-08-23T22:02:01Z (GMT). No. of bitstreams: 1 Cereser_BrunoLuisHonigmann_M.pdf: 8696662 bytes, checksum: b4ca681ecf08f10afa47d00b3a879e9e (MD5) Previous issue date: 2013 / Resumo: O transporte marítimo é fundamental para grandes empresas de caráter global. Em 2009 80% do comércio mundial foi realizado via transporte marítimo e desde então esse número só tem crescido. Devido a esse alto fluxo nos portos mundiais, surgiu o problema de alocação de navios em berços, que tem por finalidade estabelecer uma sequência de atendimento de navios para cada berço disponível no cais, visando minimizar o tempo total da operação e espera dos navios dentro dos portos. Nesse trabalho o problema de alocação de navios em berços será abordado considerando berços dependentes, e também a divisão das máquinas portuárias em berços consecutivos aplicados a terminais do Porto de Tubarão (ES). Para a representação matemática dos processos desses terminais do porto de tubarão foram desenvolvidos novos modelos matemáticos. Os testes computacionais foram exitosos / Abstract: The maritime transportation is essential to global companies. In 2009 80% of global trade was made by maritime transportation, and over the year this number has raised. Because of this high flux, the BAP (Berth Allocation Problem) arose. The BAP have intent to discovery the vessel allocation sequence in every berth with the minimum total wait time. In this work, the berths of BAP will be considered dependents, we also considered the division of portuary machines between consecutive berths. The objective of this work is the mathematical representation of the terminals Produtos Diversos and Praia Mole of the Tubarão port. For this reasons we propose here unprecedented mathematical models / Mestrado / Matematica Aplicada / Mestre em Matemática Aplicada

Made available in DSpace on 2016-08-17T14:53:08Z (GMT). No. of bitstreams: 1 Victor Hugo Barros Silva.pdf: 4177386 bytes, checksum: 324ffa71e5b64047e7a54ab199bb9241 (MD5) Previous issue date: 2010-03-22 / Conselho Nacional de Desenvolvimento Científico e Tecnológico / The problem of allocating berth positions for vessels in tidal grain port terminals is discussed in this work. A berth defines a specific location alongside a quay where a ship loader is available for loading or unloading vessels, accommodating only one vessel at time. In tidal ports, draft conditions depend on high tide conditions, since available depth under the low tide is not adequate to the movement of ships. Some port terminals at the port complex of São Luís, Maranhão, are associated to important transnational enterprises which maintain a strong control over the stock level of their goods. Since the stock level sometimes depends on a continuous process of consumption or production of grains, the decision making of loading or unloading vessels must contemplate the amount of the grain stored in the port yards. Therefore, a basic criterion for decision making is to give priority to the vessels related to the most critical grain stock level. This paper presents two integer linear programming models based on the transportation problem to represent the discussed problem. Some problem instances could be solved by a commercial solver. As an alternative to larger instances, which require large running time, an implementation of Simulated Annealing (SA) and the algorithm known as Population Training Algorithm for Linear Programming (PTA/LP) are used to solve the problem. / O Problema de Alocação de Berços em Portos Graneleiros com Restrições de Estoque e Condições Favoráveis de Maré é abordado neste trabalho. Um berço define um local especifico ao longo do cais onde um carregador de navio está disponível para carregar ou descarregar navios, acomodando apenas um navio por vez. Em portos que sofrem a influência da variação das marés, as condições de navegação dependem de condições favoráveis de maré, uma vez que a profundidade na maré baixa restringe a movimentação de navios. Alguns terminais no complexo portuário de São Luís, Maranhão, estão associados a importantes empresas multinacionais que mantêm um forte controle sobre os níveis de estoque de seus produtos. Uma vez que o nível de estoque, por vezes, depende de um processo contínuo de consumo ou produção de granéis, a tomada de decisão de carregar ou descarregar navios deve levar em conta as cargas armazenadas nos pátios do porto. Desta forma, um critério básico para tomadas de decisão é dar prioridade aos navios relacionada aos níveis mais críticos de estoque. Este trabalho apresenta dois modelos de programação linear baseado no problema de transporte para representar o problema abordado. Algumas instâncias do problema puderam ser resolvidas por um solver comercial. Como alternativa suas instâncias maiores, que exigem grande tempo de execução, uma implementação do Simulated Annealing (SA) e do algoritmo conhecido como Algoritmo de Treinamento Populacional para Programação Linear (ATP/PL) são empregadas para resolução do problema.