The Traveling Salesman Problem: The Cuckoo Search Algorithm

758 Words4 Pages

Cuckoo search is a meta-heuristic algorithm inspired by the bird cuckoo, these are the ‘Brood parasites’ birds. It never builds its own nest and lays their eggs in the nest of another host bird nest. Cuckoo is a best known brood parasite. Some host birds can engage directly with the intruding cuckoo. If the host bird identifies the eggs that are not their own egg then it will either throw that eggs away from its nest or simply rid its nest and build a new nest. In a nest, each egg represents a solution and cuckoo egg represents a new and good solution. The obtained solution is a new solution based on the existing one and the modification of some characteristics. In the simplest form each nest has one egg of cuckoo in which each nest will …show more content…

The Traveling Salesman Problem (TSP) is defined by N cities and distance matrix D=d_(( i,j)N×N ) it gives distances between all cities. In TSP, the main object is to visit every city exactly once with in minimum distance [17]. The tour can be as a cyclic permutation is π=(π(1),π(2)…π(N)) of cities from 1 to N if π(i) is interpreted to the city visited in step i,i=1,…N. The cost of tour is defined as: f(π)=∑_i^(N-1)▒〖d_(π(i)π(i+1))+d_(π(N)π(1)) 〗…………..(1) If the distance satisfies d_(i,j)=d_(j,i) for 1≤i,j≤N, it is the symmetric TSP. The vertices of the graph are cities and the graph edges are connections between cities. An optimal TSP tour is a path through an undirected graph which visits each vertex exactly once. The main aim of adapting CS to TSP is the process of applying general principles of the results obtained in special cases. The main elements in this are egg, nest, levy flights, object function, search space. The worse nest or abandoned is the route with max length is worse route and that route is abandoned and builds a new route with min distance. This new route is replaced by the old route. In this, the fitness is the best

Open Document