基于改进蚁群算法的考虑车辆行程约束的逆向物流车辆路径问题研究  

Study on Routing Problem of Reverse Logistics Vehicles with Travel Distance Constraint Consideration Based on Improved Ant Colony Algorithm

作　　者：姜启跃[1] 

机构地区：[1]江西财经职业学院,江西九江332000

出　　处：《物流技术》2014年第10期318-320,共3页Logistics Technology

基　　金：江西省科技厅科学研究基金项目(JXJG-12-35-8)

摘　　要：以考虑车辆行程约束的逆向物流车辆路径问题为研究对象,建立了逆向物流车辆路径的规划模型,在蚁群算法的基础上更新了信息素,构造了车辆负载使用率启发式因子并根据剩余客户的需要设定车辆的出仓载货量。最后结合实例说明,改进后的蚁群算法能够有效地提高车辆负载率,缩短车辆总行程,对解决实际物流问题有一定参考价值。In this paper, with the routing problem of the reverse logistics vehicles with travel distance constraint as the subject, we built the relevant programming model for the problem, constructed the heuristic factor of the loading and utility rate of the vehicles, and set the outbound loading volume of the vehicles according to the requirement of the customers. At the end, through an empirical case, we proved the effectiveness of the algorithm.

关 键 词：蚁群算法 车辆行程 逆向物流 车辆路径 

分 类 号：U116.2[交通运输工程] F252[经济管理—国民经济]