Carlos Arango

Berth allocation planning in Seville inland port by simulation and optimisation

We study the problems associated with allocating berths for containerships in the port of Seville. It is the only inland port in Spain and it is located on the Guadalquivir River. This paper addresses the berth allocation planning problems using simulation and optimisation with Arena software. We propose a mathematical model and develop a heuristic procedure based on genetic algorithm to solve non-linear problems. Allocation planning aims to minimise the total service time for each ship and considers a first-come-first-served allocation strategy. We conduct a large amount of computational experiments which show that the proposed model improves the current berth management strategy.

Dynamic approach to solve the daily drayage problem with transit time uncertainty

The intermodal transport chain can become more efficient by means of a good organization of drayage movements. Drayage in intermodal container terminals involves the pick up and delivery of containers at customer locations, and the main objective is normally the assignment of transportation tasks to the different vehicles, often with the presence of time windows. This scheduling has traditionally been done once a day and, under these conditions, any unexpected event could cause timetable delays. We propose to use the real-time knowledge about vehicle position to solve this problem, which permanently allows the planner to reassign tasks in case the problem conditions change. This exact knowledge of the position of the vehicles is possible due to the use of a geographic positioning system by satellite (GPS, Galileo, Glonass), and the results show that these additional data can be used to dynamically improve the solution.

Simulation-Optimization Models for the Dynamic Berth Allocation Problem

This article addresses the berth allocation problem with continuous dock, which is called dynamic berth allocation problem. In view of the steadily growing trend in increasing container ship size, more flexible berth allocation planning is mandatory. The article discusses how container terminals (CTs) are designed to provide support for the continuous changes in container ships. The most common schemes used for dock management are based on discrete and continuous locations and the consideration of continuous location in the CT is a good option. The article proposes a mathematical model that develops a heuristic procedure, which is based on a genetic algorithm, in order to solve the corresponding mixed integer problem. The article discusses how allocation planning aims to minimize distances traveled by the forklifts and the quay crane, for container loading and unloading operations for each ship, according to the quay crane scheduling. Arena software and experimental analysis are used to create simulations for the most important CT in Spain.

A satellite navigation system to improve the management of intermodal drayage

The intermodal transport chain can become more efficient by means of a good organization of the drayage movements. Drayage in intermodal container terminals involves the pick up or delivery of containers at customer locations, and the main objective is normally the assignment of transportation tasks to the different vehicles, often with the presence of time windows. The literature shows some works on centralized drayage management, but most of them consider the problem only from a static and deterministic perspective, whereas the work we present here incorporates the knowledge of the real-time position of the vehicles, which permanently enables the planner to reassign tasks in case the problem conditions change. This exact knowledge of position of the vehicles is possible thanks to a geographic positioning system by satellite (GPS, Galileo, Glonass), and the results show that this additional data can be used to dynamically improve the solution.

Genetic Algorithm for the Dynamic Berth Allocation Problem in Real Time

The container terminals (CTs) are designed to provide support to the continuous changes in the containerships. The most common schemes used for dock management are based on discrete and continuous locations. The consideration of continuous location in the CT allows arriving every container ship to the port independently of its size and dimensions. This work addresses the berth allocation problem with continuous dock, which is called dynamic berth allocation problem. We propose a mathematical model and develop a heuristic procedure based on a genetic algorithm to solve the corresponding mixed integer problem. Allocation planning aims to minimize the service time for each ship according to the berth and quay crane scheduling. Experimental analysis is carried out for the port of Algeciras that is the most important CT in Spain.