Schedule Template Design and Storage Allocation for Cyclically Visiting Feeders in Container Transshipment Hubs

Abstract

This paper studies the management of transshipment flows in a container terminal. Management consists of designing a visiting schedule template for feeder vessels and determining storage locations for transshipment containers. A mixed integer programming formulation is developed; it includes the objective of minimizing both the total distance traveled by transshipment flows between quayside and storage yard and the workload imbalance in time. To solve the problem, an algorithm is devised on the basis of Lagrangian relaxation to find near-optimal solutions within short computational times. Numerical experiments are conducted to assess (a) the effectiveness and efficiency of the algorithm and (b) the benefit from adjusting feeder visiting schedule.

Get full access to this article

View all access options for this article.

References

Review of Maritime Transport, 2008. United Nations Conference on Trade and Development, Geneva, 2008.

Giallombardo

, Moccia

, Salani

, and Vacca

. Modeling and Solving the Tactical Berth Allocation Problem. Transportation Research Part B: Methodological, Vol. 44, No. 2, 2010, pp. 232–245.

Vacca

, Bierlaire

, and Salani

. Optimization at Container Terminals: Status, Trends and Perspectives. TRANSP-OR 071204. Transport and Mobility Laboratory, National Polytechnic School of Lausanne, Lausanne, Switzerland, 2007.

Steenken

, Voss

, and Stahlbock

. Container Terminal Operation and Operations Research: A Classification and Literature Review. OR Spectrum, Vol. 26, No. 1, 2004, pp. 3–49.

Stahlbock

, and Voss

. Operations Research at Container Terminals: A Literature Update. OR Spectrum, Vol. 30, No. 1, 2008, pp. 1–52.

W.C.

, Mak

K.L.

, and Li

M. K.

Yard Planning for Vessel Services with a Cyclical Calling Pattern. Engineering Optimization, Vol. 42, No. 11, 2010, pp. 1039–1054.

Kim

K.H.

, and Kim

H. B.

Segregating Space Allocation Models for Container Inventories in Port Container Terminals. International Journal of Production Economics, Vol. 59, No. 1–3, 1999, pp. 415–423.

Zhang

, Liu

, Wan

, Murty

K.G.

, and Linn

R. J.

Storage Space Allocation in Container Terminals. Transportation Research Part B: Methodological, Vol. 37, No. 10, 2003, pp. 883–903.

Chen

, Fu

Z.H.

, Lim

, and Rodrigues

. Port Yard Storage Optimization. IEEE Transactions on Automation Science and Engineering, Vol. 1, No. 1, 2004, 26–37.

10.

Moccia

, and Astorino

. The Group Allocation Problem in a Transshipment Container Terminal. Proc., World Conference on Transport Research, University of California, Berkeley, 2007.

11.

Moccia

, Cordeau

J.F.

, Monaco

M.F.

, and Sammarra

. A Column Generation Heuristic for a Dynamic Generalized Assignment Problem. Computers and Operations Research, Vol. 36, No. 9, 2009, pp. 2670–2681.

12.

Moorthy

, and Teo

C. P.

Berth Management in Container Terminal: The Template Design Problem. OR Spectrum, Vol. 28, No. 4, 2006, pp. 495–518.

13.

Held

, and Karp

R. M.

The Traveling-Salesman Problem and Minimum Spanning Trees. Operations Research, Vol. 18, No. 6, 1970, pp. 1938–1962.

14.

Held

, and Karp

R. M.

The Traveling-Salesman Problem and Minimum Spanning Trees: Part II. Mathematical Programming, Vol. 1 No. 1, 1971, pp. 6–25.

15.

Zhang

, Wan

Y.W.

, Liu

J.Y.

, and Linn

R. J.

Dynamic Crane Deployment in Container Storage Yards. Transportation Research Part B: Methodological, Vol. 36, No. 6, 2002, pp. 537–555.

16.

Monaco

M.F.

, and Sammarra

. The Berth Allocation Problem: A Strong Formulation Solved by a Lagrangean Approach. Transportation Science, Vol. 41, No. 2, 2007, pp. 265–280.