Chaos driven evolutionary algorithm for the Traveling Salesman Problem. In: Traveling Salesman Problem

Abstract

Travelling Salesman Problem (TSP) is one of the most researched combinatorial problems in mathematics. This chapter incorporates chaotic maps in evolutionary algorithms as random number generators and applies it to the TSP. Chaotic maps are such that inhibit a unique footprint in operational space for each iteration, which in turn provides an excellent stochastic generator, since the chaos maps are described explicitly by mathematical formulation. A number of benchmark problems in Travelling Salesman problem are attempted.