Abstract
This paper studies the fitness landscape characteristics for capacitated vehicle routing problem (CVRP). Fitness distance correlation analysis and autocorrelation analysis are used to investigate the global and local features of a fitness landscape, respectively. As for global features, we investigate to which degree the fitness of a solution to CVRP is related to the distance which is between the solution and the global optimum. As for local features, the ruggedness of the investigated landscape is concerned and to measure it random walks are conducted based on three popularly used mutation operators. A number of benchmark instances are investigated and the results show that: (1) there is no significant correlation between fitness and distance in most of the instances, and (2) different mutation operators may result in different ruggedness of a search space.
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
References
Laporte G, Semet F (2001) Classical heuristics for the capacitated VRP. In: Proceedings of the SIAM monographs on discrete mathematics and applications, vol 1, pp 3–9
Perboli G, Pezzella F, Tadei R (2008) Eve-opt: a hybrid algorithm for the capacitated vehicle routing problem. Math Methods Operat Res 68(2):361–382
Wang CH, Lu JZ (2010) An effective evolutionary algorithm for the practical capacitated vehicle routing problems. J Intell Manuf 21(4):363–375
Shen H, Zhu Y, Jin L, Zou W (2010) Two-phase heuristic for capacitated vehicle routing problem. In: Proceedings of the NaBIC2010
Wang CH, Lu JZ (2009) A hybrid genetic algorithm that optimizes capacitated vehicle routing problems. Expert Syst Appl 36(2):2921–2936
Jones T, Forrest S (1995) Fitness distance correlation as a measure of problem difficulty for genetic algorithms. In: Proceedings of the 6th international conference on genetic algorithms, vol 6, p 282
Ochoa G, Qu R, Burke EK (2009) Analyzing the landscape of a graph based hyper-heuristic for timetabling problems. In: Proceedings of the GECCO2009, vol 29, pp 190–193
Kubiak M (2005) Distance metrics and fitness-distance analysis for the capacitated vehicle routing problem. In: Proceedings of the MIC2005, vol 21, pp 39–45
Weinberger ED (1990) Correlated and uncorrelated fitness landscapes and how to tell the difference. Biol Cybern 63:325–336
Hordijk W (1997) A measure of landscapes. Evol Comput 4(4):335–360
Acknowledgements
This work was supported in part by NSFC (No. 40901070), and HASTIT, P.R. China. The author would like to thank Dr. H Xing for his insightful discussion and comments.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer Science+Business Media New York
About this paper
Cite this paper
Tian, L. (2014). Fitness Landscape Analysis for Capacitated Vehicle Routing Problem. In: Zhong, S. (eds) Proceedings of the 2012 International Conference on Cybernetics and Informatics. Lecture Notes in Electrical Engineering, vol 163. Springer, New York, NY. https://doi.org/10.1007/978-1-4614-3872-4_16
Download citation
DOI: https://doi.org/10.1007/978-1-4614-3872-4_16
Published:
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4614-3871-7
Online ISBN: 978-1-4614-3872-4
eBook Packages: EngineeringEngineering (R0)