存在车辆租赁及共享且有时间窗的多配送中心开环VRP  

Multi-depot open vehicle routing problem with time windows based on vehicle leasing and sharing

作　　者：刘家利[1] 马祖军[1] 

机构地区：[1]西南交通大学经济管理学院物流与应急管理研究所,成都610031

出　　处：《系统工程理论与实践》2013年第3期666-675,共10页Systems Engineering-Theory & Practice

基　　金：国家自然科学基金(70771094;90924012;71090402);教育部新世纪优秀人才支持计划(NCET-10-0706);高等学校博士学科点专项科研基金(20090184110029);四川省青年科技基金(09ZQ026-021);四川省学术和技术带头人培养资金(川人社办发[2011]441号);中央高校基本科研业务费专项资金(SWJTU11CX152)

摘　　要：针对企业自身运力有限以及旗下多个配送中心在各决策周期运力不均衡的情况,提出了一类具有多个配送中心、需要进行车辆租赁和车辆共享、有时间窗限制、开环的VRP,建立了相应的混合整数规划模型.通过引入一个虚拟配送中心,将多配送中心VRP转化为单配送中心VRP,并设计了一种结合扫描算法和C-W节约算法、对车辆路径和车辆调度统筹优化的混合遗传算法.最后,以重庆天友乳业物流分公司的业务数据对该模型的可行性和有效性进行了验证,结果表明本文所提方法与该企业现有的配送方案相比,在配送总里程、配送总成本和车辆在途时间等方面均有明显改进.此外,进行了模型参数的灵敏度分析和算法的收敛性分析,结果表明该算法具有较好的性能.To solve the insufficiency of transportation capacity in a company and the imbalance of trans- portation capacity among its decentralized distribution centers in each decision-making process, this study developed a mixed-integer programming model for multi-depot open vehicle routing problem （VRP） with time windows based on vehicle leasing and sharing. By introducing a virtual distribution center, the multi- depot VRP was transformed into a single depot VRP. Then a hybrid genetic algorithm was proposed by combing scanning algorithms with C-W saving algorithm, as well as optimizing vehicle routing and vehicle scheduling together. Finally, the validity of the model and algorithm was demonstrated by the real data from logistics branch of Chongqing Tianyou Dairy Co., Ltd. The results show that the model and algo- rithm performs better than company＇s existing solution in the following aspects： total travel mileage, total cost, and time en route of delivery vehicles. In addition, the sensitivity analysis of model parameters and the convergence analysis of the algorithm were done, and the results show that the algorithm has better performance.

关 键 词：车辆路径问题 多配送中心 车辆租赁 车辆共享 时间窗 混合遗传算法 

分 类 号：U116.2[交通运输工程]