The stochastic discrete berth allocation problem
- 116 Downloads
This paper deals with the discrete berth allocation problem with stochastic arrival times of vessels. The problem is to assign incoming vessels to a finite set of berthing points (berths) and to schedule them. The major objective is to minimize the expected total turnaround time of the vessels. We develop several new proactive, reactive and proactive/reactive approaches to this problem. Numerical experiments enable to compare these approaches. They show the impact of using full stochastic information instead of using mean values in a deterministic setting. The proactive/reactive approach, based on iterated tabu search and stochastic dynamic programming, provides good results when uncertainties on arrival times remain limited, while requiring only a few minutes of computing time on average. For larger levels of uncertainty, the proposed pure reactive approach clearly outperforms the others.
KeywordsContainer terminal logistics Discrete berth scheduling Stochastic optimization Iterated tabu search Dynamic programming
This work was financed by French Government, region of Normandy, and European Union within 4TRAX and CLASSE projects.
- Bertsekas D (2017) Dynamic programming and optimal control, vol 1. 4th edn. Athena Scientific, NashuaGoogle Scholar
- Christensen CG, Holst CT (2008) Berth allocation in container terminals. Master’s thesis, Technical University of DenmarkGoogle Scholar
- Dai J, Lin W, Moorthy R, Teo CP (2008) Berth allocation planning optimization in container terminals. In: Tang CS, Teo CP, Wei KK (eds) Supply chain analysis. International series in operations research & mana, vol 119. Springer, Boston, pp 69–104. https://doi.org/10.1007/978-0-387-75240-2_4 CrossRefGoogle Scholar
- Davenport AJ, Beck JC (2000) A survey of techniques for scheduling with uncertainty. http://tidel.mie.utoronto.ca/publications.php (unpublished manuscript)
- Du Y, Xu Y, Chen Q (2010) A feedback procedure for robust berth allocation with stochastic vessel delays. In: 8th World congress on intelligent control and automation (WCICA), 2010, pp 2210–2215Google Scholar
- Maischberger M (2011) Coin-or metslib a metaheuristics framework in modern C++. Technical report, Optimization OnlineGoogle Scholar
- Ruszczynski A, Shapiro A (2003) Stochastic programming. Handbooks in operations research and management science, vol 10Google Scholar
- Zhou P, Kang H, Lin L (2006) A dynamic berth allocation model based on stochastic consideration. In: 2006 6th World congress on intelligent control and automation, vol 2. IEEE, New York, pp 7297–7301Google Scholar