Abstract

Sea freight transportation involves moving huge amounts of freights among maritime locations widely spaced by means of container vessels. The time required to serve container vessels is the most relevant indicator when assessing the competitiveness of a maritime container terminal. In this paper, two main logistic problems stemming from the transshipment of containers in the seaside of a maritime container terminal are addressed, namely, the Berth Allocation Problem aimed at allocating and scheduling incoming vessels into berthing positions along the quay and the Quay Crane Scheduling Problem, whose objective is to schedule the loading and unloading tasks associated with a container vessel. For solving them, two Migrating Birds Optimization (MBO) approaches are proposed. The MBO is a recently proposed nature-inspired algorithm based on theV-formation flight of migrating birds. In this algorithm, a set of solutions of the problem at hand, called birds, cooperate among themselves during the search process by sharing information within aV-line formation. The computational experiments performed over well-known problem instances reported in the literature show that the performance of our proposed MBO approaches is highly competitive and presents a better performance in terms of running time than the best approximate approach proposed in the literature.

Highlights

  • Maritime container terminals and container vessels are the main components involved in sea freight transportation, where huge amounts of freights are moved among widely spaced locations

  • In the case of the Migrating Birds Optimization (MBO), we report the gap in the objective function value compared with the optimal solution and computational time compared with those reported by the Estimation Distribution Algorithm (EDA)

  • We have presented a Migrating Birds Optimization-based approach for addressing two essential seaside problems at maritime container terminals: the Dynamic Berth Allocation Problem (DBAP) and Quay Crane Scheduling Problem (QCSP)

Read more

Summary

Introduction

Maritime container terminals and container vessels are the main components involved in sea freight transportation, where huge amounts of freights are moved among widely spaced locations. Since the international sea freight trade has undergone a relevant growth over the last few decades (United Nations Conference on Trade And Development, http://www.unctad.org/), maritime container terminals have to better use and schedule their resources in order to efficiently face the operational and technical requirements of shipping companies In this regard, as indicated by Nicoletti et al [1] and Exposito-Izquierdo et al [2], the time required to serve container vessels, since their arrival until their departure, is the most representative indicator used by the shipping companies when assessing the competitiveness of a given maritime container terminal. The main goal of this work is to propose and evaluate the use of the MBO technique for solving the main seaside problems at maritime container terminals With this goal in mind, we have selected two of the most relevant problems in the related literature, DBAP and QCSP.

Seaside Operations
Vessel 1
Migrating Birds Optimization
Migrating Birds Optimization for the Dynamic Berth Allocation Problem
Migrating Birds Optimization for the Quay Crane
Computational Experiments
Findings
Conclusions and Further Research
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call