Abstract
In this paper, the berth allocation problem with stochastic vessel handling times is formulated as a bi-objective problem. To solve the resulting problem, an evolutionary algorithm-based heuristic and a simulation-based Pareto front pruning algorithm is proposed. Computational examples show that the proposed approach provides solutions superior to the ones where the expected value of the vessel handling times is used.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Briand C, La Trung H, Erschler J (2007) A robust approach for the single machine scheduling problem. J Scheduling 10:209–221
Cartenì A, de Luca S (2009) A micro simulation model of the Salerno container terminal. Technical paper, Dept. Of Civil Engineering, University of Salern. http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.127.7218&rep=rep1&type=pdf
Cowling P, Johansson M (2002) Using real time information for effective dynamic scheduling. Eur J Oper Res 139:230–244
Du Y, Xu Y, Chen Q (2010) A feedback procedure for robust berth allocation with stochastic vessel delays. In: Proceedings of the World Congress on Intelligent Control and Automation, IEEE, Jinan, China, 2210–2215
Eiben AE, Smith JE (2003) Introduction to evolutionary computing. Springer, New York
Goldberg DE (1989) Genetic algorithms in search, optimization, and machine learning. Addison-Wesley, Reading
Golias MM, Boilé M, Theofanis S (2007) The stochastic berth scheduling problem. Proceedings of the Second TRANSTEC Conference. Prague, Czech Republic
Golias MM, Boilé M, Theofanis S (2010) Discrete berth scheduling problem: towards a unified mathematical formulation. In: Journal of the Transportation Research Board: Transportation Research Record, vol 2168., pp 1–8
Imai A, Nagaiwa K, Tat CW (1997) Efficient planning of berth allocation for container terminals in Asia. J Adv Transp 31:75–94
Imai A, Nishimura E, Papadimitriou S (2001) The dynamic berth allocation problem for a container port. In: Transportation Research Part B: Methodological, vol 35., pp 401–417
Meisel F (2009) Seaside operations planning in container terminals. Physica, Berlin
Moorthy R, Teo CP (2006) Berth management in container terminal: the template design problem. OR Spectr 28(4):495–518
Pfeiffer A, Kádár B, Monostori L (2007) Stability-oriented evaluation of rescheduling strategies, by using simulation. Comput Ind 58(7):630–643
Saharidis GKD, Golias MM, Boilé M, Theofanis S, Ierapetritou M (2010) The berth scheduling problem with customer differentiation: a new methodological approach based on hierarchical optimization. Int J Adv Manuf Technol 46(1–4):377–393
Theofanis S, Boile M, Golias MM (2009) Container terminal berth planning: critical review of research approaches and practical challenges. Transp Res Rec J Trans Res Board Mar Transp Port Oper 2100:22–28
Wang B, Lai X, Xi L (2005) Single-machine partial rescheduling with bi-criterion based on genetic algorithm. Adv Intell Comput 3644:947–956
Winston W (2003) Operations research applications and algorithms, 4th edn. California, USA, Duxbury Press
Wu SD, Storer RH, Chang PC (1993) One-machine rescheduling heuristics with efficiency and stability as criteria. Comput Oper Res 20:1–14
Zhou PF, Kang HG (2008) Study on berth and quay crane allocation under stochastic environments in container terminal. Syst Eng Theory Pract 28(1):161–169
Zhou PF, Kang HG, Lin L (2006) A dynamic berth allocation model based on stochastic consideration. In: Proceedings of the 6th World Conference on Intelligent Control and Automation, IEEE. Dalian, China
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Karafa, J., Golias, M.M., Ivey, S. et al. The berth allocation problem with stochastic vessel handling times. Int J Adv Manuf Technol 65, 473–484 (2013). https://doi.org/10.1007/s00170-012-4186-0
Received:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00170-012-4186-0