Skip to main content

Advertisement

SpringerLink
Log in

A dynamic routing optimization problem considering joint delivery of passengers and parcels

  • Original Article
  • Published:
Neural Computing and Applications Aims and scope Submit manuscript

Abstract

With the rapid development of e-commerce, last-mile delivery optimization is important for reduction in logistics cost of e-business enterprises. However, the complex road network structure in various cities makes the last-mile delivery more difficult, which shows high research value. To this end, this paper proposes a special kind of share-a-ride problem (SARP), which uses online car-hailing as a carrier to transport passengers to the distribution centre and courier points to pick up and deliver parcels. The dynamics of the problem is described by designing the key points to update the delivery information; by using an improved genetic algorithm (GA), the problem is solved to realize the goal of minimizing the total cost of three participants (i.e. drivers, passengers and courier companies) and the time penalty costs. Eventually, through simulation example and comparison tests based on three sets of data of different scales, the economic applicability of the problem and the effectiveness of the algorithm are validated.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  1. Shanshan C, Hong C, Jiasheng Ye (2013) Research on emergency merchandise distribution under the demand of e-commerce promotion blowout. China Manag Sci S1:141–147

    Google Scholar 

  2. Weiand L et al (2019) “Erratum: climate change and air pollution: the connection between traffic intervention policies and public acceptance in a local context. Environ Res Lett 14:085008. https://doi.org/10.1088/1748-9326/Ab299b

    Article  Google Scholar 

  3. Cordeau JF, Laporte G (2003) The Dial-a-ride problem (DARP): variants, modeling issues and algorithms. Q J Belg Fr Ital Oper Res Soc 1(2):89–101

    MathSciNet  MATH  Google Scholar 

  4. Li B, Krushinsky D, Reijers HA, Van Woensel T (2014) The share-a-ride problem: people and parcels sharing taxis. Eur J Oper Res 238:31–40. https://doi.org/10.1016/j.ejor.2014.03.003

    Article  MathSciNet  MATH  Google Scholar 

  5. Ghiani G, Guerriero F, Laporte G et al (2003) Real-time vehicle routing: solution concepts, algorithms and parallel computing strategies [J]. Eur J Oper Res 151(1):1–11

    Article  Google Scholar 

  6. Trentini A, Mahléné N (2010) Toward a Shared Urban Transport System Ensuring Passengers & Goods Cohabitation [J]. Tema Journal of Land Use Mobility & Environment 3(2):37–44

    Google Scholar 

  7. Pillac V, Gendreau M, Guéret C et al (2013) A review of dynamic vehicle routing problems[J]. Eur J Op Res 225(1):1–11

    Article  MathSciNet  Google Scholar 

  8. Xianlong Ge, Wang Xu, Ying D (2011) Vehicle scheduling problem with stochastic demand based on hybrid quantum genetic algorithm [J]. Syst Eng 03:57–63

    Google Scholar 

  9. Li B, Krushinsky D, Van Woensel T, Reijers HA (2016) An adaptive large neighborhood search heuristic for the share-a-ride problem. Comput Oper Res 66:170–180

    Article  MathSciNet  Google Scholar 

  10. Nguyen NQ, Tuan KLE, Nghiem NVD et al (2015) People and parcels sharing a taxi for Tokyo city. ACM Int Conf Proceeding Ser 03–04-December-2015:90–97

  11. Yanfeng Li, Ziyou G, Jun Li (2014) Dynamic vehicle routing and dispatching problem% research on dynamic network vehicle routing and dispatching problem [J]. J Manag Sci 17(8):1–9

    Google Scholar 

  12. Ting Z, Pingzhong L, Qinfei H et al (2015) Optimization of dynamic vehicle routing of urban distribution based on the real-time information [J]. Syst Eng 7:58–64

    Google Scholar 

  13. Zhou L et al. (2017) "Solving dynamic vehicle routing problem via evolutionary search with learning capability," 2017 IEEE Congress on Evolutionary Computation (CEC), San Sebastian, pp. 890-896

  14. Van Son N, Babaki B, Dries A, Dung PQ, Xuan N (2017) "Prediction-based optimization for online People and Parcels share a ride taxis," 2017 9th International Conference on Knowledge and Systems Engineering (KSE), Hue, pp. 42–47

  15. NGUYEN VS, Dung PHAM Q, PHAN AT (2019) "An adaptive large neighborhood search solving large people and parcel share-a-ride problem," 2019 6th NAFOSTED Conference on Information and Computer Science (NICS), Hanoi, Vietnam, pp. 303–308

  16. Fang Y, Chen K, Chu F, Wu P (2017) Model for the multiple depots heterogeneous dial-aride problem with flexible depots. 14th Int Conf Serv Syst Serv Manag ICSSSM 2017

  17. Huang H, Savkin AV, Huang C (2019) "Control of a novel parcel delivery system consisting of a UAV and a Public Train," 2019 IEEE 17th International Conference on Industrial Informatics (INDIN), Helsinki, Finland, 2019, pp. 1047–1050

  18. Zhang KF, Lu MM, Zheng L (2017) Big data based metro crowd delivery system. J Commun 38(Z2):1–14

    Google Scholar 

  19. Lv Pu, Xiangpei Hu (2017) Lu Bo (2017) research on high-speed rail express cooperation game model based on participating in relation network[J]. Syst Eng Theor Pract 37:1547

    Google Scholar 

  20. Liu Y, Khalifa IH, Kamel AE (2016) "The multi-period and multi-depot dynamic vehicle routing problem with time windows," 2016 3rd International Conference on Logistics Operations Management (GOL), Fez, 2016, pp. 1–6

  21. Shilian H (2016) Distribution routes clustering and optimization based on customer dynamic demand attributes [J]. J Syst Manag 25(6):1146–1153

    Google Scholar 

  22. Sarasola B, Doerner KF, Schmid V et al (2016) Variable neighborhood search for the stochastic and dynamic vehicle routing problem. Ann Oper Res 236(2):425–461

    Article  MathSciNet  Google Scholar 

  23. Fagerholt K, Foss BA, Horgen OJ (2009) A decision support model for establishing an air taxi service: a case study [J]. J Oper Res Soc 60(9):1173–1182

    Article  Google Scholar 

  24. Chen HK, Hsueh CF, Chang MS (2006) The real-time time-dependent vehicle routing problem[J]. Transp Res E Logs Transp Rev 42E(5):383–408

    Article  Google Scholar 

  25. Xiang X, Qiu J, Xiao J, Zhang X (2020) Demand coverage diversity based ant colony optimization for dynamic vehicle routing problems. Eng Appl Artif Intell 91:103582

    Article  Google Scholar 

  26. Liu Y, Khalifa IH, Kamel AE, (2016) The multi-period and multi-depot dynamic vehicle routing problem with time windows [C] // International Conference on Logistics Operations Management. IEEE

  27. Qin Z, Hui Li (2010) An improved genetic algorithm for vehicle routing problems with time windows [J]. Chin J Syst Manag 019(005):589–592600

    Google Scholar 

  28. Bouziyane B, Dkhissi B, Cherkaoui M (2016) A hybrid genetic algorithm for the static and dynamic Vehicle Routing Problem with Soft Time Windows. In: Third IEEE international conference on logistics operations management, IEEE Press, Fes, MOROCCO, MAY 23–25, 2016

  29. Messaoud E, Alaoui AE (2017) Hybrid ant colony system algorithm for the vehicle routing problem with dynamic customers and traffic factors. In: Intelligent systems and computer vision (ISCV), IEEE Press, Fez, MOROCCO, APR 17-19, 2017

  30. AbdAllah AMF, Essam DL, Sarker RA (2017) On solving periodic re-optimization dynamic vehicle routing problems[J]. Appl Soft Comput 55:1–12

    Article  Google Scholar 

  31. Houming F, Jiaxin W, Jing G et al (2020) Vehicle routing problem with fuzzy demand and time window and hybrid genetic algorithm [J]. J Syst Manag 1:107–118

    Google Scholar 

  32. Yulei Y, Jin Z (2019) "Vehicle Routing Problem with Soft Time Windows Based on Dynamic Demands," 2019 4th International Conference on Intelligent Transportation Engineering (ICITE), Singapore, 2019, pp. 222–226

  33. Golpayegani F, Clarke S (2018) "Co-Ride: Collaborative preference-based taxi-sharing and taxi-dispatch," 2018 IEEE 30th International Conference on Tools with Artificial Intelligence (ICTAI), Volos, pp. 864–871

  34. Wang F, Zhu Y, Wang F, Liu J, Ma X, Fan X "Car4Pac: Last mile parcel delivery through intelligent car trip sharing," in IEEE Transactions on Intelligent Transportation Systems

  35. Wang F, Wang F, Ma X, Liu J (2019) Demystifying the crowd intelligence in last mile parcel delivery for smart cities. IEEE Netw 33(2):23–29

    Article  Google Scholar 

  36. Xijun Z, Qirui Z, Lijuan Z et al (2019) Research on taxi shared route planning based on improved genetic algorithm [J].Transportation system engineering and information, 06: 127–132

  37. Huang H, Savkin AV, Huang C (2019) "Optimal Control of a Hybrid UAV/Train Parcel Delivery System," 2019 Chinese Control Conference (CCC), Guangzhou, China, pp. 6606-6609

  38. Huang H, Savkin AV, Huang C (2019) "Control of a novel parcel delivery system consisting of a UAV and a Public Train," 2019 IEEE 17th International Conference on Industrial Informatics (INDIN), Helsinki, Finland, pp. 1047–1050

  39. Zhu H, Dou S, Qiu Y (2019) Joint model for last-mile delivery service selection in China: evidence from a cross-nested logit study. IEEE Access 7:137668–137679

    Article  Google Scholar 

  40. Wang F, Li YX, Zhou AM, Tang K (2020) An estimation of distribution algorithm for mixed-variable newsvendor problems. IEEE Trans Evol Comput 24(3):479–493

    Google Scholar 

Download references

Acknowledgments

This work was supported by the National Natural Science Foundation, China (No. 61773120, No.71771028), the Opening Foundation of Beijing Intelligent Logistics Collaborative Innovation Centre (No. BILSCIC-2019KF-25), the Innovation Team of Guangdong Provincial Department of Education (2018KCXTD031), Hunan Key Laboratory of Intelligent Logistics Technology (2019TP1015) and State Key Laboratory of Digital Manufacturing Equipment and Technology (DMETKF2020030).

Author information

Authors and Affiliations

  1. School of Logistics and Transportation, Central South University of Forestry and Technology, Changsha, 410004, People’s Republic of China

    Teng Ren, Zhuo Jiang, Xiangyu Cai, Yongzhuo Yu, Lining Xing & Yuan Zhuang

  2. College of Systems Engineering, National University of Defense Technology, Changsha, 410073, People’s Republic of China

    Lining Xing

  3. State Key Laboratory of Digital Manufacturing Equipment and Technology, Huazhong University of Science and Technology, Wuhan, 430074, People’s Republic of China

    Lining Xing

  4. School of Information, Beijing Wuzi University, Beijing, 101149, People’s Republic of China

    Zhenping Li

Authors
  1. Teng Ren
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zhuo Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Xiangyu Cai
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yongzhuo Yu
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Lining Xing
    View author publications

    You can also search for this author in PubMed Google Scholar

  6. Yuan Zhuang
    View author publications

    You can also search for this author in PubMed Google Scholar

  7. Zhenping Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to Lining Xing or Zhenping Li.

Ethics declarations

Conflicts of interest

The authors declare that they have no conflict of interest.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Appendix

Appendix

See Table 1, 2, 3, 4 and 5.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ren, T., Jiang, Z., Cai, X. et al. A dynamic routing optimization problem considering joint delivery of passengers and parcels. Neural Comput & Applic 33, 10323–10334 (2021). https://doi.org/10.1007/s00521-021-05794-1

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00521-021-05794-1

Keywords

Search

Navigation