A Novel Greedy Genetic Algorithm for Traveling Salesman Problem
HU Yu-lan · Jisuanji gongcheng · 2004
Following the principle of greedy selection, the greedy genetic algorithm is proposed in this paper. A gene bank is constituted. The initial population is formed based on the gene bank. Greedy crossover is adopted to produce a new child for its sufficiently utilizing the local information of individuals. The two exchange local search of greedy mutation is also employed to improve the individual performance. In the process of evolution, new individuals immigrate to the population every a few generations. This procedure prevents premature convergence of the population and leads to an open competition. The simulation results of TSP show its excellent efficiency.