期刊文献+

基于蚁群算法的贵州大学车辆配送网络规划

Vehicles Distribution Network Planning of Guizhou University Based on Ant Colony Algorithm
下载PDF
导出
摘要 分析贵州大学车辆配送的问题,给出该问题的数学模型,应用蚁群算法的原理来实现该规划方案,结果表明蚁群算法给出了一个可行、可靠的规划线路。 Based on analyzing the problem of vehicles distributing, a mathematic model was put forward and the ant colony algorithm was adopted to tackle the problem. The result shows the algorithm is feasible.
作者 程远航
出处 《贵州工业大学学报(自然科学版)》 CAS 2007年第1期53-55,59,共4页 Journal of Guizhou University of Technology(Natural Science Edition)
关键词 蚁群算法 数学模型 配送网络 ant colony algorithm mathematic model distribution network
  • 相关文献

参考文献3

二级参考文献15

  • 1康庆平,周雷.一个实用的配电网优化规划方法[J].电网技术,1994,18(6):39-43. 被引量:40
  • 2COLORNI A,DORIGO M,MANIEZZO V. Distibuted optimization by ant colonies[A]. Proceedings of ECAL91-European Conference on Artificial Life[C]. Paris ,France: Elsevier Publishing, 1991.134-142.
  • 3COLORNI A,DORIGO M,MANIEZZO V. An investigation of some properties of an "ant algorithm"[A]. Proceedings of the Parallel Problem Solving from Nature Conference (PPSN 92) [C]. Brussels, Belgium: Elsevier Publishing, 1992. 509- 520.
  • 4COLORNI A, DORIGO M, MANIEZZO V,et al. Ant system for job-shop scheduling [J]. Belgian Journal of Operations Research Statistics and Computer Science,1994,34(1 ): 39 - 53.
  • 5KEUN Y I, CHOU C S, SONG Y H. Application of the ant colony search algorithm to short-term generation scheduling problem of thermal units [A]. Proceedings POWERCON '98 [ C ]. [ s.l. ]: 1998 International Conference on Power System Technology, 1998. 552-556.
  • 6NARA K, SATUH T,AOKI K,et al. Multi-year expansion planning for distribution systems [J]. IEEE Trans. on Power Systems,1991,6(2): 952 - 958.
  • 7张纪会,徐心和.一种新的进化算法——蚁群算法[J].系统工程理论与实践,1999,19(3):84-87. 被引量:125
  • 8王天华,王平洋,范明天.用演化算法求解多阶段配电网规划问题[J].中国电机工程学报,2000,20(3):34-38. 被引量:53
  • 9陈根军,王磊,唐国庆.基于蚁群最优的配电网络重构算法[J].电力系统及其自动化学报,2001,13(2):48-53. 被引量:43
  • 10陈根军,王磊,唐国庆.基于蚁群最优的输电网络扩展规划[J].电网技术,2001,25(6):21-24. 被引量:112

共引文献46

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

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