Abstract
In this paper we present a number of (meta-)heuristics for tackling the lock scheduling problem. The lock scheduling problem is introduced as the problem of minimising both the water usage of the lock and the waiting time of all the ships. The performance of several local search heuristics with the best improving criterion and the late acceptance criterion is examined. First parameter values for the late acceptance list length are determined.With these values all heuristics and criteria are applied to a large test set. From these experiments we conclude that the performance of the heuristics is increased by the late acceptance criterion.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bish, E.K.: A multiple-crane-constrained scheduling problem in a container terminal. European Journal of Operational Research 144(1) (2003) 83–107
Burke, E.K., Bykov, Y.: A late acceptance strategy in hill-climbing for exam timetabling problems. In: Burke, E., Gendreau, M., (eds.): Proc. of the 7th International Conference on the Practice and Theory of Automated Timetabling, Montreal (2008)
Chen, L., Bostel, N., Dejax, P., Cai, J., Xi, L.: A tabu search algorithm for the integrated scheduling problem of container handling systems in a maritime terminal. European Journal of Operational Research 181(1) (2007) 40–58
Cullinane, K., Khanna, M.: Economies of scale in large containerships: optimal size and geographical implications. Journal of Transport Geography 8 (2000)
Meersmans, P.: Optimization of Container Handling Systems. PhD thesis, Tinbergen (2002)
Nauss, R.M.: Optimal sequencing in the presence of setup times for tow/barge traffic through a river lock. European Journal of Operational Research 187 (2008) 1268–1281
Sniedovich, M., Voß, S.: The corridor method: a dynamic programming inspired metaheuristic. Control and Cybernetics 35 (2006) 551–578
Stahlbock, R., Voß, S.: Operations research at container terminals: a literature update. OR Spectrum 30 (2008) 1–52
Verstichel, J.: Project web page of lock scheduling with parallel chambers. http://allserv.kahosl.be/~jannes/lockplanning
Wilson, H.G.: On the applicability of queueing theory to lock capacity analysis. Transportation Research 12 (1978) 175–180
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Physica-Verlag Heidelberg
About this paper
Cite this paper
Verstichel, J., Berghe, G.V. (2009). A Late Acceptance Algorithm for the Lock Scheduling Problem. In: Voß, S., Pahl, J., Schwarze, S. (eds) Logistik Management. Physica-Verlag HD. https://doi.org/10.1007/978-3-7908-2362-2_23
Download citation
DOI: https://doi.org/10.1007/978-3-7908-2362-2_23
Published:
Publisher Name: Physica-Verlag HD
Print ISBN: 978-3-7908-2361-5
Online ISBN: 978-3-7908-2362-2
eBook Packages: Business and Economics (German Language)