Abstract

This research deals with the dynamic and continuous berth allocation problem (DCBAP) in which both arrived and incoming ships are considered and a quay is used as a continuous line to accommodate as many ships as possible at one time. The DCBAP is solved by a two-stage procedure. In the first stage a heuristic/metaheuristic is used to generate alternative ship placement sequences while in the second stage a specific heuristic is employed to place ships and resolve overlaps of ships for the development of a feasible solution. Different methods, including FCFS (First Come First Served), SFLA (Shuffled Frog-Leaping Algorithm), and ISFLA (Improved Shuffled Frog-Leaping Algorithm), were employed in the first stage for comparison. The experimental results show that the ISFLA outperforms the others in terms of solution quality, implying that the ISFLA has the potential to deal with the DCBAP in a container terminal.

Highlights

  • International trade is the exchange of goods or services across nations

  • We focus on the dynamic version (DBAP) due to the fact that ships continue to come during berth allocation problem (BAP) planning

  • We focus on dealing with the dynamic and continuous BAP (DCBAP), whereby a quay is used as a continuous line, and both arrived ships and incoming ships are considered

Read more

Summary

Introduction

International trade is the exchange of goods or services across nations. There are different kinds of transportations for exchanging goods, including air, land, and maritime. Among these transportations, maritime transport is essential due to its having a relatively lower transport cost as a result of mass transport. Among various kinds of maritime transport, container transport is especially important, as the number of global container shipments is increasing continuously. Many of the busy global ports, such as Hamburg, Rotterdam, and Antwerp in Europe, and Busan, Shanghai, and Hong Kong, employ multi-user terminals [1]. To improve productivity at this kind of terminal, a better solution for the berth allocation problem (BAP) is essential

Objectives
Discussion
Conclusion
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