摘要
根据应急物流中存在的一些问题,利用最大最小蚂蚁系统收敛速度快和避免局部最优的优势,提出了一种基于最大最小蚂蚁系统的应急物流路径规划方法.该方法通过最大最小蚂蚁系统将信息素限制在一个适当的范围之内,克服了传统算法收敛速度慢和易陷于局部最优的缺点.对应用最大最小蚂蚁系统的应急物流系统进行仿真实验,结果表明:该方法能快速实现应急物流配送,满足了实际需要,减少了物流成本.
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 using the Max-Min ant system,experiments show that the method fast achieves the contingency logistics and distribution,which not only meets the actual needs,but reduces the cost of logistics.
出处
《中原工学院学报》
CAS
2011年第2期14-17,共4页
Journal of Zhongyuan University of Technology
基金
河南省重点科技攻关项目(072102210007)
关键词
蚁群优化
最大最小蚂蚁系统
旅行商问题
应急物流
ant colony optimization
Max-Min ant system
traveling salesman problem
contingency logistics
