| 基于遗传算法的约束性多TSP问题及其应用 |
| |
| 引用本文： | 陈龙. 基于遗传算法的约束性多TSP问题及其应用[J]. 重庆邮电学院学报(自然科学版), 2000, 0(2) |
| |
| 作者姓名： | 陈龙 |
| |
| 作者单位： | 重庆邮电学院计算机科学与技术研究所!重庆400065 |
| |
| 摘 要： | 针对一类具有约束条件的汽车调度问题 ,提出了约束性的多重 TSP(CMTSP)问题及其模型 ,给出了一种遗传算法解法。对比实验结果表明 :遗传算法具有比启发式算法更好的结果。
|
| 关 键 词： | 遗传算法 组合优化 旅行推销员(TSP)问题 |
Constrained Multiple Traveling Salesman Problem Based on Genetic Algorithm and Its Application |
| |
| CHEN Long. Constrained Multiple Traveling Salesman Problem Based on Genetic Algorithm and Its Application[J]. Journal of Chongqing University of Posts and Telecommunications(Natural Sciences Edition), 2000, 0(2) |
| |
| Authors: | CHEN Long |
| |
| Abstract: | Constrained vehicle scheduling problems are discussed in this paper. The model and the genetic algorithm solution of CMTSP (Constrained Multiple Traveling Salesmen Problem) are presented. It is shown by simulation that the performance of the genetic algorithm is very good. |
| |
| Keywords: | genetic algorithm combinatorial optimization travelling salesman probl |
| 本文献已被 CNKI 等数据库收录！ |
