| 圆排列问题的蚁群模拟退火算法 |
| |
| 引用本文： | 高尚,杨静宇,吴小俊,刘同明.圆排列问题的蚁群模拟退火算法[J].系统工程理论与实践,2004,24(8):102-106. |
| |
| 作者姓名： | 高尚 杨静宇 吴小俊 刘同明 |
| |
| 作者单位： | (1)南京理工大学计算机系;(2)江苏科技大学电子信息学院 |
| |
| 基金项目： | 江苏科技大学青年基金(Q2002313) |
| |
| 摘 要： | 首先把圆排列问题转化为旅行商问题,然后利用模拟退火算法是求解此问题.针对模拟退火算法对选择试验解比较敏感这一问题,文章提出六种找领域解算法.算法的分析和测试表明,利用了城市间距离大小的信息的蚁群模拟退火算法 是一种简单有效的算法.
|
| 关 键 词： | 圆排列问题 旅行商问题 模拟退火算法 蚁群算法 |
| 文章编号： | 1000-6788(2004)08-0102-05 |
| 修稿时间： | 2003年4月26日 |
Solving Circle Permutation Problem with Ant Colony-Simulated Annealing Algorithm |
| |
| GAO Shang.Solving Circle Permutation Problem with Ant Colony-Simulated Annealing Algorithm[J].Systems Engineering —Theory & Practice,2004,24(8):102-106. |
| |
| Authors: | GAO Shang |
| |
| Institution: | (1)Department of Computer,Nanjing University Science and Technology;(2)School of Electronics and Information, Jiangsu University of Science and Technology |
| |
| Abstract: | 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... |
| |
| Keywords: | circle permutation problem traveling salesman problem simulated annealing algorithm ant colony algorithm |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
| 点击此处可从《系统工程理论与实践》浏览原始摘要信息 |
| 点击此处可从《系统工程理论与实践》下载免费的PDF全文 |
