Abstract
The cuckoo search algorithm is a novel metaheuristic based on the obligate brood parasitic behavior of some cuckoo species in combination with the Lévy flight behavior of some birds and fruit flies. Its shows good performance when applied to various domains in continuous and discrete search space. This study presents a cuckoo search algorithm for capacitated vehicle routing problem; its parameter optimized using Taguchi method. The comparison results on 16 benchmark instances shows potential performance of the Taguchi based method which outperforms the basic one.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Gendreau M et al (2008) Metaheuristics for the vehicle routing problem and its extensions: a categorized bibliography, in the vehicle routing problem. In: Golden B, Raghavan S, Wasil E (eds) Latest advances and new challenges, Springer, US. p 143–169
Ouaarab A, Ahiod B, Yang X-S (2013) Discrete cuckoo search algorithm for the travelling salesman problem. Neural Comput Appl 1–11
Yang X-S, Deb S (2009) Cuckoo search via Levy flights. In: Nature and biologically inspired computing, NaBIC 2009, World Congress on 2009
Cui L et al (2013) A new improved quantum evolution algorithm with local search procedure for capacitated vehicle routing problem. Math Probl Eng 2013:17
Dehnad K (2012) Quality control, robust design, and the Taguchi method, Springer Science & Business Media
Peker M, Sen B, Kumru PY, An efficient solving of the traveling salesman problem: the ant colony system having parameters optimized by the Taguchi method. Turk J Electr Eng Comput Sci 21(1):2015–2036
Sibalija TV, Majstorovic VD (2012) An integrated approach to optimise parameter design of multi-response processes based on Taguchi method and artificial intelligence. J Intell Manuf 23(5):1511–1528
Tsai P-W et al (2012) Enhanced parallel cat swarm optimization based on the Taguchi method. Expert Syst Appl 39(7):6309–6319
Hamta N et al (2013) A hybrid PSO algorithm for a multi-objective assembly line balancing problem with flexible operation times, sequence-dependent setup times and learning effect. Int J Prod Econ 141(1):99–111
Chen A-L, Yang G-K, Wu Z-M (2006) Hybrid discrete particle swarm optimization algorithm for capacitated vehicle routing problem. J Zhejiang Univ Sci A 7(4):607–614
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Alssager, M., Othman, Z.A. (2016). Taguchi-based Parameter Setting of Cuckoo Search Algorithm for Capacitated Vehicle Routing Problem. In: Soh, P., Woo, W., Sulaiman, H., Othman, M., Saat, M. (eds) Advances in Machine Learning and Signal Processing. Lecture Notes in Electrical Engineering, vol 387. Springer, Cham. https://doi.org/10.1007/978-3-319-32213-1_7
Download citation
DOI: https://doi.org/10.1007/978-3-319-32213-1_7
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-32212-4
Online ISBN: 978-3-319-32213-1
eBook Packages: EngineeringEngineering (R0)