Berth allocation planning in the public berth system by genetic algorithms
TL;DR: 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.
Citations
More filters
TL;DR: The main logistics processes and operations in container terminals are described and classified and a survey of methods for their optimization is presented.
Abstract: In the last four decades the container as an essential part of a unit-load-concept has achieved undoubted importance in international sea freight transportation. With ever increasing containerization the number of seaport container terminals and competition among them have become quite remarkable. Operations are nowadays unthinkable without effective and efficient use of information technology as well as appropriate optimization (operations research) methods. In this paper we describe and classify the main logistics processes and operations in container terminals and present a survey of methods for their optimization.
1,158 citations
Cites background from "Berth allocation planning in the pu..."
...[146] focus on the problem of dynamic berth assignment to ships in the public berth system (not especially container ports; it is emphasized that these systems and, therefore, the shown results ‘may not be suitable for most container ports of major countries’)....
[...]
...Similar to [146], Imai et al....
[...]
TL;DR: An earlier survey which proved to be of utmost importance for the community is updated and extended to provide the current state of the art in container terminal operations and operations research.
Abstract: The current decade sees a considerable growth in worldwide container transportation and with it an indispensable need for optimization. Also the interest in and availability of academic literatures as well as case reports are almost exploding. With this paper an earlier survey which proved to be of utmost importance for the community is updated and extended to provide the current state of the art in container terminal operations and operations research.
1,016 citations
TL;DR: New classification schemes for berth allocation problems and quay crane scheduling problems are developed and particular focus is put on integrated solution approaches which receive increasing importance for the terminal management.
722 citations
TL;DR: In the berth-allocation problem (BAP), the aim is to optimally schedule and assign ships to berthing areas along a quay to minimization of the total service time for all ships.
Abstract: In the berth-allocation problem (BAP) the aim is to optimally schedule and assign ships to berthing areas along a quay. The objective is the minimization of the total (weighted) service time for all ships, defined as the time elapsed between the arrival in the harbor and the completion of handling. Two versions of the BAP are considered: the discrete case and the continuous case. The discrete case works with a finite set of berthing points. In the continuous case ships can berth anywhere along the quay. Two formulations and a tabu search heuristic are presented for the discrete case. Only small instances can be solved optimally. For these sizes the heuristic always yields an optimal solution. For larger sizes it is always better than a truncated branch-and-bound applied to an exact formulation. A heuristic is also developed for the continuous case. Computational comparisons are performed with the first heuristic and with a simple constructive procedure.
363 citations
Cites background from "Berth allocation planning in the pu..."
...Nishimura et al. (2001) have presented a non-linear integer program and a genetic algorithm based on a different representation of the spatial dimension in which the quay is a collection of segments and up to two ships can share the same segment at the same time if their lengths are compatible with…...
[...]
TL;DR: In this paper, a heuristic for the berth allocation problem in continuous locations is presented and a wide variety of experiments were conducted and the results showed that the heuristic works well from a practical point of view.
Abstract: This paper addresses the berth allocation problem in a multi-user container terminal. There are two typical schemes for berth allocation: one in discrete locations and the other in continuous locations. The former has the advantage of easiness in scheduling but it has a weakness in that terminal usage is not fully efficient. The latter exhibits the complete opposite characteristics. In previous papers, the authors have developed and presented the discrete location version of the berth allocation problem. In view of the steadily growing trend in increasing the container ship size, more flexible berth allocation planning is mandatory, especially in busy hub ports where ships of various sizes are calling. In this paper, a heuristic for the berth allocation problem in continuous locations is presented. A wide variety of experiments were conducted and the results showed that the heuristic works well from a practical point of view.
348 citations
References
More filters
Book•
15 Jul 1994
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.
Abstract: This book on scheduling covers theoretical models as well as scheduling problems in the real world. Author Michael Pinedo also includes a CD that contains slide-shows from industry and movies dealing with implementations of scheduling systems. The book consists of three parts. The first part focuses on deterministic scheduling with the associated combinatorial problems. The second part covers probabilistic scheduling models. In this part it is assumed that processing times and other problem data are not known in advance. The third part deals with scheduling in practice. It covers heuristics that are popular with practitioners and discusses system design and development issues. Each chapter contains a series of computational and theoretical exercises. This book is of interest to theoreticians and practitioners alike. Graduate students in operations management, operations research, industrial engineering and computer science will find the book to be an accessible and invaluable resource. Scheduling will serve as an essential reference for professionals working on scheduling problems in manufacturing and computing environments. Michael Pinedo is the Julius Schlesinger Professor of Operations Management at New York University.
6,209 citations
01 Mar 2003
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.
Abstract: This paper addresses the problem of determining a dynamic berth assignment to ships in the public berth system. While the public berth system may not be suitable for most container ports in major countries, it is desired for higher cost-effectiveness in Japan's ports. The berth allocation to calling ships is a key factor for efficient public berthing. However, it is not calculated in polynomially-bounded time. To obtain a good solution with considerably small computational effort, we developed a heuristic procedure based on the Lagrangian relaxation of the original problem. We conducted a large amount of computational experiments which showed that the proposed algorithm is adaptable to real world applications.
473 citations
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.
Abstract: This paper addresses the problem of determining a dynamic berth assignment to ships in the public berth system. While the public berth system may not be suitable for most container ports in major countries, it is desired for higher cost-effectiveness in Japan's ports. The berth allocation to calling ships is a key factor for efficient public berthing. However, it is not calculated in polynomially-bounded time. To obtain a good solution with considerably small computational effort, we developed a heuristic procedure based on the Lagrangian relaxation of the original problem. We conducted a large amount of computational experiments which showed that the proposed algorithm is adaptable to real world applications.
459 citations
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.
Abstract: Berth allocation is essential for efficient terminal utilization in container ports, especially those in Asia. This paper is concerned with a berth allocation problem(BAP) that minimizes the sum of port staying times of ships and that minimizes dissatisfaction of the ships in terms of the berthing order. In general there exist tradeoffs between these objectives. An algorithm is presented to identify noninferior solutions to the BAP. The algorithm is demonstrated with some sample problems and the results indicate the importance of the problem in efficient terminal utilization.
274 citations
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.
Abstract: This study is based on a major container terminal operator in Hong Kong. Container terminals form a link in the transport chain for transhipment and temporary storage of containers. The service time for vessels including waiting time for berthing must be minimal in order to reduce costs for shipping lines. The use of heuristics and computer simulation to measure different allocation strategies is demonstrated. The existing performance measures of allocation are evaluated and prioritized. 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. Results show that all three proposed allocation policies have substantial improvements over the existing policy.
142 citations