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

Heuristics for the Integration of Crane Productivity in the Berth Allocation Problem

TL;DR: In this paper, the authors investigated the combined problem of berth allocation and crane assignment in container terminals, which includes important real world aspects such as the decrease of marginal productivity of quay cranes assigned to a vessel and the increase in handling time if vessels are not berthed at their desired position at the quay.
Journal ArticleDOI

Modeling and Solving the Tactical Berth Allocation Problem

TL;DR: In this article, a heuristic algorithm which combines tabu search methods and mathematical programming techniques is proposed to solve the problem of berth assignment and quay crane assignment in container terminals, which aims to maximize the total value of chosen QC profiles and minimize the housekeeping costs generated by transshipment flows between ships.
Journal ArticleDOI

Berth Allocation at Indented Berths for Mega-containerships

TL;DR: A new integer linear programming formulation is constructed for easier calculation and extended to model the berth allocation problem at a terminal with indented berths, where both mega-containerships and feeder ships are to be served for higher berth productivity.
Journal ArticleDOI

Variable neighborhood search for minimum cost berth allocation

TL;DR: A Variable Neighborhood Search (VNS) heuristic is proposed and outperforms MS, MA and GA on large instances and provides optimal solutions for all instances solved to optimality in a previous paper of the first two authors.
Journal ArticleDOI

An Integrated Model for Berth Template and Yard Template Planning in Transshipment Hubs

TL;DR: A mixed-integer programming model is proposed to integrate the berth template and the yard template planning with the aim to minimize the service cost that is incurred by the deviation from vessels' expected turnaround time intervals, and the operation cost related to the route length of transshipment container flows in yard.
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)