scispace - formally typeset
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

Mathematical modeling and solving procedure of the planar storage location assignment problem

TL;DR: This paper utilizes an efficient genetic algorithm (GA) to solve the PSLAP for real-sized instances using a mathematical programming model, but which belongs to the NP-hard problems category.
Journal ArticleDOI

Models and algorithms for multi-crane oriented scheduling method in container terminals

TL;DR: In this paper, two models for inter-ship and ship-based sharing of trailers are developed. And the Q-learning algorithm is designed to solve the model. But it is not shown that the multi-crane oriented method can decrease the travel distance of trailers, reduce the disequilibrium of different working lines, and thus improve the operation efficiency in container terminals.
Journal ArticleDOI

A heuristics-based solution to the continuous berth allocation and crane assignment problem

TL;DR: In this paper, an integrated heuristics-based solution methodology is proposed that tackles both the berth allocation and quay crane assignment problems simultaneously, which yields high quality solutions to such an NP-hard problem in a reasonable computational time suggesting its suitability for practical use.
Journal ArticleDOI

Discretization-Strategy-Based Solution for Berth Allocation and Quay Crane Assignment Problem

TL;DR: A mixed-integer linear programming model of the continuous berth allocation and quay crane assignment problem is established, aiming at minimizing the total stay time and delay penalty of ships, and a large neighborhood search algorithm incorporating the discretization strategy is proposed.
Proceedings ArticleDOI

The Algorithm For Berth Scheduling Problem By The Hybrid Optimization Strategy GASA

TL;DR: A nonlinear model for the berth scheduling problem is described and the results indicated that compared with GA, the GASA algorithm increased the diversity of the individuals, accelerated the evolution process and avoided sinking into the local optimal solution early.
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.

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.
Related Papers (5)