计算机工程与应用 ›› 2011, Vol. 47 ›› Issue (7): 52-56.

• 研究、探讨 • 上一篇    下一篇

求解多目标旅行商问题的混合遗传算法

朱云飞1,2,蔡自兴1,袁琦钊2,郑金华2   

  1. 1.中南大学 信息科学与工程学院,长沙 410083
    2.湘潭大学 信息工程学院,湖南 湘潭 411105
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2011-03-01 发布日期:2011-03-01

Hybrid genetic algorithm for multiple-objective TSP

ZHU Yufei1,2,CAI Zixing1,YUAN Qizhao2,ZHENG Jinhua2   

  1. 1.College of Information Science and Engineering,Central South University,Changsha 410083,China
    2.Institute of Information Engineering,Xiangtan University,Xiangtan,Hunan 411105,China
  • Received:1900-01-01 Revised:1900-01-01 Online:2011-03-01 Published:2011-03-01

摘要: 一般TSP问题是单目标的,只追求一个性能指标:所走路径最短。然而对于具体的TSP问题,实际中常常需要考虑:路程最短、时间最少、费用最省、风险最小等等多方面的因素。设计了贪婪的复合变异算子(GCM),引入隔代爬山法算子来提高多目标TSP问题的搜索能力。实验结果表明该算法是有效的。

关键词: 旅行商问题, 多目标旅行商问题, 遗传算法, 多目标遗传算法, 贪婪的复合变异算子, 爬山法

Abstract: General TSP problem is a single target,only the pursuit of a performance index:The shortest path to go.However,the TSP for specific problems,in practice often needs to consider:The shortest distance,the time at least,cost the province,the risk of the smallest,and so a number of factors.In the text,a greedy composite operator and climb operator are introduced for increasing the MTSP searching ability.The experiment result demonstrates that the method is valid and effective.

Key words: Traveling Salesman Problem(TSP), multiple-objective travelling salesman problem, genetic algorithm, multiple-objective genetic algorithm, greedy composite operator, climb