A comparative, up-to-date, critical review of existing research efforts relating to berth planning is presented. Existing models are critically reviewed on the basis of their efficiency in addressing key operational and tactical questions relating to vessel service and their relevance and applicability to different marine terminal operator berth-planning strategies and contractual service arrangements between terminal operators and ocean carriers. The strengths and deficiencies of the existing models in addressing real-world problems in a systemic and coherent manner are discussed. The paper concludes with some insights for future research issues.
Get full access to this article
View all access options for this article.
References
1.
StahlbockR. and VossS.. Operations Research at Container Terminals: A Literature Update. OR Spectrum, Vol. 30, 2007, pp. 1–52.
2.
SteenkenD.VossS. and StahlbockR.. Container Terminal Operation and Operations Research—A Classification and Literature Review. OR Spectrum, Vol. 26, 2004, pp. 3–49.
3.
VisI. F. A. and de KosterR.. Transshipment of Containers at a Container Terminal: An Overview. European Journal of Operational Research, Vol. 147, 2003, pp. 1–16.
4.
MeersmansP. J. M. and DekkerR.. Operations Research Supports Container Handling.Econometric Institute Report EI 2001-22. Erasmus University, Rotterdam, Netherlands, 2001.
5.
PinedoM.Scheduling: Theory, Algorithms, and Systems, 3rd ed. Springer, New York, 2008.
6.
NikolaouN. S.Berth Planning by Evaluation of Congestion and Cost. Journal of Waterways Highways Division, Proceedings of the American Society of Civil Engineers, Vol. 93, 1967, pp. 107–132.
7.
EdmondE. D. and MaggsR. P.. How Useful Are Queue Models in Port Investment Decisions for Container Berths?Journal of the Operational Research Society, Vol. 29, 1978, pp. 741–750.
8.
LegatoP. and MazzaR.. Berth Planning and Resources Optimization at a Container Terminal via Discrete Event Simulation. European Journal of Operational Research, Vol. 133, No. 32001, pp. 537–547.
9.
DragovićB.ParkN.-K. and RadmilovićZ.Ship-Berth Link Performance Evaluation: Simulation and Analytical Approaches. Maritime Policy & Management, Vol. 33, No. 32006, pp. 281–299.
10.
CanonacoP.LegatoP.MazzaR. and MusmannoR.. A Queuing Network Model for the Management of Berth Crane Operations. Computers and Operations Research, Vol. 35, No. 82008, pp. 2432–2446.
11.
LaiK. K. and ShihK.. A Study of Container Berth Allocation. Journal of Advanced Transportation, Vol. 26, 1992, pp. 45–60.
12.
BrownG. G.LawphongpanichS. and ThurmanK. P.. Optimizing Vessel Berthing. Naval Research Logistics, Vol. 41, 1994, pp. 1–15.
13.
BrownG. G.CormicanK. J.LawphongpanichS. and WiddisD. B.. Optimizing Submarine Berthing with a Persistence Incentive. Naval Research Logistics, Vol. 44, 1997, pp. 301–318.
14.
ImaiA.NagaiwaK. and TatC.-W.. Efficient Planning of Berth Allocation for Container Terminals in Asia. Journal of Advanced Transportation, Vol. 31, 1997, pp. 75–94.
15.
LiC.-L.CaiX. and LeeC.-Y.. Scheduling with Multiple-Job-on-One-Processor Pattern. IIE Transactions, Vol. 30, 1998, pp. 433–445.
16.
GuanY.XiaoW.-Q.CheungR. K. and LiC.-L.. A Multiprocessor Task Scheduling Model for Berth Allocation: Heuristic and Worst Case Analysis. Operations Research Letters, Vol. 30, 2002, pp. 343–350.
17.
LimA.The Berth Planning Problem. Operations Research Letters, Vol. 22, 1998, pp. 105–110.
18.
ImaiA.NishimuraE. and PapadimitriouS.. The Dynamic Berth Allocation Problem for a Container Port. Transportation Research, Part B, Vol. 35, 2001, pp. 401–417.
19.
ParkK. T. and KimK. H.. Berth Scheduling for Container Terminals by Using Sub-Gradient Optimization Techniques. Journal of Operational Research Society, Vol. 53, 2002, pp. 1054–1062.
20.
TongC. J.LauH. C. and LimA.. Ant Colony Optimization for the Ship Berthing Problem. Proc., Asian Computer Science Conference (ASIAN), 1999, pp. 359–370.
21.
NishimuraE.ImaiA. and PapadimitriouS.. Berth Allocation Planning in the Public Berth System by Genetic Algorithms. European Journal of Operational Research, Vol. 131, 2001, pp. 282–292.
22.
HansenP. and OguzC.. A Note on Formulations of Static and Dynamic Berth Allocation Problems.Report, Les Cahiers du Gerad, G-2003-20. HEC, Montreal, Quebec, Canada, 2003.
23.
ImaiA.NishimuraE. and PapadimitriouS.. Corrigendum to: The Dynamic Berth Allocation Problem for a Container Port. Transportation Research, Part B, Vol. 39, No. 3, 2005, p. 197.
24.
TheofanisS.BoileM. and GoliasM. M.. Container Terminal Seaside Operations Scheduling: Does Current Research Address the Practical Challenges of Berth Planning? A Critical Review.Research Report CAIT-MIEMP-BAP-01. Rutgers University, Piscataway, N.J., 2007.
25.
ImaiA.NishimuraE. and PapadimitriouS.. Berth Allocation with Service Priority. Transportation Research, Part B, Vol. 37, 2003, pp. 437–457.
26.
KimK. H. and MoonK. C.. Berth Scheduling by Simulated Annealing. Transportation Research, Part B, Vol. 37, 2003, pp. 541–560.
27.
ParkM. Y. and KimH. K. A.Scheduling Method for Berth and Quay Cranes. OR Spectrum, Vol. 25, 2003, pp. 1–23.
28.
MieselF. and BierwirthC.. Integration of Berth Allocation and Crane Assignment to Improve the Resource Utilization at a Seaport Container Terminal. Operations Research Proceedings 2005, Springer, Berlin, 2006.
29.
LeeD.-H.SongL. and WangH.. BiLevel Programming Model and Solutions of Berth Allocation and Quay Crane Scheduling. Presented at 85th Annual Meeting of the Transportation Research Board, Washington, D.C., 2006.
GuanY. and CheungR. K.. The Berth Allocation Problem: Models and Solution Methods. OR Spectrum, Vol. 26, 2004, pp. 75–92.
32.
ImaiA.SunX.NishimuraE. and PapadimitriouS.. Berth Allocation in a Container Port: Using Continuous Location Space Approach. Transportation Research, Part B, Vol. 39, 2005, pp. 199–221.
33.
CordeauJ.-F.LaporteG.LegatoP. and MocciaL.. Models and Tabu Search Heuristics for the Berth Allocation Problem. Transportation Science, Vol. 39, 2005, pp. 526–538.
34.
BrianoC.BrianoE.BruzzoneA. G. and RevetriaR.. Models for Support of Maritime Logistics: A Case Study for Improving Terminal Planning. Proc., 19th European Conference on Modeling and Simulation, Riga, Latvia, 2005.
35.
LokugeP. and AlahakoonP.. Improving the Adaptability in Automated Vessel Scheduling in Container Ports Using Intelligent Software Agents. European Journal of Operational Research, Vol. 177, No. 32007, pp. 1985–2015.
36.
ImaiA.NishimuraE.HattoriM. and PapadimitriouS.. Berth Allocation at Indented Berths for Mega-Containerships. European Journal of Operations Research, Vol. 179, No. 22007, pp. 579–593.
37.
ImaiA.NishimuraE. and PapadimitriouS.. Berthing Ships at a MultiUser Container Terminal with a Limited Quay Capacity. Transportation Research, Part E, Vol. 44, No. 12007, pp. 136–151.
38.
WangF. and LimA.. A Stochastic Beam Search for the Berth Allocation Problem. Decision Support Systems, Vol. 42, 2007, pp. 2186–2196.
39.
BoileM.TheofanisS. and GoliasM. M.. Berth Allocation with Service Priorities: A Linear Reformulation. Proc., 5th WSEAS International Conference on System Science and Simulation in Engineering, Tenerife, Canary Islands, Spain, 2006.
40.
GoliasM.BoileM. and TheofanisS.. Berth Allocation Problem: Formulation Reflecting Service Delay Penalties and Early Premiums. Presented at 86th Annual Meeting of the Transportation Research Board, Washington, D.C., 2007.
41.
GoliasM. M.BoileM. and TheofanisS.. The Berth Allocation Problem: A Formulation Reflecting Time Window Service Deadlines. Proc., 48th Annual Transportation Research Forum, Boston, Mass., 2007.
42.
BoileM.TheofanisS. and GoliasM. M.. Berth Planning by Customer Service Differentiation: A Multi-Objective Approach. Proc., 11th World Conference on Transportation Research, Berkeley, Calif., 2007.
43.
HansenP.OguzC. and MladenovicN.. Variable Neighborhood Search for Minimum Cost Berth Allocation. European Journal of Operational Research, Vol. 131. No. 3, 2008, pp. 636–649.
44.
MoorthyR. and TeoC.-P.. Berth Management in Container Terminal: The Template Design Problem. OR Spectrum, Vol. 28, No. 42006, pp. 495–518.
45.
MonacoM. F. and SamaraM.. The Berth Allocation Problem: A Strong Formulation Solved by a Lagrangean Approach. Transportation Science, Vol. 41, No. 22007, pp. 265–280.
46.
TheofanisS.GoliasM. M. and BoileM.. An Adaptive Local Search Heuristic for the Discrete Berth Allocation Problem. Proc., 2nd Annual National Urban Freight Conference, Long Beach, Calif., 2007.
47.
GoliasM.TheofanisS.BoileM. and TaboadaH. A.. Post-Pareto Analysis Approach for Discrete and Dynamic Multiobjective Berth Allocation Problem. Presented at 87th Annual Meeting of the Transportation Research Board, Washington, D.C., 2008.
48.
GoliasM. M.BoileM. and TheofanisS.. A λ-opt Based Heuristic for the Discrete Berth Scheduling Problem. Transportation Research Part C, 2009, forthcoming.
49.
GoliasM. M.BoileM. and TheofanisS.. Service Time Based Customer Differentiation Berth Scheduling. Transportation Research Part E, 2009, forthcoming.
50.
HanM.PingL. and SunJ.. The Algorithm for Berth Scheduling Problem by the Hybrid Optimization Strategy GASA. Proc., 9th International Conference on Control, Automation, Robotics and Vision, Singapore, 2006.
51.
ImaiA.ZhangJ.-T.NishimuraE. and PapadimitriouS.. The Berth Allocation Problem with Service Time and Delay Time Objectives. Maritime Economics & Logistics, Vol. 9, 2007, pp. 269–290.
52.
LeeY. and ChenY.-C.. An Optimization Heuristic for the Berth Scheduling Problem. European Journal of Operational Research, Vol. 196, No. 22009, pp. 500–508.
53.
GoliasM. M.BoileM. and TheofanisS.. A Conceptual Bi-Level Formulation for the Berth Scheduling Problem Incorporating Conflicting Objectives. Proc., International Trade and Freight Transportation Conference, Agia Napa, Cyprus, 2008.
54.
SaharidisG.GoliasM. M.BoileM.TheofanisS. and IerapetritouM.. The Berth Scheduling Problem with Customer Differentiation: A New Methodological Approach Based on Hierarchical Optimization. International Journal of Advanced Manufacturing Technology, forthcoming.
55.
GoliasM. M.BoileM. and TheofanisS.. A Bi-Level Formulation for the Berth Scheduling Problem with Variable Vessel Release Dates. Proc., International Conference on Shipping, Ports, and Logistics, Incheon, South Korea, 2009.
56.
ZhouP.KangH. and LinL.. A Dynamic Berth Allocation Model Based on Stochastic Consideration. Proc., 6th World Congress on Intelligent Control and Automation, Dalian, China, 2006.
57.
NotteboomT. E.The Time Factor in Liner Services. Maritime Economics and Logistics, Vol. 8. No. 1, 2006, pp. 19–39.
58.
ICF Consulting.The Effects of Freight Movement on Air Quality at the National and Regional Level. Final Report. FHWA, U.S. Department of Transportation, 2005. www.fhwa.dot.gov/environment/freightaq/index.htm. Accessed Jan. 27, 2009.
59.
FosseyJ.In the Bunker.CI-Online, 2008. www.ci-online.co.uk/. Accessed Sept. 19, 2008.
60.
WacketM.A Rollercoaster Year in 2007: A White-Knuckle Ride in 2008?CI-Online, 2007. www.ci-online.co.uk/. Accessed Sept. 19, 2008.
