Abstract
This paper introduces the ”block moves” neighborhood for the Multiple Depot Vehicle Scheduling Problem. Experimental studies are carried out on a set of benchmark instances to assess the quality of the proposed neighborhood and to compare it with two existing neighborhoods using shift and swap. The ”block moves” neighborhood can be beneficial for any local search algorithm.
Partially supported by the French Research Ministry (CIFRE No. 176/2004).
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
Bertossi, A., Carraresi, P., Gallo, G.: On some matching problems arising in vehicle scheduling models. Networks 17, 271–281 (1987)
Odoni, A.R., Rousseau, J.M., Wilson, N.H.: Models in urban and air transportation, vol. 6, pp. 107–150. Elsevier Science, North-Holland, Amsterdam (1994)
Desaulniers, G., Hickman, M.: Public transit, pp. 69–120. Elsevier Science, North-Holland, Amsterdam (2007)
Pepin, A.S., Desaulniers, G., Hertz, A., Huisman, D.: Comparison of heuristic approaches for the multiple vehicle scheduling problem. Technical Report EI2006-34, Economie Institute, Erasmus University Rotterdam, Rotterdam (2006)
Glover, F.: Ejection chains, reference structures and alternating path methods for traveling salesman problems. Discrete Applied Mathematics 65(1-3), 223–253 (1996)
Carpenato, G., Dell’Amico, M., Fischetti, M., Toth, P.: A branch and bound algorihm for the multiple depot vehicle scheduling problem. Networks 19, 531–548 (1989)
Di Gaspero, L., Schaerf, A.: Neighborhood portfolio approach for local search applied to timetabling problems. Journal of Mathematical Modeling and Algorithms 5(1), 65–89 (2006)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Laurent, B., Hao, JK. (2007). A Study of Neighborhood Structures for the Multiple Depot Vehicle Scheduling Problem. In: Stützle, T., Birattari, M., H. Hoos, H. (eds) Engineering Stochastic Local Search Algorithms. Designing, Implementing and Analyzing Effective Heuristics. SLS 2007. Lecture Notes in Computer Science, vol 4638. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74446-7_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-74446-7_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74445-0
Online ISBN: 978-3-540-74446-7
eBook Packages: Computer ScienceComputer Science (R0)