This paper studies the management of transshipment flows in a container terminal. Management consists of designing a visiting schedule template for feeder vessels and determining storage locations for transshipment containers. A mixed integer programming formulation is developed; it includes the objective of minimizing both the total distance traveled by transshipment flows between quayside and storage yard and the workload imbalance in time. To solve the problem, an algorithm is devised on the basis of Lagrangian relaxation to find near-optimal solutions within short computational times. Numerical experiments are conducted to assess (a) the effectiveness and efficiency of the algorithm and (b) the benefit from adjusting feeder visiting schedule.
Schedule Template Design and Storage Allocation for Cyclically Visiting Feeders in Container Transshipment Hubs
Transportation Research Record
Transportation Research Record: Journal of the Transportation Research Board ; 2273 , 1 ; 87-95
2012-01-01
Article (Journal)
Electronic Resource
English
An Integrated Model for Berth Template and Yard Template Planning in Transshipment Hubs
Online Contents | 2011
|An Integrated Model for Berth Template and Yard Template Planning in Transshipment Hubs
British Library Online Contents | 2011
|Berth allocation recovery for container transshipment terminals
Taylor & Francis Verlag | 2020
|