The berth-scheduling problem is considered with the objective of increasing customer satisfaction by minimizing the late berthing or departure and maximizing the early and timely berthing or departure of vessels. Vessel priority also is considered through the use of weights. An adaptive local search heuristic is developed to solve the resulting problem using a Markovian walk and a time window partitioning approach to improve convergence patterns and the objective function values. Results obtained from the heuristic are shown to be robust, and convergence rates and patterns are promising.
Get full access to this article
View all access options for this article.
References
1.
NotteboomT. E.The Time Factor in Liner Services. Maritime Economics and Logistics, Vol. 8, 2006, pp. 19–39.
2.
TheofanisS.BoileM. and GoliasM. M.Container Terminal Berth Planning: Critical Review of Research Approaches and Practical Challenges. In Transportation Research Record: Journal of the Transportation Research Board, No. 2100, Transportation Research Board of the National Academies, Washington, D.C., 2009, pp. 22–28.
3.
GoliasM. M. The Discrete and Dynamic Berth Allocation Problem: Models and Algorithms. PhD thesis. Rutgers University, New Brunswick, N.J., 2007.
4.
HansenP.OguzC. and MladenovicN.Variable Neighborhood Search for Minimum Cost Berth Allocation. European Journal of Operational Research, Vol. 131, No. 32008, pp. 636–649.
5.
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.
6.
ImaiA.NishimuraE. and PapadimitriouS.Berth Allocation with Service Priority. Transportation Research, Part B, Vol. 37, No. 52003, pp. 437–457.
7.
ImaiA.ZhangJ.-T.NishimuraE. and PapadimitriouS.The Berth Allocation Problem with Service Time and Delay Time Objectives. Maritime Economics and Logistics, Vol. 9, No. 42007, pp. 269–290.
8.
GuanY. and CheungR. K.The Berth Allocation Problem: Models and Solution Methods. OR Spectrum, Vol. 26, 2004, pp. 75–92.
9.
ImaiA.SunX.NishimuraE. and PapadimitriouS.Berth Allocation in a Container Port: Using a Continuous Location Space Approach. Transportation Research, Part B, Vol. 39, No. 32005, pp. 199–221.
10.
KimK. H. and MoonK. C.Berth Scheduling by Simulated Annealing. Transportation Research, Part B, Vol. 37, No. 62003, pp. 541–560.
11.
MoorthyR. and TeoC.-P.Berth Management in Container Terminal: The Template Design Problem. OR Spectrum, Vol. 28, 2006, pp. 495–518.
12.
ParkM. Y. and KimH. K. A.A Scheduling Method for Berth and Quay Cranes. Operations Research Spectrum, Vol. 25, 2003, pp. 1–23.
13.
GoliasM. M.TheofanisS. and BoileM.The Simultaneous Berth and Quay Crane Scheduling. In Proc., 2nd National Urban Freight Conference, Long Beach, Calif., 2007.
14.
ImaiA.ChenH. C.NishimuraE. and PapadimitriouS.The Simultaneous Berth and Quay Crane Allocation Problem. Transportation Research, Part E, Vol. 44, No. 52007, pp. 900–920.
15.
PinedoM.Scheduling: Theory, Algorithms, and Systems, 3rd ed. Springer, New York, 2008.
16.
PapadimitriouH. C. and SteiglitzK.Combinatorial Optimization: Algorithms and Complexity.Dover Publications, Mineola, N.Y., 1982.
17.
LourencoH. R.Job-Shop Scheduling: Computational Study of Local Search and Large-Step Optimization Methods. European Journal of Operational Research, Vol. 83, 1995, pp. 347–364.
18.
BoileM.TheofanisS. and GoliasM. M.Berth Allocation with Service Priorities: A Linear Model Formulation. In Proc., 5th WSEAS/IASME International Conference on System Science and Simulation in Engineering (ICOSSSE 2006), Tenerife, Canary Islands, Spain, 2006.
19.
ImaiA.NishimuraE. and PapadimitriouS.Berthing Ships at a MultiUser Container Terminal with a Limited Quay Capacity. Transportation Research, Part E, Vol. 44, No. 12008, pp. 136–151.
EibenA. E. and SmithJ. E.Introduction to Evolutionary Computing.Springer, New York, 2003.
22.
GoldbergD. E.Genetic Algorithms in Search, Optimization, and Machine-Learning.Addison-Wesley, Reading, Mass., 1989.
23.
ShiX. and XiaH.Interactive Bi-Level Multi-Objective Decision Making. Journal of the Operational Research Society, Vol. 48, 1997, pp. 943–949.
24.
MasudA. S. M. A Study of Multiple Objective Decision Making Methods and Applications. PhD thesis. Kansas State University, Manhattan, 1978.
25.
Abo-SinnaM. A. and BakyI. A.Interactive Balance Space Approach for Solving Multi-Level Multi-Objective Programming Problems. Information Science, Vol. 177, 2007, 3397–3410.
26.
ConejoA. J.MinguezR.CastilloE. and Garcia-BertrandR.Decomposition Techniques in Mathematical Programming.Springer-Verlag, Berlin, 2006.
