The effects of initial population in genetic search for time constrained traveling salesman problems
Cheng-Hong Yang, Kendall E. Nygard · 1993
We describe the application of Genetic Algorithms to the traveling salesman problem with time windows. A new type of crossover operator, called edge-type crossover, with a heuristically selected initial population, is used in the genetic search. When compared with alternative methods from the literature, experiments indicate that the heuristic initialization speeds the genetic search process.