Optimization Problems And Genetic Algorithms

Abstract

This paper presents an application of genetic algorithms (GAs) to a well-known traveling salesman problem (TSP) which is a challenging optimization task. Using the techniques of selection, crossover, and mutation borrowed from the Darwin’s evolution theory, GAs were able to find the optimal solution after generating only 24 populations of solutions instead of exploring more than a million possible solutions.