Journal of South China University of Technology(Natural Science Edition) ›› 2004, Vol. 32 ›› Issue (4): 97-100.

Previous Articles    

Resolution of the Traveling Salesman Problem with Precedence Constraint Applying Genetic Algorithm

Zhu Ling-xiang Liao Qin Zou Liang   

  1. Dept.of Applied Mathematics‚South China Univ.of Tech.‚Guangzhou510640‚Guangdong‚China
  • Received:2003-06-25 Online:2004-04-20 Published:2015-09-08
  • Contact: 朱玲湘(1979-)‚女‚硕士研究生‚主要从事数理统计和优化算法研究. E-mail:hcitys@163.com
  • About author:朱玲湘(1979-)‚女‚硕士研究生‚主要从事数理统计和优化算法研究.

Abstract: The Traveling Salesman Problem with Precedence Constraint (TSPPC) was introduced and the localization of the general genetic algorithm (GA) to solve TSPPC was pointed out.It is found that a lot of illegal chromosomes would be generated by using the general GA‚thus reducing the searching efficiency of the algorithm.To overcome the disadvantages mentioned above‚the species initialization‚crossover and mutation based on the precedence constraint of TSP were proposed.None of these genetic operations would generate any illegal chromosome‚which makes the searching efficiency of the algorithm higher.This conclusion was finally verified by corresponding theorems and examples.

Key words: traveling salesman problem with precedence constraint, genetic algorithm, species initialization, crossover, mutation

CLC Number: