Taguchi-based parameter setting of cuckoo search algorithm for capacitated vehicle routing problem

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.