期刊文献+

多集散点VRP客户需求扰动的恢复模型 被引量:5

Disruption Management Model of Multi-depot Vehicle Routing Problem with Customers' Demand Changes
原文传递
导出
摘要 针对客户既有需求(配送)又有供应(集货)的车辆路径问题(MDVRPPD)的客户需求变动而导致物流配送计划无法实现的问题,运用干扰管理的思想,从物流服务商满意度和客户满意度两个方面衡量物流配送系统的扰动程度。以最小化客户不满意度、配送成本和路径偏离程度为目标,构建干扰恢复模型。设计了求解该模型的克隆免疫算法。最后,通过仿真研究,将干扰管理优化结果与原方案重新调度结果进行对比,验证了干扰恢复模型和算法的可行性和有效性。 During the process of logistics distribution,the problem of customer demand changes of the multi-depot vehicle routing problem with pickups and deliveries(MDVRPPD),will often lead to the infeasibility of the initial distribution schedule.To solve this problem,a disruption measurement method was presented,which take logistics service providers' satisfaction degree and customers' satisfaction degree into considerations.A disruption recovery model with the objective of minimizing customer's dissatisfaction,distribution cost and route change is constructed and an immune algorithm is designed to solve this model.Finally,a simulation example was presented to demonstrate the feasibility and validity of the proposed model.
作者 蒋丽 丁斌
出处 《系统工程》 CSSCI CSCD 北大核心 2010年第12期12-17,共6页 Systems Engineering
基金 安徽省自然科学基金资助项目(070416277X) 中国科学技术大学研究生创新基金资助项目(2009204003)
关键词 干扰管理 集货 配送 免疫算法 需求变动 Disruption Management Pickup Distribution Immune Algorithm Demand Change
  • 相关文献

参考文献16

  • 1Toth P, Vigo D. The vehicle routing problem[M]. American: Society for Industrial and Applied Mathematics, 2002 : 29 - 31.
  • 2霍佳震,张磊.有时间窗的集货送货一体化车辆路径规划启发式算法研究[J].物流技术,2004,23(5):64-66. 被引量:10
  • 3李军,郭辉煌.物流配送车辆调度理论与方法研究[M].北京:中国物流出版社,2001:52-58.
  • 4王素欣,高利,崔小光,陈雪梅.多集散点车辆路径问题及其蚁群算法研究[J].系统工程理论与实践,2008,28(2):143-147. 被引量:7
  • 5胡大伟,陈诚,郭晓汾.带集货和配送的多站点VRP优化算法研究[J].数学的实践与认识,2007,37(2):98-104. 被引量:12
  • 6Savelsbergh M W P. The general pickup and delivery problem [J]. Transportation Science, 1995,29 : 17 -25.
  • 7Renaud J, Laporte G, Boctor F F. A tabu search heuristic for the multi-depot vehicle routing problem[J]. Computers and Operations Research, 1996,23:229-235.
  • 8Salhi S, Sari M. A multi-level composite heuristic for the multi-depot vehicle fleet mix problem[J].European Journal of Operational Research, 1997, 103:95-112.
  • 9Su C T. Dynamic vehicle control and scheduling of a multi-depot physical distribution system[J]. Integrated Manufacturing Systems, 1999, 10:56 -65.
  • 10Wu T H, Low C, Bai J W. Heuristic solutions to multi-depot location-routing problem[J].Computers and Operations Research, 2002,29 : 1393- 1415.

二级参考文献23

  • 1陈宁,刘会林,傅维新.多企业协同运输研究[J].武汉理工大学学报(交通科学与工程版),2005,29(3):440-443. 被引量:13
  • 2钟石泉,贺国光.多车场有时间窗的多车型车辆调度及其禁忌算法研究[J].运筹学学报,2005,9(4):67-73. 被引量:31
  • 3杨元峰,崔志明,陈建明.有时间窗约束的多车场车辆路径问题的改进遗传算法[J].苏州大学学报(工科版),2006,26(2):20-23. 被引量:6
  • 4J Desroslers, GLaporte, ""Vehicle Routing With Full Loads"" [J].Comput. Oper. Res. 1988,15:219-226.
  • 5M W P savelsbergh. The General Pickup And Delivery Problem[J].Transportation Science, 1995,29:17-25.
  • 6L Bodin,B Golden,A Assad and M Ball. ""Routing And Scheduling of Vehicle And Grews-The State Of The Art"" [J].Comput. Oper.Res. 1983,10:63-251.
  • 7S Anily,G Mosheiov. ""The Traveling Salesman Problem With Delivery And Backhauls""[J].Oper. Res. Left. 1994,16:11-18.
  • 8Tali Eilam Tzoreff, Daniel Granot. ""The Vehicle Route Problem With Pickup And Delivery On Some Special Graphs"" [J].Discrete Applied Mathematics, 2002,116:193-229.
  • 9G·Mosheiov. ""The Traveling Salesman Problem With Pickup And Delivery "" [J] .European J Oper. Res. 1994,79 (2) :299-310.
  • 10G·Mosheiov. The Pickup Delivery Location Problem On Networks[J].Networks, 1995,26:249-251.

共引文献26

同被引文献59

  • 1崔珊珊,陈宏,俆加胜.电商促销井喷需求下的应急商品配送研究[J].中国管理科学,2013,21(S1):141-147. 被引量:14
  • 2胡祥培,丁秋雷,张漪,王旭坪.干扰管理研究评述[J].管理科学,2007,20(2):2-8. 被引量:41
  • 3Cornillier F, Boctor F, Renaud J. Heuristics for the multi-depot petrol station replenishment problem with time windows[J]. European Journal of Operational Research, 2012, 220(2): 361-369.
  • 4Aras N, Aksen D, Tekin M T. Selective multi-depot vehicle routing problem with pricing[J]. Transportation Research Part C, 2011, 19(5): 866-884.
  • 5Wasner M, Zapfel G. An integrated multi-depot hub-location vehicle routing model for network planning of parcel service[J]. International Journal of Production Economics, 2004, 90(3): 403-419.
  • 6Nagy G, Salhi S. Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries[J]. European Journal of Operational Research, 2005, 162(1): 126-141.
  • 7Kuo Y, Wang C C. A variable neighborhood search for the multi-depot vehicle routing problem with loading cost[J]. Expert systems with Application, 2012, 39(8): 6949-6954.
  • 8Mirabi M, Fatemi Ghomi S M T, Jolai F. Efficient stochastic hybrid heuristics for the multi-depot vehicle routing problem[J]. Robotics and Computer-Integrated Manufacturing, 2010, 26(6): 564-569.
  • 9Gulczynski D, Golden B, Wasil E. The multi-depot split delivery vehicle routing problem: An integer programming- based heuristic, new test problems, and computational results[J]. Computers & Industrial Engineering, 2011, 61(3): 794-804.
  • 10Crevier B, Cordeau J F, Laporte G. The multi-depot vehicle routing problem with inter-depot routes[J]. European Journal of Operational Research, 2007, 176(2): 756-773.

引证文献5

二级引证文献61

相关作者

内容加载中请稍等...

相关机构

内容加载中请稍等...

相关主题

内容加载中请稍等...

浏览历史

内容加载中请稍等...
;
使用帮助 返回顶部