基于蚁群算法的循环取货车辆路径优化  

Problem on Vehicle Route Optimization of Milk- run Based on Ant Colony Algorithm

作　　者：孙洋[1] 严伟[1] 

机构地区：[1]上海海事大学,上海201306

出　　处：《物流工程与管理》2015年第7期85-86,60,共3页Logistics Engineering and Management

基　　金：国家自然科学基金项目(51409157);上海市晨光计划项目(14CG48);上海市扬帆计划项目(14YF1411200);教育部博士点科研基金(20133121110001);上海市教委科研创新项目(13YZ080;14YZ112)

摘　　要：文中以实现循环取货过程中整体费用最低为目标,通过构建车辆路径优化的模型,使用蚁群算法对模型进行求解,并与解决该类问题常用的遗传算法、粒子群算法进行比较分析。证明了蚁群算法能够有效的解决车辆路径优化问题,并使得循环取货过程的整体费用达到最低。In order to solve the problem on the vehicle routing optimization of milk-run to achieve the overall cost in the lowest In the process of milk-run.This paper constructs the model of vehicle routing optimization to solve the model by ant colony algorithm.The result shows that the ant colony algorithm can effectively solve the vehicle routing problem,and makes the cost of the whole process be the least.

关 键 词：循环取货 车辆路径优化 蚁群算法 

分 类 号：F503[经济管理—产业经济]