期刊文献+

大规模旅行商问题的竞争决策算法 被引量:15

Competitive Decision Algorithm for Large-scale TSP
下载PDF
导出
摘要 针对旅行商问题,利用竞争决策算法的通用模型,给出了一种基于竞争决策思想,能求解大规模和超大规模TSP问题的快速求解方法,经过大量数据测试和验证,获得了较好的结果。 Based on the competitive decision algorithm (a brand-new optimization idea) and according to its general model, this paper proposes a quick competitive decision algorithm for solving large-scale and super large-scale travelling salesman problem. By using the new algorithm, it solves some STSP instances and compares these solutions with the best known solutions published, that results in good performances.
作者 宁爱兵 马良
出处 《计算机工程》 EI CAS CSCD 北大核心 2005年第9期23-26,共4页 Computer Engineering
基金 国家自然科学基金资助项目(70471065) 上海市教委重点学科建设资助项目
关键词 TSP 竞争决策算法 竞争力函数 决策函数 Traveling salesman problem(TSP) Competitive decision algorithm(CDA) Competitive force function Decision function
  • 相关文献

参考文献2

二级参考文献25

  • 1马良.中国144城市TSP的蚂蚁搜索算法[J].计算机应用研究,2000,17(1):36-37.
  • 2[1]Goldberg, D.E. et al. Alleles, loci and traveling salesman problem. In: Proc. of the Int. Conf. on Genetic Algorithms and Their Applications, Carnegie-Mellon University, 1985, 154~159.
  • 3[2]Grefenstette, J.J. et al. Genetic algorithms for the traveling salesman problems. In: Proc. of the Int. Conf. on Genetic Algorithms and Their Applications, Carnegie-Mellon University, 1985, 160~168.
  • 4[3]Fogel, D.B. An evolutionary approach to the traveling salesman problem. Biological Cybernetics, 1988, 60 (2): 139.
  • 5[4]Degroot, C. et al. Optimizing complex problems by nature algorithms-simulated annealing and evolution strategy-a comparative study. Lecture Notes in Computer Science, 1991, 496: 445.
  • 6[5]Ambati, B.K. et al. An O(nlog(n))-time genetic algorithm for the traveling salesman problem. In: Proc. of the 1st Ann. Conf. on Evolutionary Programming, La Jolla, CA, 1992, 134~140.
  • 7[6]Fogel, D.B. Applying evolutionary programming to selected traveling salesman problems. Cybernetics and Systems, 1993, 24 (1): 27.
  • 8[7]Fogel, D.B. Empirical estimation of the computation required to discover approximate solutions to the traveling salesman problem using evolutionary programming. In: Proc. of the 2nd Ann. Conf. on Evolutionary Programming, La Jolla, CA, 1993, 56~61.
  • 9[8]Pal, K.F. Genetic algorithms for the traveling salesman problem based on a heuristic crossover operation. Biological Cybernetics, 1993, 69 (5~6): 539.
  • 10[9]Poon, P.W. et al.Genetic algorithm crossover operators for ordering applications. Computers and Operations Research, 1995, 22 (1): 135.

共引文献28

同被引文献139

引证文献15

二级引证文献82

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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