帮助 关于我们

返回检索结果

考虑前置仓选址与服务策略的同时取送货车辆路径问题研究
Integrated sustainable planning of fast-pick area network and vehicle routing with simultaneous delivery and pick-up

查看参考文献29篇

郭放 1   黄志红 2 *   黄卫来 2  
文摘 本文在电子商务环境下研究了面向城市小件物流配送的同时取送货车辆路径问题,兼顾前置仓的选址策略,允许车辆在配送途中前往前置仓进行补货与存货操作.依据退回货物的状态差异构建两类配送子模型,统筹安排车辆的服务路径、前置仓选址以及补货存货策略使得物流企业整体运营成本最低.其次,设计了一种基于节约算法与自适应大邻域搜索的混合启发式算法CWIGALNS求解上述问题,提出改进算子提升算法的求解效率.随后,通过9组小规模算例验证了模型的准确性和算法的有效性.最后,采用多组较大规模算例进行数值实验.实验结果表明,两类配送子模型中,前置仓提供存货服务的模式有助于车载容量的循环使用,减少车辆使用数目降低物流配送成本.本文提出的模型与算法可以为城市小件物流配送企业服务策略的制定提供良好借鉴与帮助.
其他语种文摘 In this paper,we present an optimal planning of vehicle routing problem with simultaneous delivery and pick-up for urban small package shipping under electronic commerce context.At the same time,the location strategy of the fast-pick areas are taken into consideration,vehicles can be replenished and unloading can be done at the fast-pick areas.The problem is formulated as two integer programming models which aim to reduce the operational cost of logistics enterprises with the consideration of routing,location and service strategies.A hybrid heuristic algorithm called CWIGALNS with different modified operators are proposed to solve the problem and the validity of the models and the reliability of CWIGALNS are assess on 9 small-scale instances.Finally,experiments are performed on multiple sets of instances belonging to two different series.The model in which unloading can be done at the fast-pick areas could decrease the operational cost with less vehicles.The models and algorithm proposed in this paper can provide good reference and help for the service strategy of urban small package shipping enterprises.
来源 系统工程理论与实践 ,2021,41(4):962-978 【核心库】
DOI 10.12011/SETP2019-1302
关键词 前置仓 ; 同时取送货 ; 差别化回收策略 ; 节约算法 ; 自适应大邻域搜索
地址

1. 郑州大学管理工程学院, 郑州, 450001  

2. 华中科技大学管理学院, 武汉, 430074

语种 中文
文献类型 研究性论文
ISSN 1000-6788
学科 自动化技术、计算机技术;综合运输
基金 河南省高等学校重点科研项目
文献收藏号 CSCD:6950515

参考文献 共 29 共2页

1.  Huang Z H. Integrated sustainable planning of self-pickup and door-to-door delivery service with multi-type stations. Computers & Industrial Engineering,2019,135:412-425 CSCD被引 5    
2.  郭放. 考虑充电策略与电池损耗的电动汽车路径优化问题研究. 中国管理科学,2018,26(9):106-118 CSCD被引 20    
3.  揭婉晨. 多车型电动汽车车辆路径问题的分支定价算法研究. 系统工程理论与实践,2016,36(7):1795-1805 CSCD被引 28    
4.  Hiermann G. The electric fleet size and mix vehicle routing problem with time windows and recharging stations. European Journal of Operational Research,2016,252(3):995-1018 CSCD被引 36    
5.  Koc C. The fleet size and mix location-routing problem with time windows: Formulations and a heuristic algorithm. European Journal of Operational Research,2016,248(1):33-51 CSCD被引 14    
6.  Schiffer M. Vehicle routing and location routing with intermediate stops: A review. Transportation Science,2019,53(2):319-343 CSCD被引 3    
7.  Nedjati A. Bi-objective covering tour location routing problem with replenishment at intermediate depots: Formulation and meta-heuristics. Computers & Industrial Engineering,2017,110:191-206 CSCD被引 4    
8.  Schiffer M. Designing sustainable mid-haul logistics networks with intra-route multi-resource facilities. European Journal of Operational Research,2018,265(2):517-532 CSCD被引 3    
9.  Min H. The multiple vehicle routing problem with simultaneous delivery and pick-up points. Transportation Research Part A: General,1989,23(5):377-386 CSCD被引 59    
10.  谢如鹤. 基于剩余装载能力的逆向物流车辆路径问题. 系统工程,2004,22(10):20-23 CSCD被引 5    
11.  Zachariadis E E. The vehicle routing problem with simultaneous pick-ups and deliveries and two-dimensional loading constraints. European Journal of Operational Research,2016,251(2):369-386 CSCD被引 10    
12.  Zachariadis E E. Vehicle routing strategies for pick-up and delivery service under two dimensional loading constraints. Operational Research,2017,17(1):115-143 CSCD被引 1    
13.  Kececi B. A hybrid constructive mat-heuristic algorithm for the heterogeneous vehicle routing problem with simultaneous pick-up and delivery. Evolutionary Computation in Combinatorial Optimization,2016:1-17 CSCD被引 1    
14.  Avci M. A hybrid metaheuristic algorithm for heterogeneous vehicle routing problem with simultaneous pickup and delivery. Expert Systems with Applications,2016,53:160-171 CSCD被引 12    
15.  Zachariadis E E. The load-dependent vehicle routing problem and its pick-up and delivery extension. Tansportation Research Part B: Methodological,2015,71:158-181 CSCD被引 2    
16.  Wang C. A parallel simulated annealing method for the vehicle routing problem with simultaneous pickup-delivery and time windows. Computers & Industrial Engineering,2015,83:111-122 CSCD被引 28    
17.  Kalayci C B. An ant colony system empowered variable neighborhood search algorithm for the vehicle routing problem with simultaneous pickup and delivery. Expert Systems with Applications,2016,66:163-175 CSCD被引 11    
18.  Polat O. A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit. European Journal of Operational Research,2015,242(2):369-382 CSCD被引 6    
19.  田宇. 求解异车型同时集送问题的多属性标签算法. 系统工程理论与实践,2015,35(1):183-190 CSCD被引 4    
20.  Kartal Z. Single allocation p-hub median location and routing problem with simultaneous pick-up and delivery. Transportation Research Part E: Logistics and Transportation Review,2017,108:141-159 CSCD被引 5    
引证文献 13

1 李倩 基于模糊时间窗的多目标冷链配送优化 计算机工程与应用,2021,57(23):255-262
CSCD被引 8

2 陈希琼 多目标同时取送货选址-路径问题的多起点变邻域搜索算法 控制理论与应用,2022,39(7):1229-1241
CSCD被引 2

显示所有13篇文献

论文科学数据集
PlumX Metrics
相关文献

 作者相关
 关键词相关
 参考文献相关

版权所有 ©2008 中国科学院文献情报中心 制作维护:中国科学院文献情报中心
地址:北京中关村北四环西路33号 邮政编码:100190 联系电话:(010)82627496 E-mail:cscd@mail.las.ac.cn 京ICP备05002861号-4 | 京公网安备11010802043238号