Optimization of multi-depot open split delivery vehicle routing problem with simultaneous delivery and pick-up

被引：0

作者：

Fan H. ^{[1
]}

Zhang X. ^{[1
]}

Ren X. ^{[1
]}

Liu P. ^{[1
]}

机构：

[1] Transportation Engineering College, Dalian Maritime University, Dalian

来源：

Xitong Gongcheng Lilun yu Shijian/System Engineering Theory and Practice | 2021年 / 41卷 / 06期

基金：

中国国家自然科学基金;

关键词：

Hybrid genetic algorithm; Multi-depot; Simultaneous delivery and pick-up; Split delivery; Vehicle routing problem;

D O I：

10.12011/SETP2019-1465

中图分类号：

学科分类号：

摘要：

Aiming at the multi-depot open split delivery vehicle routing problem with simultaneous delivery and pick-up (MDOSDVRPSDP), a vehicle routing optimization model is established for minimizing the total cost, which includes vehicle dispatching cost, tally cost and transportation cost. The hybrid genetic algorithm (HGA) is proposed to solve this problem. The randomness and ergodicity of chaotic systems are used to generate initial populations for the diversity of initial populations. Perturbation strategy and neighborhood scale reduction strategy are introduced to improve the search efficiency. A combination of elite strategy and roulette strategy is used to balance the diversity and quality of population. The validity of the model and algorithm is verified by comparison of multiple sets of numerical examples. The research results extend relevant theories of vehicle routing problem (VRP), which can not only provide a new idea for solving the problem of MDOSDVRPSDP, but also provide a theoretical basis for relevant decisions of logistics enterprises. © 2021, Editorial Board of Journal of Systems Engineering Society of China. All right reserved.

引用

页码：1521 / 1534

页数：13

共 31 条

[1]

Liu J L, Ma Z J., Multi-depot open vehicle routing problem with time windows based on vehicle leasing and sharing, Systems Engineering-Theory & Practice, 33, 3, pp. 666-675, (2013)

[2]

Liu R, Jiang Z B, Geng N., A hybrid genetic algorithm for the multi-depot open vehicle routing problem, OR Spectrum, 36, 2, pp. 423-424, (2014)

[3]

Yang X, Fan H M, Zhang X N, Et al., Optimization of multi-deport open vehicle routing problem with fuzzy time window, Computer Integrated Manufacturing Systems, 22, 7, pp. 1768-1778, (2016)

[4]

Soto M, Sevaux M, Rossi A, Et al., Multiple neighborhood search tabu search and ejection chains for the multidepot open vehicle routing problem, Computers & Industrial Engineering, 107, 5, pp. 211-222, (2017)

[5]

Shen L, Tao F M, Wang S Y., Multi-depot open vehicle routing problem with time windows based on carbon trading, International Journal of Environmental Research and Public Health, 15, 9, (2018)

[6]

Dror M, Trudeau P., Split delivery routing, Naval Research Logistics, 37, 3, pp. 383-402, (1990)

[7]

Xiong H, Yan H L., A three-phase tabu search heuristic for the split delivery vehicle routing problem, Systems Engineering-Theory & Practice, 35, 5, pp. 1230-1235, (2015)

[8]

Yang P, Zou H, Xu X H., Improved ant colony for vehicle routing problem with time windows and split pickups and deliveries, Systems Engineering, 33, 9, pp. 58-62, (2015)

[9]

Fu Z, Liu W, Qiu M., A tabu search algorithm for the vehicle routing problem with soft time windows and split deliveries by order, Chinese Journal of Management Science, 25, 5, pp. 78-86, (2017)

[10]

Pan W W, Guo H X, Zhou G Y, Et al., Research on split delivery and heterogeneous fleet vehicle routing based on two phase algorithm, Chinese Journal of Management Science, 24, S1, pp. 55-61, (2016)

← 1 2 3 4 →