Discrete Cuckoo Search Optimization Algorithm for Combinatorial Optimization of Vehicle Route in Graph Based Road Network

Abstract

Cuckoo Search (CS) Algorithm is a well-known and successful nature inspired meta-heuristics which mimicries the salient life-style feature of cuckoo bird and has been widely applied in various continuous domain problems, search analysis and optimization. The algorithm mostly depends on the random placement of the constrained value(s) of variable at the solution set and is being evaluated by the fitness function. There is also provision for slow increment of the solution variable for local search. But here in this paper we have concentrated on the development and application of a modified version of the algorithm called Discrete Cuckoo Search Optimization Algorithm (DCSO) for discrete problem domain like that of the graph based problem and other combinatorial optimization problems like traveling salesman problem etc. The algorithm is first tested on the Travelling Salesman Problem benchmark datasets and then it is applied on a road based graph network for optimization with respect to a non-weighted fitness function of travel time and waiting time and is compared with Ant Colony Optimization (ACO) and Intelligent Water Drop (IWD).