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 Branch-and-Price Algorithm to Solve the Integrated Berth Allocation and Yard Assignment Problem in Bulk Ports
TL;DR: In this article, two crucial optimization problems of berth allocation and yard assignment in the context of bulk ports are studied, and an exact solution algorithm based on a branch and price framework is proposed to solve the integrated problem.
Journal ArticleDOI
The Berth Allocation Problem with Service Time and Delay Time Objectives
TL;DR: Through numerical experiments, it was found that in most cases the genetic algorithm outperformed the subgradient optimisation and the tight time window yielded noninferior solutions.
Multi-agent systems for container terminal management
TL;DR: An overview of literature is conducted on research focusing on improving the performance of container terminals, finding that much research has been focused on the marine side interface of a container terminal, which leaves room for further research such as on the land-side interface.
Journal ArticleDOI
An optimization approach for coupling problem of berth allocation and quay crane assignment in container terminal
TL;DR: An evolutionary algorithm with nested loops was developed to obtain optimal solutions to solve the issue of berth allocation and quay crane assignment in a multi-user container terminal.
Journal ArticleDOI
Multi-objective and prioritized berth allocation in container ports
TL;DR: A multi-objective evolutionary algorithm that incorporates the concept of Pareto optimality is proposed for solving the multi- objective BAP by optimizing the berth schedule so as to minimize concurrently the three objectives of makespan, waiting time, and degree of deviation from a predetermined priority schedule.
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.