Optimization on vehicle routing problem with simultaneous pickup-delivery for urban express joint distribution

doi:10.11835/j.issn.1000-582X.2017.10.004

Home > Archive>Volume 40, Issue 10, 2017 >30-39. DOI:10.11835/j.issn.1000-582X.2017.10.004

Optimization on vehicle routing problem with simultaneous pickup-delivery for urban express joint distribution
DOI:
                        10.11835/j.issn.1000-582X.2017.10.004
                    
CSTR:
                        [cstr]
                    
Author:
                        NI LinNI Lin
School of Mechanical Engineering, Chongqing University, Chongqing 400044, P. R. China
Find this author on All Journals
Find this author on BaiDu
Search for this author on this site
LIU KaipengLIU Kaipeng
School of Mechanical Engineering, Chongqing University, Chongqing 400044, P. R. China
Find this author on All Journals
Find this author on BaiDu
Search for this author on this site
TU ZhigangTU Zhigang
School of Mechanical Engineering, Chongqing University, Chongqing 400044, P. R. China
Find this author on All Journals
Find this author on BaiDu
Search for this author on this site

                    
Affiliation:
Clc Number:
Fund Project:

Article

Figures

Metrics

Reference [13]

Related [20]

Cited by

Materials

Comments

Abstract:

In order to minimize the total cost of distribution system and increase the vehicles' loading rate, the influence of simultaneous pickup-delivery on vehicles' loading rate is considered and a VRPSPD (vehicle routing problem with simultaneous pickup-delivery) model for urban express common distribution is established under the condition that express companies carry out joint distribution. Then an improved genetic algorithm is proposed to solve the model. Finally, the practicability and validity of the model and algorithm are tested by examples.

Key words:express company;no-load;urban joint distribution;simultaneous pickup-delivery;routing optimization;improved genetic algorithm

Reference

[1] Hayel Y, Quadri D, Jiménez T, et al. Decentralized optimization of last-mile delivery services with non-cooperative bounded rational customers[J]. Annals of Operations Research, 2016,239(2):451-469.

[2] 史春燕,黄辉.车辆路径问题:研究综述及展望[J].物流科技,2014,37(12):75-77. SHI Chunyan, HUANG Hui. Vehicle routing problem:research status and prospect[J]. logistics sci-tech, 2014,37(12):75-77. (in Chinese)

[3] Aghezzaf E H, Zhong Y, Raa B, et al. Analysis of the single-vehicle cyclic inventory routing problem[J]. International Journal of Systems Science, 2012, 43(11):2040-2049.

[4] Kovacs A A, Parragh S N, Hartl R F. The multi-objective generalized consistent vehicle routing problem[J]. European Journal of Operational Research, 2015, 247(2):441-458.

[5] Xiao Y, Konak A A. Simulating annealing algorithm to solve the green vehicle routing and scheduling problem with hierarchical objectives and weighted tardiness[J]. Applied Soft Computing, 2015, 34:372-388.

[6] Spliet R, Desaulniers G. The discrete time window assignment vehicle routing problem[J]. European Journal of Operational Research, 2015, 244(2):379-391.

[7] 王勇,吴志勇,廖明,等.物流配送车辆调度决策支持系统[J].重庆大学学报(自然科学版),2006,29(9):162-166. WANG Yong, WU Zhiyong, LIAO Ming, et al. Logistics distribution vehicle scheduling decision support system[J]. Journal of Chongqing University (Natural Science Edition), 2006, 29(9):162-166. (in Chinese)

[8] 王征,胡祥培,王旭坪.带二维装箱约束的物流配送车辆路径问题[J].系统工程理论与实践,2011,31(12):2328-2341. WANG Zheng, HU Xiangpei, WANG Xuping. Vehicle routing problem in distribution with two-dimensional loading constraint[J]. Systems Engineering Theory and Practice, 2011,31(12):2328-2341. (in Chinese)

[9] 谷炜,张群,卫李蓉.基于GIS的物流配送中心末端大规模车辆路径优化问题研究[J].中国管理科学,2013(s1):379-389. GU Wei, ZHANG Qun, WEI Lirong. Method of large-scale vehicle routing problem based on GIS[J].Chinese Journal of Management Science, 2013(Sup1):379-389. (in Chinese)

[10] Archetti C, Bianchessi N, Speranza M G. A branch-price-and-cut algorithm for the commodity constrained split delivery vehicle routing problem[J]. Computers and Operations Research, 2015, 64:1-10.

[11] Mahmoudi M, Zhou X. Finding optimal solutions for vehicle routing problem with pickup and delivery services with time windows:A dynamic programming approach based on state-space-time network representations[J]. Transportation Research Part B:Methodological, 2016, 89:19-42.

[12] Shen Q, Chu F, Chen H. A Lagrangian relaxation approach for a multi-mode inventory routing problem with transshipment in crude oil transportation[J]. Computers and Chemical Engineering, 2011, 35(10):2113-2123.

[13] 张景玲,赵燕伟,王海燕,等.多车型动态需求车辆路径问题建模及优化[J].计算机集成制造系统,2010,16(3):543-550. ZHANG Jingling, ZHAO Yanwei, WANG Haiyan, et al. Modeling and algorithms for a dynamic multi-vehicle routing problem with Customers' dynamic requests[J]. Computer Integrated Manufacturing Systems, 2010,16(3):543-550. (in Chinese)唐金环,戢守峰,沈贵财.时变网络下考虑碳排放的车辆路径优化.系统工程,2015(9):37-44. TANG Jinhuan, JI Shoufeng, SHEN Guicai. Vehicle routing optimization with carbon emissions considered under time-varying network. Systems Engineering, 2015(9):37-44. (in Chinese)

Get Citation

倪霖,刘凯朋,涂志刚.考虑同时取送货的城市快递共同配送路径优化[J].重庆大学学报,2017,40(10):30~39

Copy

Article Metrics

Abstract:1049
PDF: 1608
HTML: 766
Cited by: 0

History

Received:May 06,2017
Revised:
Adopted:
Online: November 02,2017
Published:

Home

Get Citation

Share

Article Metrics

History

Article QR Code