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.

Container terminal operation and operations research — a classification and literature review

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.

Operations research at container terminals: a literature update

Thank you very much for downloading likelihood based inference in cointegrated vector autoregressive models. Maybe you have knowledge that, people have look hundreds times for their chosen books like this likelihood based inference in cointegrated vector autoregressive models, but end up in harmful downloads. Rather than reading a good book with a cup of coffee in the afternoon, instead they cope with some malicious bugs inside their desktop computer.

Likelihood Based Inference In Cointegrated Vector Autoregressive Models

A survey of berth allocation and quay crane scheduling problems in container terminals

Multimodal freight transportation planning : a literature review

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.

The Dynamic Berth Allocation Problem for a Container Port

The dynamic berth allocation problem for a container port

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.

/pdf/berth-allocation-in-a-container-port-using-a-continuous-5fzuwx2yrk.pdf

Berth allocation in a container port: using a continuous location space approach

This paper addresses the design of container liner shipping service networks by explicitly taking into account empty container repositioning. Two key and interrelated issues, those of deploying ships and containers are usually treated separately by most existing studies on shipping network design. In this paper, both issues are considered simultaneously. The problem is formulated as a two-stage problem. A genetic algorithm-based heuristic is developed for the problem. Through a number of numerical experiments that were conducted it was shown that the problem with the consideration of empty container repositioning provides a more insightful solution than the one without.

/pdf/the-container-shipping-network-design-problem-with-empty-3ory1o2799.pdf

Stratos Papadimitriou

Papers

The Dynamic Berth Allocation Problem for a Container Port

The dynamic berth allocation problem for a container port

Berth allocation in a container port: using a continuous location space approach

The container shipping network design problem with empty container repositioning

Berth allocation planning in the public berth system by genetic algorithms