In this chapter, we are going to explore the traveling salesman problem and how it can be solved using a genetic algorithm. In doing so, we will be looking at the properties of the traveling salesman problem and how we can use those properties to design the genetic algorithm.
KeywordsTravel Salesman Problem Travel Salesman Problem Population Population Crossover Method Public Class
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
© Lee Jacobson and Burak Kanber 2015