期刊文献+

智能优化算法求解TSP问题 被引量:119

Reviews of the Meta-heuristic Algorithms for TSP
下载PDF
导出
摘要 TSP(旅行商)问题代表组合优化问题,具有很强的工程背景和实际应用价值,但至今尚未找到非常有效的求解方法.为此,讨论了最近研究比较热门的使用各种智能优化算法(蚁群算法、遗传算法、模拟退火算法、禁忌搜索算法、Hopfield神经网络、粒子群优化算法、免疫算法等)求解TSP问题的研究进展,指出了各种方法的优缺点和改进策略.最后总结并提出了智能优化算法求解TSP问题的未来研究方向和建议. Traveling salesman problem(TSP) is the representation of a kind of combination optimization problems, possessing a strong engineering background and practical application value. However, there is no effective corresponding solution to it. Aim at that, the research and application of the most popular recta-heuristic methods such as ant colony algorithm, genetic algorithm, simulated annealing, tabu search, hopfield neural network, particle swarm optimization and immune algorithm, etc. are reviewed. The advantages and disadvantages of each method and the improvement strategies are discussed. The future research direction and suggestion are also given.
出处 《控制与决策》 EI CSCD 北大核心 2006年第3期241-247,252,共8页 Control and Decision
基金 国家863高技术研究发展计划基金项目(2003AA1Z2610)
关键词 旅行商问题 蚁群算法 遗传算法 模拟退火算法 禁忌搜索算法 粒子群优化算法 TSP Ant colony algorithm Genetic algorithm Simulated annealing Tabu search Particle swarm optimization
  • 相关文献

参考文献51

  • 1Garey M R,Johnson D S.Computers and Intractability:A Guide to the Theory of NP-Completeness[M].San Francisco:Freeman W H,1979.
  • 2Lawer E,Lenstra J,Ronnooy K A,et al.The Traveling Salesman Problem[M].New York:Wiley-International Publication,1985.
  • 3Baraglia R,Hidalgo J I,Perego R.A Hybrid Heuristic for the Traveling Saleman Problem[J].IEEE Trans on Evolutionary Computation,2001,5(6):613-622.
  • 4Lin S,Kernighan B W.An Effective Heuristic Algorithm for the Traveling Salesman Problem[J].Operational Research,1973,21(2):486-515.
  • 5Colorni A,Dorigo M,Maniezzo V.Distributed Optimization by Ant Colonies[A].Proc 1st European Conf Artificial Life Plans[C].France:Elsevier,1991:134-142.
  • 6Holland J H.Genetic Algorithms and the Optimal Allocation of Trials[J].SIAM J Comput,1973:2(2):89-104.
  • 7Kirkpatrick S,Gelatt J C D,Vecchi M P.Optimization by Simulated Annealing[J].Science,1983,220(4596):671-680.
  • 8Glover F.Future Paths for Integer Programming and Links to Artifical Intelligence[J].Computers and Operations Research,1986,13(5):533-549.
  • 9Hopfield J J.Neural Networks and Physical Systems with Emergent Collective Computational Abilities[J].Proc of the National Academy of Science,1982,79(4):2554-2558.
  • 10Eberhart R,Kennedy J.A New Optimizer Using Particles Swarm Theory[A].Proc 6th Int Symposium on Micro Machine and Human Science[C].Nagoya:IEEE Service Center,Piscataway,1995:39-43.

二级参考文献47

  • 1张纪会 徐心和.带遗忘因子的蚁群算法[J].系统仿真学报,2000,(2).
  • 2康立山 谢云 等.非数值并行算法(第1册)[M].北京:科学出版社,1997..
  • 3[6]Lawler E L, Lenstra J K, Rinnooy A H G, et al. The Travelling Salesman Problem [M]. Chichester: Wiley, 1985.
  • 4[7]Hopfield J J. Neurons with graded response have collective computational properties like those of two-state neurons [J]. Proc of Natl Acad of Sci USA, 1984, 81: 3088-3092.
  • 5[1]Hopfield J J, Tank D W. 'Neural' computation of decision in optimization problems [J]. Biol Cybern, 1985, 52: 141-152.
  • 6[2]Ackley D H, Hinton G E, Sejnowski T J. A learning algorithm for Boltzman Machines [J]. Cognitive Sci, 1985, 9: 147-169.
  • 7[3]Murata J, Fuchikami T, Hirasawa K. Heuristic optimization using long, medium, and short term memories [J]. Trans IEE of Japan, 1998, 118-C (9): 1315-1321.
  • 8[4]Tang Z, Jin H H, Ishizuka O, et al. An investigation on a unique solution of the Hopfield and the T-model neural networks [J]. Trans IEE of Japan, 1998, 118-C (2): 150-160.
  • 9[5]Tang Z, Jin H H, Murao K, et al. A gradient ascent learning for Hopfield networks [J]. Trans IEICE of Japan, 2000, J83-A (3): 319-331.
  • 10[1]Baraglia R J I, Hidalgo R Perego. A hybrid heuristic for the traveling salesman problem. IEEE Transactions on Evolutionary Computation,2001,5 (6) : 613~622

共引文献1134

同被引文献899

引证文献119

二级引证文献854

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部