摘要
首先把圆排列问题转化为旅行商问题,然后利用模拟退火算法是求解此问题.针对模拟退火算法对选择试验解比较敏感这一问题,文章提出六种找领域解算法.算法的分析和测试表明,利用了城市间距离大小的信息的蚁群模拟退火算法 是一种简单有效的算法.
Circle permutation problem is translated into traveling salesman problem (TSP) firstly, then the simulated annealing algorithm (SA) is used to solve the TSP. The quality of the annealing solution is very sensitive to the way in which the trial solutions are selected. In order to search neighborhood of the trial solution, six algorithms are put forward. By analysis and test, it is proved that Ant Colony-Simulated Annealing AlgorithmⅡ, which makes use of the information of distance between cities, is a simple and effective algorith.
出处
《系统工程理论与实践》
EI
CSCD
北大核心
2004年第8期102-106,共5页
Systems Engineering-Theory & Practice
基金
江苏科技大学青年基金(Q2002313)
关键词
圆排列问题
旅行商问题
模拟退火算法
蚁群算法
circle permutation problem
traveling salesman problem
simulated annealing algorithm
ant colony algorithm
