Journal ArticleDOI
Berth allocation planning in the public berth system by genetic algorithms
Reads0
Chats0
TLDR
A heuristic procedure based on the genetic algorithm for determining a dynamic berth assignment to ships in the public berth system is developed and it is shown that the proposed algorithm is adaptable to real world applications.About:
This article is published in European Journal of Operational Research.The article was published on 2001-06-01. It has received 315 citations till now. The article focuses on the topics: Berth allocation problem.read more
Citations
More filters
Journal ArticleDOI
A decision model for berth allocation under uncertainty
Lu Zhen,Loo Hay Lee,Ek Peng Chew +2 more
TL;DR: A meta-heuristic approach is proposed for solving the berth allocation problem under uncertain arrival time or operation time of vessels and a reactive recovery strategy which adjusts the initial schedule to handle realistic scenarios with minimum penalty cost of deviating from theInitial schedule.
Journal ArticleDOI
The Berth Allocation Problem: A Strong Formulation Solved by a Lagrangean Approach
TL;DR: A new formulation of the discrete berth allocation problem is proposed, which is shown to be more compact and stronger than another one from the literature; a Lagrangean heuristic algorithm is developed; and computational results are presented.
Journal ArticleDOI
Tactical berth allocation under uncertainty
TL;DR: This study finds that the robust method can derive a near optimal solution to the stochastic model in a fast way, and also has the benefit of limiting the worst-case outcome of the tactical BAP decisions.
Journal ArticleDOI
Particle swarm optimization algorithm for the berth allocation problem
TL;DR: This paper focuses on the discrete and dynamic berth allocation problem (BAP), which assigns ships to discrete berth positions and minimizes the total waiting times and handling times for all ships, and formulate a mixed integer programming (MIP) model for the BAP.
Journal ArticleDOI
Integrated scheduling of handling equipment at automated container terminals
Henry Y. K. Lau,Ying Zhao +1 more
TL;DR: A heuristic algorithm, called multi-layer genetic algorithm (MLGA) is developed with a view to overcome the computation difficulty for solving the mathematical model for improving the productivities of an automated container terminal.
References
More filters
Book
Scheduling: Theory, Algorithms, and Systems
TL;DR: Scheduling will serve as an essential reference for professionals working on scheduling problems in manufacturing and computing environments and Graduate students in operations management, operations research, industrial engineering and computer science will find the book to be an accessible and invaluable resource.
The Dynamic Berth Allocation Problem for a Container Port
TL;DR: This paper developed a heuristic procedure based on the Lagrangian relaxation of the original problem and conducted a large amount of computational experiments which showed that the proposed algorithm is adaptable to real world applications.
Journal ArticleDOI
The dynamic berth allocation problem for a container port
TL;DR: In this paper, the problem of determining a dynamic berth assignment to ships in the public berth system is addressed, and a heuristic procedure based on the Lagrangian relaxation of the original problem is developed.
Journal ArticleDOI
Efficient planning of berth allocation for container terminals in Asia
TL;DR: In this article, an algorithm is presented to identify non-inferior solutions to the berth allocation problem, which minimizes the sum of port staying times of ships and minimizes dissatisfaction of the ships in terms of the berthing order.
Journal ArticleDOI
A study of container berth allocation.
K. K. Lai,Katharine Shih +1 more
TL;DR: In this article, three sets of allocation policies are developed to tackle the day-to-day allocation problems with a view to increasing operational efficiency and enhancing customer service levels at Hong Kong container terminals.