论文信息 - Research on chaos partheno-genetic algorithm for TSP

Research on chaos partheno-genetic algorithm for TSP

Traveling Salesman Problem (TSP) is a typical combination optimization problem; it is hard to find a precision result. So it is very important to search for the near result.

[1] Tassos Bountis,et al. Fundamental concepts of classical chaos I , 1995 .

[2] Xing Guihua. Resolution Of Chinese Traveling Salesman Problem In MATLAB , 2004 .

[3] Luca Maria Gambardella,et al. Ant colony system: a cooperative learning approach to the traveling salesman problem , 1997, IEEE Trans. Evol. Comput..

[4] Li Mao. Selection Strategies of Partheno-Genetic Algorithm , 2002 .

[5] Yao Jun. THE APPLICATION RESEARCH OF THE CHAOS GENETIC ALGORITHM(CGA) AND ITS EVALUATION OF OPTIMIZATION EFFICIENCY , 2002 .