Research on city unmanned logistics distribution with simultaneous delivery and pickup

Expand
  • 1. School of Science, Zhejiang Sci-Tech University, Hangzhou 310018, Zhejiang, China
    2. School of Mathematics, Southeast University, Nanjing 211189, Jiangsu, China

Received date: 2021-08-09

  Online published: 2023-09-14

Abstract

With the requirement for the protection of energy saving and emission reduction and also the development of the artificial intelligence, the city logistics distribution that uses unmanned aerial vehicle as distribution device has gradually turned into reality. Considering the battery capacity constraints of device, the charging decision and the pickup and delivery simultaneous demands, a mathematical programming model is constructed with the objective of minimizing the distribution cost (E-VRPSDP). A new branch-cut-and-price algorithm is provided to solve the exact solution based on the column generation method and bi-directional dynamic programming. To solve the large size E-VRPSDP, an improved simulated annealing algorithm is designed. A new operator is introduced as the constructing feasible solution operator which evolves the original solution into a feasible solution, thereby improving the searching ability of the algorithm. Finally, the suitable data examples are generated based on the standard test set to verify the proposed algorithms. The theoretical guidance and algorithm support for city logistics enterprises is provided to develop the driver-less logistics distribution.

Cite this article

Yunwei ZHANG, Shuguang HAN . Research on city unmanned logistics distribution with simultaneous delivery and pickup[J]. Operations Research Transactions, 2023 , 27(3) : 53 -67 . DOI: 10.15960/j.cnki.issn.1007-6093.2023.03.004

References

1 国务院. 国务院关于加快建立健全绿色低碳循环发展经济体系的指导意见[EB/OL]. (2021-02-22)[2021-07-28]. http://www.gov.cn/zhengce/content/2021-02/22/content_5588274.htm.
2 Dantzig G , Ramser R . The truck dispatching problem[J]. Management Science, 1959, 6 (1): 80- 91.
3 Erdogan S , Miller-Hooks E . A green vehicle routing problem[J]. Transportation Research Part E Logistics & Transportation Review, 2012, 48 (1): 100- 114.
4 Schneider M , Stenger A , Goeke D . The electric vehicle-routing problem with time windows and recharging stations[J]. Transportation Science, 2014, 48 (4): 500- 520.
5 Min H . The multiple vehicle routing problem with simultaneous delivery and pick-up points[J]. Transportation Research Part A: General, 1989, 23 (5): 377- 386.
6 Dell'Amico M , Righini G , Salani M . A branch-and-price approach to the vehicle routing problem with simultaneous distribution and collection[J]. Transportation Science, 2006, 40 (2): 235- 247.
7 Dantzig G , Wolfe P . Decomposition principle for linear programs[J]. Operations Research, 1960, 8 (1): 101- 111.
8 Desaulniers G , Errico F , Irnich S , et al. Exact algorithms for electric vehicle-routing problems with time windows[J]. Operations Research, 2016, 64 (6): 1388- 1405.
9 Feillet D , Dejax P , Gendreau M , et al. 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.
10 Righini G , Salani M . Symmetry helps: bounded bi-directional dynamic programming for the elementary shortest path problem with resource constraints[J]. Discrete Optimization, 2006, 3 (3): 255- 273.
11 Roberti R , Wen M . The electric traveling salesman problem with time windows[J]. Transportation Research Part E: Logistics & Transportation Review, 2016, 89, 32- 52.
12 Montane F , Galvao R . A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service[J]. Computers & Operations Research, 2006, 33 (3): 595- 615.
13 Montane F , Galvao R , Avci M , et al. A hybrid metaheuristic algorithm for heterogeneous vehicle routing problem with simultaneous pickup and delivery[J]. Expert Systems with Applications, 2006, 33 (3): 595- 615.
14 Montane F , Galvao R . A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service[J]. Computers & Operations Research, 2016, 53, 160- 171.
15 Chen J , Wu T . Vehicle routing problem with simultaneous deliveries and pickups[J]. Journal of the Operational Research Society, 2006, 57 (5): 579- 587.
16 Solomon M . Algorithms for the vehicle routing and scheduling problems with time window constraints[J]. Operations Research, 1987, 35 (2): 254- 265.
17 Salhi S , Nagy G . A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling[J]. Journal of the Operational Research Society, 1999, 50 (10): 1034- 1042.
18 Ryan D , Foster B . An integer programming approach to scheduling[J]. Computer Scheduling of Public Transport, 1981, 1, 269- 280.
Outlines

/