期刊文献+
任意字段
题名或关键词
题名
关键词
文摘
作者
第一作者
机构
刊名
分类号
参考文献
作者简介
基金资助
栏目信息

一种改进的求解TSP的粒子群算法 被引量：2

Improved Particle Swarm Optimization Algorithm for Solving TSP
下载PDF
导出
摘要 针对粒子群算法解决离散问题时效率较低的问题,提出一种改进算法,通过置换序列实现粒子位置和速度的更新。用TSP问题库内的基准问题进行仿真实验,证明了该算法是有效的。 An Improved discrete particle swarm optimization algorithm（DPSO） is proposed to overcome the inefficient performance.In the algorithm,list of permutations is used to update the velocity and position.By numerous experiments on benchmark problems of TSPLIB,the results indicate that the new algorithm is efficacious.
作者 朱小平 赵曦
机构地区 广东科学技术职业学院计算机工程技术学院
出处 《科学技术与工程》 2010年第15期3727-3729,共3页 Science Technology and Engineering
基金 广东省自然科学基金(8151064007000004)资助
关键词 粒子群优化 旅行商问题 置换 PSO TSP permutation
分类号 TP18 [自动化与计算机技术—控制理论与控制工程]
  • 相关文献

参考文献5

二级参考文献25

  • 1邹鹏,周智,江贺,陈国良,顾钧.求解旅行商问题的循环局部搜索算法的运行时间和性能分布分析[J].计算机学报,2006,29(1):92-99. 被引量：24
  • 2VARELA G N, SINCLAIR M C. Ant colony optimization for virtual--wavelength --path routing and wavelength allocation[A]. Proceedings of the 1999 Congress on Evolutionary Computation [C]. Washington DC: IEEE, 1999. 1809--1816.
  • 3BAUER A, BULLNHEIMER B, HARTL R F, STRAUSSC. An ant colony optimization approach for the single machine total tardiness problem[A]. Proceedings of the 1999 Congresson Evolutionary Computation [C]. Washington DC: IEEE,1999. 1445-- 1450.
  • 4KRIEGER MICHAEL J B, et al. Ant--like task allocation and recruitment in cooperative robots[J]. Nature, 2000,406:39--42.
  • 5HOOGEVEEN J A, LENSTRA J K, VELTMAN B. Preemptive scheduling in a two--stage multiprocessor flow shop is NP--hard[J]. European Journal of Operational Research, 1996,89(1): 172--175.
  • 6DUDEK R A, et al. The lessons of flowshop scheduling research[J]. Operations Research, 1992, 40(1):7--13.
  • 7LINN R, ZHANG Wei, Hybrid flowshop seheduling:a survey[J]. Computers & Industrial Engineering, 1999,37(1-- 2) : 57--61.
  • 8CAMAZINE S, et al. Self--organization in biological systems[M]. Princeton USA: Princeton University Press, 2001.
  • 9BONABEAU E, DORIGO M, THERAULAZ G. Inspiration for optimization from social Insect behavior[J]. Nature, 2000,406:39--42.
  • 10DORIGO M, MANIEZZO V,COLORNI A. Ant system:optimization by a colony of cooperating agents[J]. IEEE Transactions On System Man and Cybernetics B:Cybernetics, 1996,26(1): 29--41.

共引文献61

同被引文献20

  • 1刘于江,喻泽峰.一种求解旅行商问题的禁忌搜索算法[J].江西理工大学学报,2006,27(4):38-40. 被引量：5
  • 2代西武.Dijkstra矩阵算法[J].北京建筑工程学院学报,2007,23(2):65-67. 被引量：6
  • 3Karaboga D. An idea based on honey bee swarm for numerical optimization [R]. Kayseri: Computer Engineering Department, Engineering Faculty, Erciyes University, 2005.
  • 4Karaboga D, Basturk B. On the performance of artificial bee eolony(ABC) algorithm[J]. Applied Soft Computing, 2008, 8( 1 ) .. 687-697.
  • 5Laleh Haerian Ardekani Tiru S. Arthanari Matthias Ehrgott. Performance of the Branch and BounclAlgorithm on the Multistage InsertionFormulation of the Traveling SalesmanProblem[C]. Proceedings of the 45th Annual Conference of the ORSNZ November 2010 pp. 326-335.
  • 6王晓陵,陆军.最优化方法和最优控制[M].哈尔滨:哈尔滨工程大学出版社,2006:256-300.
  • 7Qi Sun, Hui Liu, Qiang Yang, Wenjun Yan. On the Design for AGVs. Modeling[C], Path Planning and Localization Proceedings of the 2011 IEEE International Conference on Mechatronics and Automation. Beijing, China. 2011 pp. 1515-1520.
  • 8S. LaValle, S. Hutchinson. Optimal motion planning for multiple robots having independent goals[C] Proceedings of the 1996 IEEE/RSJ International Conference on Robotics and Automation. Osaka Japan. 1996:1619-1624.
  • 9S. Gao, B. Han and X salesman problem by optimization algorithm J. Wu. Solving hybrid part (In Chinese) [J] traveling cle swarm Control and Decision. 2004, 19(11) : 1286-1289.
  • 10王剑文,戴光明,谢柏桥,张全元.求解TSP问题算法综述[J].计算机工程与科学,2008,30(2):72-74. 被引量：64

引证文献2

二级引证文献3

科学技术与工程
2010年 第15期

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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