| 基于最大最小蚂蚁系统的一种应急物流路径规划方法 |
| |
| 引用本文： | 金保华,张亮,和振远. 基于最大最小蚂蚁系统的一种应急物流路径规划方法[J]. 中原工学院学报, 2011, 22(2). DOI: 10.3969/j.issn.1671-6906.2011.02.004 |
| |
| 作者姓名： | 金保华 张亮 和振远 |
| |
| 作者单位： | 郑州轻工业学院,郑州,450002 |
| |
| 基金项目： | 河南省重点科技攻关项目 |
| |
| 摘 要： | 根据应急物流中存在的一些问题,利用最大最小蚂蚁系统收敛速度快和避免局部最优的优势,提出了一种基于最大最小蚂蚁系统的应急物流路径规划方法.该方法通过最大最小蚂蚁系统将信息素限制在一个适当的范围之内,克服了传统算法收敛速度慢和易陷于局部最优的缺点.对应用最大最小蚂蚁系统的应急物流系统进行仿真实验,结果表明:该方法能快速实现应急物流配送,满足了实际需要,减少了物流成本.
|
| 关 键 词： | 蚁群优化 最大最小蚂蚁系统 旅行商问题 应急物流 |
A Method of Contingency Logistics Path Planning Based on Max-Min Ant System |
| |
| JIN Bao-hua, ZHANG Liang, HE Zhen-yuan. A Method of Contingency Logistics Path Planning Based on Max-Min Ant System[J]. Journal of Zhongyuan Institute of Technology, 2011, 22(2). DOI: 10.3969/j.issn.1671-6906.2011.02.004 |
| |
| Authors: | JIN Bao-hua ZHANG Liang HE Zhen-yuan |
| |
| Affiliation: | JIN Bao-hua,ZHANG Liang,HE Zhen-yuan(Zhengzhou University of Light Industry,Zhengzhou 450002,China) |
| |
| Abstract: | According to the problems in Contingency Logistics,using the advantage of fast convergence and avoiding local optimum of Max-Min ant system,the Contingency Logistics path planning method based on the Max-Min ant system is proposed in this paper.This method overcomes the slow convergence and easy-trapped local optimum of conventional algorithms through that the Max-Min ant system limits the pheromone in an appropriate range.Finally,simulation experiments are executed for contingency logistics system which us... |
| |
| Keywords: | ant colony optimization Max-Min ant system traveling salesman problem contingency logistics |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
