华南理工大学学报(自然科学版) ›› 2004, Vol. 32 ›› Issue (4): 97-100.

• • 上一篇    

运用遗传算法求解有约束条件的旅行商问题

朱玲湘 廖芹 邹亮   

  1. 华南理工大学 应用数学系‚广东 广州510640
  • 收稿日期:2003-06-25 出版日期:2004-04-20 发布日期:2015-09-08
  • 通信作者: 朱玲湘(1979-)‚女‚硕士研究生‚主要从事数理统计和优化算法研究. E-mail:hcitys@163.com
  • 作者简介:朱玲湘(1979-)‚女‚硕士研究生‚主要从事数理统计和优化算法研究.

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-)‚女‚硕士研究生‚主要从事数理统计和优化算法研究.

摘要: 介绍了TSPPC(Traveling Salesman Problem with Precedence Constraint)‚并指出了普通遗传算法对于求解TSPPC 的局限性及在算法过程中产生大量非可行解‚从而降低了算法的搜索效率.提出了基于TSPPC 中约束条件的种群初始化、交叉操作以及变异操作.由于运用这些遗传操作在算法过程中不会产生非可行解‚因此大大提高了算法的搜索效率.最后通过定理和算例验证了本文中提出的遗传算法.

关键词: 有约束条件的旅行商问题, 遗传算法, 种群初始化, 交叉, 变异

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

中图分类号: