期刊文献+

一种物流优化的蚁群算法设计

下载PDF
导出
摘要 物流配送中求最优解是一类典型的NP难问题,具有很高的时空复杂性。目前,还没有较完善的算法能在一定的时间限制内快速地寻到问题的最优解,只能尽可能地在规定的时间内寻到问题的近似最优解。由于蚁群算法具有鲁棒性和正反馈等特点,因此它被成功运用到物流配送问题的求解中。根据蚁群算法存在的一些缺陷,如搜索时间长、过早收敛等,采用OOP进行优化。通过实验,验证了改进算法的性能。
作者 王力
出处 《软件导刊》 2012年第6期41-42,共2页 Software Guide
  • 相关文献

参考文献4

二级参考文献43

  • 1McMullen P R. An ant colony optimization approach to addressing a JIT sequencing problem with multiple objectives [ J]. Artificial Intelligence in Engineering, 2001,15(3) :309 -317.
  • 2Coksmi A, Dorigo M, Maniezzo V, et al. Ant system for jobshop scheduling [J]. Belgian Journal Operations Research Statistic Computation Science, 1994,34 (11) :39 - 53.
  • 3Maniezzo V, Carbonaro A. An ant heuristic for the frequency assignment problem [ J ]. Future Generation Computer System,2000,16(8) :927 -935.
  • 4Gambardella L M, Dorigo M. Solving symmetric and asymmetric TSPs by ant colonies [ A]. Proceedings of the IEEE Conference on Evolutionary Computation [ C]. 1996. 622 -627.
  • 5Monarche N, Venturini G, Slimane M. On how pachycondylla apicalis ants suggests a new algorithm [ J ]. Future Generation Computer System, 2000,16 (8) :937 - 946.
  • 6Stutzle T, Hoos H H. MAX-MIN ant system [ J]. Future Generation Computer Systems, 2000,16 (8) :889 - 914.
  • 7Gambardella L M, Dorigo M. Ant-Q: a reinforcement learning approach to the traveling salesman problem [ A ]. Proceedings of the 12th International Conference on Machine Learning [ C ].Tahoe City, CA: Morgan Kaufman, 1995. 252 ~ 260.
  • 8Gutjahr W J. A graph-based ant system and its convergence [ J ].Future Generation Computer Systems, 2000, 16(8) :873 -888.
  • 9Lee Z J, Lee C Y, Su S F. An immunity-based ant colony optimization algorithm for solving weapon-target assignment problem [J]. Applied Soft Computing, 2002, 2(10) :39 -47.
  • 10Colomi A, Dorigo M, Maniezzo V. Distributed optimization by ant colonies [ A]. Prooeedings of ECAL 91 - European Conference on Artificial Life [C]. Paris, France:1991. 134 - 142.

共引文献235

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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