快递企业“最后一公里”快件收派优化方案研究
|
摘要
本文以快递公司快件收派服务为背景,对区域收派路线规划问题进行研究,结合A快递公司实际运作情况进行案例分析,综合考虑收派混合、动态性、时间窗和容量约束四个最主要的因素,建立数学模型,设计收派流程,通过改进的禁忌搜索算法在短时间内得到优化的路径结果,并在收派活动进行中动态处理新需求及实时更新收派路径,以提高收派效率。基于该企业实际数据的计算结果表明,本文提出的相应流程和算法比实际操作获得更好的解。
In recent years,with the rapid development of online shopping,Chinese express delivery industry has encountered unprecedented development opportunity,but with the changing of attitude and cognition,consumers have higher requirements for speed and quality of logistics delivery,which urge courier companies to focus on operational efficiency and cost as they strive to improve service levels. This paper is based on the background of express delivery companies' logistics distribution services,study its regional pickup and delivery route planning issues,in order to improve operational level. The paper combines with the actual operation of the courier company case to analysis,considering the pickup and delivery,dynamic,time window and capacity constraint as the most important factors,establish mathematical model,design pickup and delivery process,obtain the best results through improved tabu search algorithm in a short time,and in the process of pickup and delivery,dynamically deal with new requirements,real-time update path. Data show that the algorithm is efficient,and can get better solutions through the appropriate process and algorithm than the actual operation of courier company.
In recent years,with the rapid development of online shopping,Chinese express delivery industry has encountered unprecedented development opportunity,but with the changing of attitude and cognition,consumers have higher requirements for speed and quality of logistics delivery,which urge courier companies to focus on operational efficiency and cost as they strive to improve service levels. This paper is based on the background of express delivery companies' logistics distribution services,study its regional pickup and delivery route planning issues,in order to improve operational level. The paper combines with the actual operation of the courier company case to analysis,considering the pickup and delivery,dynamic,time window and capacity constraint as the most important factors,establish mathematical model,design pickup and delivery process,obtain the best results through improved tabu search algorithm in a short time,and in the process of pickup and delivery,dynamically deal with new requirements,real-time update path. Data show that the algorithm is efficient,and can get better solutions through the appropriate process and algorithm than the actual operation of courier company.
引文
[1]于焕英.我国民营快递企业业务流程优化研究[D].北京:北京交通大学,2011.
[2]张申.快递企业快件操作流程和异常调度研究[D].北京交通大学,2011.
[3]牟继冰.电子商务环境下快递公司节假日配送策略研究[D].大连海事大学,2012.
[4]杨聚平.以客户为中心“最后一公里_配送模式研究”[D].对外经济贸易大学,2014年.
[5]丁浩,苌道方.基于Dijkstra算法的快递车辆配送路径优化[J].价值工程,2014,3:15-18.
[6]刘欣萌,何世伟,陈胜波,路超.带时间窗VRP问题的多智能体进化算法[J].交通运输工程学报,2014,14(3):105-110.
[7]饶卫振,金淳.求解大规模CVRP问题的快速贪婪算法[J].管理工程学报,2014,28(2):45-54.
[8]贺政纲,刘沙.考虑均衡负载的车辆路径问题及算法设计[J].工业工程,2015,18(4):140-145.
[9]张如云,刘清.考虑低碳的城市配送车辆路径优化模型研究[J].工业工程与管理,2015,20(4):29-34.
[10]熊浩,鄢慧丽.需求可拆分车辆路径问题的三阶段禁忌算法[J].系统工程理论与实践,2015,35(5):1230-1235.
[11] Ninikas G,Minis I. Reoptimization strategies for a dynamic vehicle routing problem with mixed backhauls[J]. Networks,2014,64(3):214-231.
[12] Chabrier A. Vehicle routing problem with elementary shortest path based column generation[J]. Computers&operations research,2006,33(10):2972-2990.
[13] Feillet D,Dejax P,Gendreau M,Gueguen C. An exact algorithm for the elementary shortest path problem with resource constraints:application to some vehicle routing problems[J]. Networks,2004,44(3):216-229.
[14] Gendreau M, Guertin F, Potvin J Y, Taillard E.Parallel tabu search for real-time vehicle routing and dispatching[J]. Transportation Science,1999,33(4):381-390.
[15] Clarke G,Wright J W. Scheduling of vehicles from a central depot to a number of delivery points[J].Operations Research,1964,12(4):568-581.
[16] Desrochers M,Desrosiers J,Solomon M. A new optimization algorithm for the vehicle routing problem with time windows[J]. Operations Research,1992,40(2):342-354.
[17] Taillard E,Badeau P,Gendreau M,Guertin F,Potvin J Y. A tabu search heuristic for the vehicle routing problem with soft time windows[J]. Transportation Science,1997,31(2); 170-186.
[18] Athanasopoulos T,Minis I. Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework[J]. Annals of operations research,2013,206(1):1-22.
[19] Gelinas S,Desrochers M,Desrosiers J,Solomon M M.A new branching strategy for time constrained routing problems with application to backhauling[J]. Annals of operations research,1995,61(1):91-109.
[20] Bent R W,Hentenryck P V. Scenario-based planning for partially dynamic vehicle routing with stochastic customers[J]. Operations Research,2004,52(6):977-987.
[21] Yang J,Jaillet P,Mahmassani H. Real-time multivehicle truckload pickup and delivery problems[J]. Transportation Science,2004,38(2):135-148.
[22] Angelelli E,Bianchessi N,Mansini R,Speranza M G.Short term strategies for a dynamic multi-period routing problem[J]. Transportation Research Part C,2009,17(2):106-119.
[23] Gendreau M,Hert A,Laport G. New insertion and post-optimization procedures for the traveling salesman problem[J]. Operations Research,1992,40(6):1086-1095.
[2]张申.快递企业快件操作流程和异常调度研究[D].北京交通大学,2011.
[3]牟继冰.电子商务环境下快递公司节假日配送策略研究[D].大连海事大学,2012.
[4]杨聚平.以客户为中心“最后一公里_配送模式研究”[D].对外经济贸易大学,2014年.
[5]丁浩,苌道方.基于Dijkstra算法的快递车辆配送路径优化[J].价值工程,2014,3:15-18.
[6]刘欣萌,何世伟,陈胜波,路超.带时间窗VRP问题的多智能体进化算法[J].交通运输工程学报,2014,14(3):105-110.
[7]饶卫振,金淳.求解大规模CVRP问题的快速贪婪算法[J].管理工程学报,2014,28(2):45-54.
[8]贺政纲,刘沙.考虑均衡负载的车辆路径问题及算法设计[J].工业工程,2015,18(4):140-145.
[9]张如云,刘清.考虑低碳的城市配送车辆路径优化模型研究[J].工业工程与管理,2015,20(4):29-34.
[10]熊浩,鄢慧丽.需求可拆分车辆路径问题的三阶段禁忌算法[J].系统工程理论与实践,2015,35(5):1230-1235.
[11] Ninikas G,Minis I. Reoptimization strategies for a dynamic vehicle routing problem with mixed backhauls[J]. Networks,2014,64(3):214-231.
[12] Chabrier A. Vehicle routing problem with elementary shortest path based column generation[J]. Computers&operations research,2006,33(10):2972-2990.
[13] Feillet D,Dejax P,Gendreau M,Gueguen C. An exact algorithm for the elementary shortest path problem with resource constraints:application to some vehicle routing problems[J]. Networks,2004,44(3):216-229.
[14] Gendreau M, Guertin F, Potvin J Y, Taillard E.Parallel tabu search for real-time vehicle routing and dispatching[J]. Transportation Science,1999,33(4):381-390.
[15] Clarke G,Wright J W. Scheduling of vehicles from a central depot to a number of delivery points[J].Operations Research,1964,12(4):568-581.
[16] Desrochers M,Desrosiers J,Solomon M. A new optimization algorithm for the vehicle routing problem with time windows[J]. Operations Research,1992,40(2):342-354.
[17] Taillard E,Badeau P,Gendreau M,Guertin F,Potvin J Y. A tabu search heuristic for the vehicle routing problem with soft time windows[J]. Transportation Science,1997,31(2); 170-186.
[18] Athanasopoulos T,Minis I. Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework[J]. Annals of operations research,2013,206(1):1-22.
[19] Gelinas S,Desrochers M,Desrosiers J,Solomon M M.A new branching strategy for time constrained routing problems with application to backhauling[J]. Annals of operations research,1995,61(1):91-109.
[20] Bent R W,Hentenryck P V. Scenario-based planning for partially dynamic vehicle routing with stochastic customers[J]. Operations Research,2004,52(6):977-987.
[21] Yang J,Jaillet P,Mahmassani H. Real-time multivehicle truckload pickup and delivery problems[J]. Transportation Science,2004,38(2):135-148.
[22] Angelelli E,Bianchessi N,Mansini R,Speranza M G.Short term strategies for a dynamic multi-period routing problem[J]. Transportation Research Part C,2009,17(2):106-119.
[23] Gendreau M,Hert A,Laport G. New insertion and post-optimization procedures for the traveling salesman problem[J]. Operations Research,1992,40(6):1086-1095.