Skip to main content
Log in

A mathematical method for solving multi-depot vehicle routing problem

  • Optimization
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

Because logistics companies usually have multiple depots to serve their many dispersed customers, multi-depot vehicle routing problem (MDVRP) has gained significant research attention. To solve an MDVRP model, this paper develops a hybrid ant colony optimization based on a polygonal circumcenter (BPC-HACO). Furthermore, because ACO has been found to fall easily into the local optimum, simulated annealing and three local optimization operations are introduced to encourage the ACO to improve the algorithm’s optimization ability. Finally, MDVRP benchmarks and data sets of other papers are employed to verify the effectiveness of the BPC-HACO in solving MDVRP (In 23 instances, BPC-HACO finds 14 BSKs, and 3 results are better than the BSKs), MDVRP with distance constraints (Compared to other papers, the route length is reduced by an average of 17.94%) and dynamic MDVRP (In 10 instances, BPC-HACO finds 3 BSKs, and 2 results are better than the BSKs). Finally, fitness landscape analysis has been applied to analyze the structural features of MDVRP to choose the most appropriate algorithm for MDVRP.

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

Access this article

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

Instant access to the full article PDF.

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10
Fig. 11
Fig. 12
Fig. 13
Fig. 14
Fig. 15
Fig. 16
Fig. 17
Fig. 18

Similar content being viewed by others

Data availability

The datasets used and/or analysed during the current study available from the corresponding author on reasonable request.

References

  • Asefi H, Shahparvari S, Chhetri P, Lim S (2019) Variable fleet size and mix VRP with fleet heterogeneity in integrated solid waste management. J Clean Prod 230:1376–1395

    Article  Google Scholar 

  • Azuero-Ortiz J, Gaviria-Hernández M, Jiménez-Rodríguez V, Vale-Santiago E, González-Neira E (2023) Design of a hybridization between Tabu search and PAES algorithms to solve a multi-depot, multi-product green vehicle routing problem. Decis Sci Lett 12(2):441–456

    Article  Google Scholar 

  • Bezerra SN, Souza SRD, Souza MJF (2018) A GVNS algorithm for solving the multi-depot vehicle routing problem. Electron Notes Discrete Math 66:167–174

    Article  MathSciNet  MATH  Google Scholar 

  • Bo Q, Cheng W, Khishe M (2023) Evolving chimp optimization algorithm by weighted opposition-based technique and greedy search for multimodal engineering problems. Appl Soft Comput 132:109869

    Article  Google Scholar 

  • Cai W, Wang Y, Yu B (2014) Improved ant colony algorithm for period vehicle routing problem. Oper Res Manag Sci 23(5):70–77

    Google Scholar 

  • Chen CM, Lv S, Ning J, Wu JMT (2023) A genetic algorithm for the waitable time-varying multi-depot green vehicle routing problem. Symmetry 15(1):124

    Article  Google Scholar 

  • Dokeroglu T, & Ozdemir YS (2023) A new robust Harris Hawk optimization algorithm for large quadratic assignment problems. Neural Comput Appl, 1–14.

  • Ge X, Jin Y, Zhang L (2023) Genetic-based algorithms for cash-in-transit multi depot vehicle routing problems: economic and environmental optimization. Environ Dev Sustain 25(1):557–586

    Article  Google Scholar 

  • Gu, Z., Zhu, Y., Wang, Y., Du, X., Guizani, M., & Tian, Z. (2022). Applying artificial bee colony algorithm to the multidepot vehicle routing problem. Software: Practice and Experience, 52(3), 756–771.

  • Hu H, Li X, Ha M, Wang X, Shang C, Shen Q (2023) Multi-depot vehicle routing programming for hazmat transportation with weight variation risk. Transportmetrica B Trans Dyn 11(1):1136–1160

    Article  Google Scholar 

  • Jana ND, Sil J, Das S (2017) Selection of appropriate metaheuristic algorithms for protein structure prediction in AB off-lattice model: a perspective from fitness landscape analysis. Inf Sci 391:28–64

    Article  Google Scholar 

  • Kim J, Manna A, Roy A, & Moon I (2023) Clustered vehicle routing problem for waste collection with smart operational management approaches. Int Transact Oper Res.

  • Kronmueller M, Fielbaum A, & Alonso-Mora J (2023) Pooled grocery delivery with tight deadlines from multiple depots. arXiv preprint arXiv:2303.11804.

  • Lavigne C, Inghels D, Dullaert W, Dewil R (2023) A memetic algorithm for solving rich waste collection problems. Eur J Oper Res 308(2):581–604

    Article  MathSciNet  MATH  Google Scholar 

  • Li Y, Soleimani H, Zohal M (2019) An improved ant colony optimization algorithm for the multi-depot green vehicle routing problem with multiple objectives. J Clean Prod 227:1161–1172

    Article  Google Scholar 

  • Ling H, Gu J (2017) Study on multi-depot open vehicle routing problem with soft time windows. Comput Eng Appl 53(14):232–239

    Google Scholar 

  • Londoñoa AA, Gonzaleza WG, Giraldob ODM, & Willmer J (2023) A new matheheuristic approach based on Chu-Beasley genetic approach for the multi-depot electric vehicle routing problem. Int J Ind Eng Comput, 14 (2023).

  • Luo HB (2014) Study on multi-depots and multi-vehicles vehicle scheduling problem based on improved particle swarm optimization. Comput Eng Appl 50(7):251–253

    Google Scholar 

  • Ma Y, Yao T, Zhang F (2014) Multi-depot multi-type vehicle scheduling problem and its genitic algorithm. Math Pract Theory 2:107–114

    Google Scholar 

  • Manullang MJC, Priandana K, & Hardhienata MKD (2023) Optimum trajectory of multi-UAV for fertilization of paddy fields using ant colony optimization (ACO) and 2-opt algorithms. In AIP conference proceedings (Vol. 2482, No. 1, p. 020004). AIP Publishing LLC.

  • Nia AR, Awasthi A, & Bhuiyan N (2023). Integrate exergy costs and carbon reduction policy in order to optimize the sustainability development of coal supply chains in uncertain conditions. Int J Prod Econ, 108772.

  • Ren T, Luo T, Jia B, Yang B, Wang L, Xing L (2023) Improved ant colony optimization for the vehicle routing problem with split pickup and split delivery. Swarm Evol Comput 77:101228

    Article  Google Scholar 

  • Rodríguez-Maya NE, Flores JJ, Verel S, & Graff M (2023). Models to classify the difficulty of genetic algorithms to solve continuous optimization problems. Natl Comput, 1–21.

  • Sadati MEH, Aksen D, & Aras N (2020) A Trilevel r-Interdiction selective multi-depot vehicle routing problem with depot protection. Comput Oper Res, 104996.

  • Soeanu A, Ray S, Berger J, Boukhtouta A, Debbabi M (2020) Multi-depot vehicle routing problem with risk mitigation: model and solution algorithm. Expert Syst Appl 145:113099

    Article  Google Scholar 

  • Torres-Pérez I, Rosete A, Sosa-Gómez G, Rojas O (2022) New heuristics for assigning in the multi-depot vehicle routing problem. IFAC-PapersOnLine 55(10):2228–2233

    Article  Google Scholar 

  • Vincent FY, Aloina G, Jodiawan P, Gunawan A, Huang TC (2023) The vehicle routing problem with simultaneous pickup and delivery and occasional drivers. Expert Syst Appl 214:119118

    Article  Google Scholar 

  • Wang Z, Wu Y (2023) An ant colony optimization-simulated annealing algorithm for solving a multiload AGVs workshop scheduling problem with limited buffer capacity. Processes 11(3):861

    Article  Google Scholar 

  • Wang C, Guo C, Zuo X (2021) Solving multi-depot electric vehicle scheduling problem by column generation and genetic algorithm. Appl Soft Comput 112:107774

    Article  Google Scholar 

  • Wang S, Han C, Yu Y, Huang M, Sun W, Kaku I (2022) Reducing carbon emissions for the vehicle routing problem by utilizing multiple depots. Sustainability 14(3):1264

    Article  Google Scholar 

  • Wang Y, Wei Y, Wang X, Wang Z, Wang H (2023) A clustering-based extended genetic algorithm for the multidepot vehicle routing problem with time windows and three-dimensional loading constraints. Appl Soft Comput 133:109922

    Article  Google Scholar 

  • Wang T, Wu K (2012) Study on multi-depot vehicle routing problem with time windows based on particle swarm optimization. Jisuanji Gongcheng Yu Yingyong (comput Eng Appl) 48(27):27–30

    Google Scholar 

  • Wu D, Li J, Cui J, Hu D (2023) Research on the time-dependent vehicle routing problem for fresh agricultural products based on customer value. Agriculture 13(3):681

    Article  Google Scholar 

  • Wu H, & Gao Y (2023) An ant colony optimization based on local search for the vehicle routing problem with simultaneous pickup-delivery and time window. Appl Soft Comput, 110203.

  • Xu H, Pu P, & Duan F (2018) A hybrid ant colony optimization for dynamic multidepot vehicle routing problem. Discrete Dynam Nat Soc, 2018.

  • Xue S (2023) An adaptive ant colony algorithm for crowdsourcing multi-depot vehicle routing problem with time windows. Sustain Oper Comput.

  • Yan K, Li A, Guo J, Chen B (2017) Research on multi-depot vehicle routing problem based on time window. Geospatial Inform 5:11

    Google Scholar 

  • Yao B, Chen C, Song X, Yang X (2019) Fresh seafood delivery routing problem using an improved ant colony optimization. Ann Oper Res 273(1–2):163–186

    Article  MathSciNet  MATH  Google Scholar 

  • Yu B, Yang ZZ, Xie JX (2011) A parallel improved ant colony optimization for multi-depot vehicle routing problem. J Oper Res Soc 62(1):183–188

    Article  Google Scholar 

  • Yu B, Ma N, Cai W, Li T, Yuan X, Yao B (2013) Improved ant colony optimization for the dynamic multi-depot vehicle routing problem. Int J Log Res Appl 16(2):144–157

    Article  Google Scholar 

  • Yuan, X., Zhang, Q., Liu, H., & Wu, L. (2020). Solving MDVRP with grey delivery time based on improved quantum evolutionary algorithm. J Grey Syst, 32(3).

  • Yücenur GN, Demirel NÇ (2011) A new geometric shape-based genetic clustering algorithm for the multi-depot vehicle routing problem. Expert Syst Appl 38(9):11859–11865

    Article  Google Scholar 

  • Zhang W, Gajpal Y, Appadoo SS, Wei Q (2020) Multi-depot green vehicle routing problem to minimize carbon emissions. Sustainability 12(8):3500

    Article  Google Scholar 

  • Zhang J, Tang JF, Pan ZD (2009) A scatter search algorithm for multi-depot vehicle routing problem. Syst Eng 27(6):83

    Google Scholar 

  • Zheng YJ, Chen X, Yan HF, & Zhang MX (2023). Evolutionary algorithm for vehicle routing for shared e-bicycle battery replacement and recycling. Appl Soft Comput, 110023.

  • Zhou X, Song J, Wu S, Wang M (2023) Artificial bee colony algorithm based on online fitness landscape analysis. Inf Sci 619:603–629

    Article  Google Scholar 

Download references

Acknowledgements

National Natural Science Foundation of China [Grant No. 72074198, 71874165, 71573237]; the National Social Science Fund of China [Grant No. 21AZD074]; Young Talents Foundation of The Central Propaganda Department [Grant No. 2020084007]; the Research Foundation of Philosophy and Social sciences of Ministry of Education of China [Grant No. 20JHQ094]; Soft science research project of technological innovation in Hubei Province [Grant No. 2019ADC154]; Young Talents Foundation of The Central Propaganda Department; Hubei Provincial Natural Science Foundation of China [Grant No. 2020CFB822].

Funding

National Natural Science Foundation of China [grant numbers 72074198, 71874165, 71573237]; the National Social Science Fund of China [grant numbers 21AZD074]; Young Talents Foundation of The Central Propaganda Department [grant number 2020084007].

Author information

Authors and Affiliations

Authors

Contributions

WF contributed to conceptualization, methodology, software, visualization, investigation, and writing—original draft. GH was involved in funding acquisition, project administration, writing—review and editing, supervision, and data curation. PW contributed to data curation, writing—review and editing, supervision, and validation. HJ and CS were involved in writing—review and editing and supervision.

Corresponding author

Correspondence to Fang wan.

Ethics declarations

Conflict of interest

The authors declare that they have no known competing financial interests or personal relationships that could have appeared to influence the work reported in this paper. The authors declare the following financial interests/personal relationships which may be considered as potential competing interests:

Ethical approval

No conflict of interest exists in submitting this manuscript, and all authors approve the manuscript for publication.

Informed consent

On behalf of my co-authors, I would like to declare that the work described was original research that has not been published previously and is not under consideration for publication elsewhere, in whole or in part.

Additional information

Publisher's Note

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

Rights and permissions

Springer Nature or its licensor (e.g. a society or other partner) holds exclusive rights to this article under a publishing agreement with the author(s) or other rightsholder(s); author self-archiving of the accepted manuscript version of this article is solely governed by the terms of such publishing agreement and applicable law.

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

wan, F., Guo, H., Pan, W. et al. A mathematical method for solving multi-depot vehicle routing problem. Soft Comput 27, 15699–15717 (2023). https://doi.org/10.1007/s00500-023-08811-8

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-023-08811-8

Keywords

Navigation