期刊文献+

若干扩展TSP的元胞蚂蚁算法 被引量:5

Cellular Ant Algorithm for Some Extended TSP
下载PDF
导出
摘要 给出一种通用组合优化算法——元胞蚂蚁算法,并将其应用于一些扩展TSP问题(包括瓶颈TSP、最小比率TSP、时间约束TSP等)的求解。经过数据测试和验证,获得了较好的结果。 A general discrete systems optimization algorithm——cellular ant algorithm is presented, and then it is applied to solve some extended TSP (including bottleneck TSP, minimum-ratio TSP and timeconstrained TSP). Numerical examples are tested, that give promising results.
出处 《系统管理学报》 北大核心 2007年第5期492-496,共5页 Journal of Systems & Management
基金 国家自然科学基金资助项目(70471065) 上海市重点学科建设资助项目(T0502)
关键词 元胞自动机 蚂蚁算法 扩展TSP cellular automata ant algorithm extended TSP
  • 相关文献

参考文献10

二级参考文献53

  • 1应尚军,魏一鸣,蔡嗣经.元胞自动机及其在经济学中的应用[J].中国管理科学,2000,8(S1):272-278. 被引量:29
  • 2谢非.黑龙江省物流中心选址的研究[J].林业机械与木工设备,2004,32(11):33-35. 被引量:5
  • 3田志友,王浣尘,吴瑞明.区域市场连锁经营选址与布局的元胞自动机模拟[J].系统工程理论方法应用,2005,14(1):50-54. 被引量:23
  • 4顾国庆,范炳全,许伯铭.交通系统的元胞自动机模型[J].系统工程理论方法应用,1995,4(1):12-17. 被引量:23
  • 5[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. 被引量:1
  • 6[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. 被引量:1
  • 7[3]Fogel, D.B. An evolutionary approach to the traveling salesman problem. Biological Cybernetics, 1988, 60 (2): 139. 被引量:1
  • 8[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. 被引量:1
  • 9[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. 被引量:1
  • 10[6]Fogel, D.B. Applying evolutionary programming to selected traveling salesman problems. Cybernetics and Systems, 1993, 24 (1): 27. 被引量:1

共引文献128

同被引文献34

  • 1宁爱兵,马良.最小比率旅行商(MRTSP)问题竞争决策算法[J].计算机工程与应用,2005,41(11):30-32. 被引量:16
  • 2马良,朱刚,宁爱兵.蚁群优化算法[M].北京:科学出版社,2008,2. 被引量:100
  • 3Laport G.The travelling salesman problem:an overview of exact and approximate algorithms[J].European Journal of Operational Research,1992,59(2):231-247. 被引量:1
  • 4Dueck G.New optimization heuristics:the great deluge algorithm and the record-to-record travel[J].Journal of Computational Physics,1993,104(1):86-92. 被引量:1
  • 5马良,朱刚,宁爱兵.蚁群优化算法[M].北京:科学出版社,2008:34. 被引量:1
  • 6MA Liang, CUI Xue-li, YAO Jian. Finding the minimum ratio trave- ling salesman tour by artificial ants [ J]. Journal o1 Systems Engi- neering and Electronics, 2003, 14(3) :24-27. 被引量:1
  • 7YANG Xin-she. A new metaheuristie bat-inspired algorithm [ M ]// Nature Inspired Cooperative Strategies for Optimization. Berlin:Sprin- ger, 2010:65-74. 被引量:1
  • 8YANG Xin-she. Bat algorithm for multi-objective optimization [ J ]. International Jouran/of Bin-Inspired Computation, 2011,3 (5) : 267- 274. 被引量:1
  • 9YANC Xin-she, GANDOMI A H. Bat algorithm: a novel approach for global engineering optimization [ J ]. Engineering Computation, 2012, 29(5) :267-289. 被引量:1
  • 10GANDOMI A H, YANG Xin-she, ALAVA A H, et al. Bat algorithm for constrained optimization tasks [J]. Neural Computing & Appli- cations,2013,22(6) :1239-1255. 被引量:1

引证文献5

二级引证文献24

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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