Nothing Special   »   [go: up one dir, main page]
Skip to main content

Advertisement

Springer Nature Link
Log in

Dynamic multi-stage failure-specific cooperative recourse strategy for logistics with simultaneous pickup and delivery

  • Methodologies and Application
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

With the development of distribution logistics, the vehicle routing problem with simultaneous pickup and delivery (VRPSPD) has garnered attention in recent years due to its higher capacity-usage rate and transportation efficiency. This study proposes a novel dynamic multi-stage failure-specific cooperative (DMS-FSC) recourse strategy for solving the route failure which occurs in the VRPSPD. In the case of simultaneous transportation, the proposed DMS-FSC strategy allows a pair of cooperative vehicles to revisit each other’s customers with unmet demands by dividing the whole transportation route into multiple stages. An extended genetic algorithm with a new multi-stage paired vectors representation scheme is offered to more effectively deal with the proposed DMS-FSC strategy. It explores a more ideal a priori transportation plan for the VRPSPD by incorporating an acceptance criterion based on simulated annealing. Two sets of cases with middle and corner located depots are used to verify the proposed algorithm’s effectiveness in solving the presented problem. Furthermore, a comparison between the DMS-FSC strategy and the baseline strategy, which involves no cooperation, is also made to evaluate the cost savings generated from the proposed DMS-FSC strategy.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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
Fig. 7

Similar content being viewed by others

Explore related subjects

Discover the latest articles, news and stories from top researchers in related subjects.

References

  • Archetti C, Boland N, Speranza MG (2017) A matheuristic for the multivehicle inventory routing problem. Inf J Comp 29(3):377–387

    Article  MathSciNet  Google Scholar 

  • Berbeglia G, Gordeau JF, Gribkovskaia I, Laporte G (2007) Static pickup and delivery problems: a classification scheme and survey. Top 15(1):1–31

    Article  MathSciNet  Google Scholar 

  • Berbeglia G, Gordeau JF, Laporte G (2010) Dynamic pickup and delivery problems. Eur J Oper Res 202(1):8–15

    Article  Google Scholar 

  • Capelle T, Cortés CE, Gendreau M, Rey PA, Rousseau LM (2019) A column generation approach for location-routing problems with pickup and delivery. Eur J Oper Res 272(1):121–131

    Article  MathSciNet  Google Scholar 

  • Dai B, Chen H (2009) Mathematical model and solution approach for collaborative logistics in less than truckload (LTL) transportation. In: Proceedings of the International Conference on Computers and Industrial Engineering, June 6–9, Troyes, France, pp 767–772

  • Dayarian I, Crainic TG, Gendreau M, Rei W (2016) An adaptive large-neighborhood search heuristic for a multi-period vehicle routing problem. Transp Res Part E Logist Transp Revi 95:95–123

    Article  Google Scholar 

  • Dorigo M, Maniezzo V, Colorni A (1996) The ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Mans Cybern 1(26):29–41

    Article  Google Scholar 

  • Gen M, Cheng R (1997) Genetic algorithms and engineering design. Eng Econ 43(4):379–381

    Google Scholar 

  • Ghilas V, Cordeau JF, Demir E, Woensel TV (2018) Branch-and-price for the pickup and delivery problem with time windows and scheduled lines. Transp Sci 52(5):1035–1296

    Article  Google Scholar 

  • Haddad MN, Martinelli R, Vidal T, Martins S, Ochi LS, Souza MJF, Hartl R (2018) Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads. Eur J Oper Res 270(3):1014–1027

    Article  MathSciNet  Google Scholar 

  • Hernandez F, Gendreau M, Jabali O, Rei W (2018) A local branching matheuristic for the multi-vehicle routing problem with stochastic demands. J Heuristics 25:215–245

    Article  Google Scholar 

  • Ho W, Ho GTS, Ji P, Lau HCW (2008) A hybrid genetic algorithm for the multi-depot vehicle routing problem. Eng Appl Artif Intell 21(4):548–557

    Article  Google Scholar 

  • Lagos C, Guerrero G, Cabrera E, Moltedo-Perfetti A, Johnson F, Paredes F (2018) An improved particle swarm optimization algorithm for the VRP with simultaneous pickup and delivery and time windows. IEEE Latin Am Trans 16(6):1732–1740

    Article  Google Scholar 

  • Li Y, Chen HX, Prins C (2016) Adaptive large neighborhood search for the pickup and delivery problem with time windows, profits, and reserved requests. Eur J Oper Res 252(1):27–38

    Article  MathSciNet  Google Scholar 

  • Liu FG, Gui MK, Yi C, Lan YL (2019) A fast decomposition and reconstruction framework for the pickup and delivery problem with time windows and LIFO loading. IEEE Acc 7:71813–71826

    Article  Google Scholar 

  • Lu YL, Benlic U, Wu QH (2019) A population algorithm based on randomized tabu thresholding for the multi-commodity pickup-and-delivery traveling salesman problem. Comput Oper Res 101:285–297

    Article  MathSciNet  Google Scholar 

  • Ma YF, Li ZM, Yan F, Feng CY (2019) A hybrid priority-based genetic algorithm for simultaneous pickup and delivery problems in reverse logistics with time windows and multiple decision-makers. Soft Comput 23(15):6697–6714

    Article  Google Scholar 

  • Majidi S, Hosseini-Motlagh SM, Ignatius J (2018) Adaptive large neighborhood search heuristics for pollution-routing problem with simultaneous pickup and delivery. Soft Comput 22(9):2851–2865

    Article  Google Scholar 

  • Nagy G, Wassan NA, Speranza MG, Archetti C (2015) The vehicle routing problem with divisible deliveries and pickups. Transp Sci 49(2):271–294

    Article  Google Scholar 

  • Norouzi N, Sadegh-Amalanick M, Tavakkoli-Moghaddam R (2017) Modified particle swarm optimization in a time-dependent vehicle routing problem: minimizing fuel consumption. Optim Lett 11(1):121–134

    Article  MathSciNet  Google Scholar 

  • Ploat O, Kalayci CB, Kulak O, Günther HO (2015) A perturbation based variable neighborhood search heuristic for solving the vehicle routing problem with simultaneous pickup and delivery with time limit. Eur J Oper Res 242(2):369–382

    Article  MathSciNet  Google Scholar 

  • Pourrahmani E, Delavar MR, Mostafavi MA (2015) Optimization of an evacuation plan with uncertain demands using fuzzy credibility theory and genetic algorithm. Int J Disaster Risk Reduct 14:357–372

    Article  Google Scholar 

  • Sun P, Veelenturf LP, Hewitt M, Woensel TV (2018) The time-dependent pickup and delivery problem with time windows. Transp Res Part B Methodol 118:1–24

    Google Scholar 

  • Wang Y, Zhang J, Assogba K, Liu Y, Xu MZ, Wang YH (2018) Collaboration and transportation resource sharing in multiple centers vehicle routing optimization with delivery and pickup. Knowledge-Based Syst 160:296–310

    Article  Google Scholar 

  • Wu J, Zhang WY, Zhang S, Liu YN, Meng XH (2013) A matrix-based Bayesian approach for manufacturing resource allocation planning in supply chain management. Int J Product Res 51(5):1451–1463

    Article  Google Scholar 

  • Zhang ZZ, Cheang B, Li CS, Lim A (2019) Multi-commodity demand fulfillment via simultaneous pickup and delivery for a fast fashion retailer. Comput Oper Res 103:81–96

    Article  MathSciNet  Google Scholar 

  • Zhu L, Sheu JB (2018) Failure-specific cooperative recourse strategy for simultaneous pickup and delivery problem with stochastic demands. Eur J Oper Res 271:896–912

    Article  MathSciNet  Google Scholar 

  • Zulvia FE, Kuo RJ, Hu TL (2012) Solving CVRP with time window, fuzzy travel time and demand via a hybrid ant colony optimization and genetic algorithm. In: Proceedings of the EEE Congress on Evolutionary Computation, June 10–15, Brisbane, Australia, pp 1–8

Download references

Acknowledgements

The work has been supported by National Natural Science Foundation of China (No. 51875503, No. 51975512) and Zhejiang Natural Science Foundation of China (No. LZ20E050001).

Author information

Authors and Affiliations

  1. School of Information Management and Artificial Intelligence, Zhejiang University of Finance and Economics, Hangzhou, 310018, China

    Wenyu Zhang, Zixuan Chen, Shuai Zhang & Yishuai Cai

Authors
  1. Wenyu Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Zixuan Chen
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Shuai Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Yishuai Cai
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shuai Zhang.

Ethics declarations

Conflicts of interest

The authors declare that there is no conflict of interests regarding the publication of this article.

Ethical standard

The authors state that this research complies with ethical standards. This research does not involve either human participants or animals.

Additional information

Communicated by V. Loia.

Publisher's Note

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

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, W., Chen, Z., Zhang, S. et al. Dynamic multi-stage failure-specific cooperative recourse strategy for logistics with simultaneous pickup and delivery. Soft Comput 25, 3795–3812 (2021). https://doi.org/10.1007/s00500-020-05408-3

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-020-05408-3

Keywords

Search

Navigation