摘要
分析动态TSP问题的特点,将n-OPT算法和遗传算法结合起来,设计并实现了一种解决动态TSP问题的算法。通过实验,用该算法对TSPL ib中经典的TSP问题及其派生的动态TSP问题进行了求解,证明了该算法无论在静态环境还是动态环境中都可行、高效。
This paper analyzes the characteristics of dynamic traveling salesman problem （TSP）. A hybrid algorithm of n-OPT and GA is designed and implemented to solve dynamic TSP. Some classical TSP problems in TSPLib and dynamic TSP problems derived from them are solved by the algorithm in the experiments. It is proved that the algorithm is feasible and efficient under both static and dynamic conditions.
出处
《武汉科技大学学报》
CAS
2006年第2期155-156,160,共3页
Journal of Wuhan University of Science and Technology
基金
武汉科技大学科学研究发展基金资助项目(2004XZ4)
