| 有时间约束旅行商问题的启发式遗传算法 |
| |
| 引用本文： | 谢秉磊,李军,刘建新.有时间约束旅行商问题的启发式遗传算法[J].西南交通大学学报,2001,36(2):211-213. |
| |
| 作者姓名： | 谢秉磊 李军 刘建新 |
| |
| 作者单位： | 西南交通大学经济管理学院， 四川 成都 610031 |
| |
| 基金项目： | 谢秉磊（1975－），男，博士研究生． |
| |
| 摘 要： | 有时间约束的旅行商问题作为旅行商问题的拓展，是一个重要的NP难题，深入研究这一问题具有重要的理论和实践意义。将时间窗约束转化为目标约束，采用序列编码设计了基于启发式规则的可同时处理软、硬时间约束的遗传算法——2-交换变异的遗传算法和3-交换变异的遗传算法。实验表明HGA1优于简单遗传算法(SGA)，HGA2优于HGA1。
|
| 关 键 词： | 游路问题 组合规化 遗传算法 时间约束 |
| 文章编号： | 0258-2724（2001）02-0211-03 |
| 修稿时间： | 1999年12月13 |
A Heuristic Genetic
Algorithm for the Travelling Salesman Problem with Time Restraints |
| |
| XIE Bing-lei,LI Jun,LIU Jian-xin.A Heuristic Genetic
Algorithm for the Travelling Salesman Problem with Time Restraints[J].Journal of Southwest Jiaotong University,2001,36(2):211-213. |
| |
| Authors: | XIE Bing-lei LI Jun LIU Jian-xin |
| |
| Abstract: | As an extension of the travelling salesman problem, the travelling salesman problem with time windows is a very difficult problem with great theoretical and practical significance. In this paper, the time restraints are converted into objective restraints, and genetic algorithms with mutations by 2-exchange and by 3-exchange, respectively, are designed by using sequence coding to deal with the soft and hard time restraints. The simulation indicates that the latter algorithm is superior to the former, and that both of the proposed algorithms are superior to the simple genetic algorithm. |
| |
| Keywords: | travelling salesman problem combinatorial optimization genetic algorithm time restraints |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
