摘要
针对一类具有约束条件的汽车调度问题 ,提出了约束性的多重 TSP(CMTSP)问题及其模型 ,给出了一种遗传算法解法。对比实验结果表明 :遗传算法具有比启发式算法更好的结果。
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.
出处
《重庆邮电学院学报（自然科学版）》
2000年第2期67-69,74,共4页
Journal of Chongqing University of Posts and Telecommunications(Natural Sciences Edition)
