期刊文献+

路径交叉检测与消除方法和邻节点置换方法改进TSP的解 被引量:4

Improve solution of TSP based on route-intersection inspection and elimination method and neighbor nodes interchanging method
下载PDF
导出
摘要 针对当前算法在求解规模较大的TSP时得到的近似解中常常存在路径交叉这一不足,提出了一种路径交叉检测与消除方法,可以完全消除路径交叉从而提高近似解的质量;通过分析近似解的结构,发现一些相邻节点相互交换位置也可以有效提高解的质量,因此提出了一种邻节点置换方法。实验表明提出的方法可以有效改进模拟退火算法求得的TSP近似解。 There often was route-intersection in approximate solutions obtained by current algorithms when solving TSP,this paper proposed a new route-intersection inspection and elimination method,which could eliminate route-intersection completely and improve the quality of the solution of TSP markedly.Through analyzing the structure of the approximate solution,found that interchanging some neighbor nodes could also improve the solution effectively.Therefore,proposed a neighbor nodes interchanging method.Simulation results show that the methods proposed can make the solution first resolved by simulated annealing algorithm much better.
出处 《计算机应用研究》 CSCD 北大核心 2011年第2期485-487,共3页 Application Research of Computers
关键词 旅行商问题 路径交叉检测与消除 邻节点置换 traveling salesman problem(TSP) route-intersection inspection and elimination neighbor nodes interchanging
  • 相关文献

参考文献13

  • 1GAREY M R, JOHNSON D S. Computers and intractability: a guide to the theory of NP-completeness[M].San Francisco: [s.n.] ,1979.
  • 2CROES G A. A method for solving traveling salesman problems[J].Operations Research,1958,6(6):791-812.
  • 3BENTLEY J L. Fast algorithm for geometric traveling salesman problems[J].ORSA Journal on Computing,1992,4(4):387-411.
  • 4LIN S, KERNIGHAN B W. An effective heuristic algorithm for the traveling salesman problem[J].Operations Research,1973,21(2):498-516.
  • 5HELSGAUN K. An effective implementation of the lin-kernighan tra-veling salesman heuristic[J].European Journal Operational Research,2000,126(1):106-130.
  • 6MARTIN O C, OTTO S W. Combining simulated annealing with local search heuristics[M].[S.l.] : Kluwer Academic Publishers, 1995.
  • 7HOLLAND J H. Adaptation in natural and artificial systems: an introductory analysis with applications to biology, control, and artificial intelligence[M].Cambridge, MA: MIT Press, 1992.
  • 8韩丽霞,王宇平.解旅行商问题的一个新的遗传算法[J].系统工程理论与实践,2007,27(12):145-150. 被引量:12
  • 9DORIGO M, BIRATTARI M, STUTZLE T. The ant colony optimization[J].IEEE Computational Intelligence Magazine,2006,1(4):28-39.
  • 10刘波,蒙培生.采用基于模拟退火的蚁群算法求解旅行商问题[J].华中科技大学学报(自然科学版),2009,37(11):26-30. 被引量:19

二级参考文献34

  • 1吕聪颖,于哲舟,周春光,王康平,庞巍.动态自适应蚁群算法在二次分配问题中的应用[J].吉林大学学报(理学版),2005,43(4):477-480. 被引量:19
  • 2刘玉霞,王萍,修春波.基于模拟退火策略的逆向蚁群算法[J].微计算机信息,2006,22(12S):265-267. 被引量:10
  • 3[1]Garey MR, Johnson DS. Computers and Intractability: a Guide to the Theory of NP-Completeness. San Francisco: W.H. Freeman, 1979.
  • 4[2]Johnson DS, McGeoch LA. The traveling salesman problem: a case study in local optimization. In: Aarts EH, Lenstra JK, eds. Local Search in Combinatorial Optimization. New York: John Wiley and Sons, 1996.
  • 5[3]Jünger M, Reinelt G, Rinaldi G. The traveling salesman problem. In: Ball M, Magnanti T, Monma CL, Nemhauser G, eds. Handbook on Operations Research and Management Science: Networks North-Holland. 1995. 225~330.
  • 6[4]Burkard RE, Deineko VG, Dal RV, et al. Well-Solvable special cases of the traveling salesman problem: a survey. SIAM Review, 1998,40(3):496~546.
  • 7[5]Clarke G, Wright JW. Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 1964,12: 568~581.
  • 8[6]Christofides N. Worst-Case analysis of a new heuristic for the traveling salesman problem. Technical Report, No.388, Pittsburgh, PA: Graduate School of Industrial Administration, Carnegie Mellon University, 1976.
  • 9[7]Kirkpatrick S, Gelatt CD, Vecchi MP. Optimization by simulated annealing. Science, 1983,220(4598):671~680.
  • 10[8]Holland JH. Adaptation in Natural and Artificial Systems: an Introductory Analysis with Applications to Biology, Control, and Artificial Intelligence. 2nd ed., Cambridge, MA: MIT Press, 1992.

共引文献88

同被引文献35

  • 1TSAI C F, TSAI C W, YANG T. A modified multiple-searching method to genetic algorithms for solving traveling salesman problem [ C]//IEEE International Conference on Systems, Man and Cyber- netics. Piseataway: IEEE, 2002:6 - 12.
  • 2KIRKPATRICK S, GELATF C D, VECCHI M P. Optimization by simulated annealing[ J]. Science, 1983, 220(4598) : 671 - 680.
  • 3TSAI C F, TSAI C W, TSENG C C. A new hybrid heuristic ap- proach for solving large traveling salesman problem[ J]. Information Sciences, 2004, 166(1) : 67 -81.
  • 4HE Y, QIU Y H, KIU G Y. A Parallel tabu search approach based on genetic crossover operation[ C]// Proceedings of the 19th IEEE International Conference Cordon Advanced Information Networking and Applications. Washington, DC: IEEE Computer Society, 2005: 1550 - 1553.
  • 5ROSENKRANTZ D J, STEARNS R E, LEWIS P M. An analysis of several heuristics for the traveling salesman problem[ J]. SIAM Jour- nal of Computer, 1977, 6(1) : 563 - 581.
  • 6CROES G A. A method for solving traveling salesman problems[ J]. Operations Research, 1958, 6(6) : 791 - 812.
  • 7BENTLEY J L. Fast algorithm for geometric traveling salesman prob- lems[J]. ORSA Journal on Computing, 1992, 4(4) : 387 -411.
  • 8LIN S, KERNIGHAN B W. An effective heuristic algorithm for the traveling salesman problem[ J]. Operations Research, 1973, 21 (2) : 498 - 516.
  • 9PENEV K, LITTLEFAIR G. Free search - a comparative analysis [J]. Information Sciences, 2005, 172(1/2): 173-193.
  • 10靳静,艾芊,奚玲玲,张欣.海上风电场内部电气接线系统的研究[J].华东电力,2007,35(10):20-23. 被引量:28

引证文献4

二级引证文献25

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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