摘要
提出了一种用于解决突发事件下,物流配送多目标优化问题的蚁群聚类优化算法。突发事件下的物流配送规划一般包含两方面内容,将救灾物资运往受灾地区和将灾区的伤员及时送至各医疗点。将多目标问题转化为单目标问题,结合蚁群的墓地构造行为特点,利用改进LF蚁群聚类模型,以节点需求未得到满足的不满意度最小和路由时间最短为优化目标,用LF蚁群聚类方法按约束条件进行聚类,最终确定车辆路由线路。
This paper proposes an ant colony clustering optimal algorithms on the problem of multi objective optimization of logistics distribution which is used to solve emergencies. The logistics distribution principle under emergency includes two aspects： relief supplies will be transported to the affected areas and wounded person will be sent to the medical centers. Through transforming the multi-objective problem into a single one, combining with the characteristics of graveyard tectonic behavior of ant colony, using the improved LF ant clustering model and taking minimizing dissatisfied node need and shortest travel time as the optimization objective, the vehicle routing lines are determined finally by using LF ant clustering model clustered according to the restrictions.
出处
《铁道运输与经济》
北大核心
2008年第9期66-69,73,共5页
Railway Transport and Economy
基金
四川省科技攻关计划项目(2006Z08-037)
关键词
应急物流
蚁群算法
车辆路径
聚类
emergency logistics
ant colony algorithm
vehicle routing
clustering
