Abstract
The most common approaches to solve the variants of the well-known vehicle routing problem are based on metaheuristic hill-climbing search. The deficiency of these methods is slow local search based hill climbing that often is restricted to limited local neighborhood. In this paper we suggest a novel new two-phase metaheuristic that escapes the local minima with jumps of varying size, instead of step by step local hill climbing. The initial solution is first generated with a powerful ejection pool heuristic. The key idea of the improvement phase is to combine large neighborhood search with standard guided local search metaheuristic in a novel way, allowing improved search diversification and escape from local minima in more efficient way through jumps. The algorithm has been tested on the standard Gehring and Homberger benchmarks for the vehicle routing problem with time windows and the results indicate very competitive performance. We found 12 new and 43 matched best-known solutions and the best overall results for all problem sizes at comparable computation times.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bräysy O, Gendreau M (2005a) Vehicle routing problem with time windows, Part I: route construction and local search algorithms. Transp Sci 39(1):104–118
Bräysy O, Gendreau M (2005b) Vehicle routing problem with time windows. Part II: Metaheuristics. Transp Sci 39(1):119–139
Elhamifar E, Vidal R (2013) Sparse subspace clustering: algorithm, theory, and applications. IEEE Trans Pattern Anal Mach Intell 35(11):2765–2781
Gehring H, Homberger J (1999) A parallel hybrid evolutionary metaheuristic for the vehicle routing problem with time windows. In: Proceedings of EUROGEN99, vol 2, pp 57–64, Citeseer
Golden BL, Raghavan S, Wasil EA (2008) The vehicle routing problem: latest advances and new challenges, vol 43. Springer Science & Business Media
Labadi N, Prins C, Reghioui M (2008) A memetic algorithm for the vehicle routing problem with time windows. RAIRO-Oper Res 42(3):415–431
Lenstra JK, Kan AHG (1981) Complexity of vehicle routing and scheduling problems. Networks 11(2):221–227
Mester D (1999) A parallel dichotomy algorithm for vehicle routing problem with time windows. Technical report, Working paper, Minerva Optimization Center, Technion, Israel
Mester D, Bräysy O (2005) Active guided evolution strategies for large-scale vehicle routing problems with time windows. Comput Oper Res 32(6):1593–1614
Nagata Y, Bräysy O (2009) A powerful route minimization heuristic for the vehicle routing problem with time windows. Oper Res Lett 37(5):333–338
Nagata Y, Bräysy O, Dullaert W (2010) A penalty-based edge assembly memetic algorithm for the vehicle routing problem with time windows. Comput Oper Res 37(4):724–737
Osman IH (1993) Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann Oper Res 41(4):421–451
Pisinger D, Ropke S (2007) A general heuristic for vehicle routing problems. Comput Oper Res 34(8):2403–2435
Potvin J-Y, Rousseau J-M (1995) An exchange heuristic for routeing problems with time windows. J Oper Res Soc 46(12):1433–1446
Prescott-Gagnon E, Desaulniers G, Rousseau L-M (2009) A branch-and-price-based large neighborhood search algorithm for the vehicle routing problem with time windows. Networks 54(4):190–204
Repoussis PP, Tarantilis CD, Ioannou G (2009) Arc-guided evolutionary algorithm for the vehicle routing problem with time windows. IEEE Trans Evol Comput 13(3):624–647
Savelsbergh MWP (1992) The vehicle routing problem with time windows: minimizing route duration. ORSA J Comput 4(2):146–154
Shaw P (1997) A new local search algorithm providing high quality solutions to vehicle routing problems. Dept of Computer Science, University of Strathclyde, Glasgow, Scotland, UK, APES Group
Vidal T, Crainic TG, Gendreau M, Prins C (2013) A hybrid genetic algorithm with adaptive diversity management for a large class of vehicle routing problems with time-windows. Comput Oper Res 40(1):475–489
Voudouris C, Tsang E (1999) Guided local search and its application to the traveling salesman problem. Eur J Oper Res 113(2):469–499
Acknowledgements
This research was partially supported by the TULOPT TEKES program and Procomp Solutions Ltd.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this paper
Cite this paper
Mester, D., Bräysy, O., Dullaert, W. (2018). Why to Climb If One Can Jump: A Hill Jumping Algorithm for the Vehicle Routing Problem with Time Windows. In: Diez, P., Neittaanmäki, P., Periaux, J., Tuovinen, T., Bräysy, O. (eds) Computational Methods and Models for Transport. ECCOMAS 2015. Computational Methods in Applied Sciences, vol 45. Springer, Cham. https://doi.org/10.1007/978-3-319-54490-8_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-54490-8_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-54489-2
Online ISBN: 978-3-319-54490-8
eBook Packages: EngineeringEngineering (R0)