{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,23]],"date-time":"2026-01-23T11:46:25Z","timestamp":1769168785502,"version":"3.49.0"},"reference-count":39,"publisher":"MDPI AG","issue":"5","license":[{"start":{"date-parts":[[2018,5,18]],"date-time":"2018-05-18T00:00:00Z","timestamp":1526601600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithms"],"abstract":"<jats:p>This article deals with the modified Multi-Depot Vehicle Routing Problem (MDVRP). The modification consists of altering the optimization criterion. The optimization criterion of the standard MDVRP is to minimize the total sum of routes of all vehicles, whereas the criterion of modified MDVRP (M-MDVRP) is to minimize the longest route of all vehicles, i.e., the time to conduct the routing operation is as short as possible. For this problem, a metaheuristic algorithm\u2014based on the Ant Colony Optimization (ACO) theory and developed by the author for solving the classic MDVRP instances\u2014has been modified and adapted for M-MDVRP. In this article, an additional deterministic optimization process which further enhances the original ACO algorithm has been proposed. For evaluation of results, Cordeau\u2019s benchmark instances are used.<\/jats:p>","DOI":"10.3390\/a11050074","type":"journal-article","created":{"date-parts":[[2018,5,21]],"date-time":"2018-05-21T04:07:30Z","timestamp":1526875650000},"page":"74","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["Using Metaheuristics on the Multi-Depot Vehicle Routing Problem with Modified Optimization Criterion"],"prefix":"10.3390","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2251-8711","authenticated-orcid":false,"given":"Petr","family":"Stodola","sequence":"first","affiliation":[{"name":"Department of Tactics, University of Defence, 66210 Brno, Czech Republic"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2018,5,18]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","article-title":"The truck dispatching problem","volume":"6","author":"Dantzig","year":"1959","journal-title":"Manag. Sci."},{"key":"ref_2","first-page":"31","article-title":"Solving min-max multi-depot vehicle routing problem","volume":"55","author":"Carlsson","year":"2009","journal-title":"Lect. Glob. Optim."},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1016\/j.swevo.2013.05.005","article-title":"An ant colony optimization technique for solving min\u2013max multi-depot vehicle routing problem","volume":"13","author":"Narasimha","year":"2013","journal-title":"Swarm Evolut. Comput."},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1016\/j.engappai.2007.06.001","article-title":"A hybrid genetic algorithm for the multi-depot vehicle routing problem","volume":"21","author":"Ho","year":"2008","journal-title":"Eng. Appl. Artif. Intell."},{"key":"ref_5","first-page":"1752","article-title":"Literature Survey on Multi-Depot Vehicle Routing Problem","volume":"3","author":"Sharma","year":"2015","journal-title":"Int. J. Res. Dev."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1016\/j.cie.2014.10.029","article-title":"A literature review of the vehicle routing problem with multiple depots","volume":"79","author":"Franco","year":"2015","journal-title":"Comput. Ind. Eng."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1016\/j.cie.2015.12.007","article-title":"The vehicle routing problem: State of the art classification and review","volume":"99","author":"Braekers","year":"2016","journal-title":"Comput. Ind. Eng."},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"711","DOI":"10.1016\/0305-0483(76)90097-9","article-title":"Multi-terminal vehicle-dispatch algorithm","volume":"4","author":"Gillett","year":"1976","journal-title":"Omega"},{"key":"ref_9","first-page":"371","article-title":"A new heuristic for the multi-depot vehicle routing problem that improves upon best-known solutions","volume":"13","author":"Chao","year":"1993","journal-title":"Am. J. Math. Manag. Sci."},{"key":"ref_10","doi-asserted-by":"crossref","first-page":"229","DOI":"10.1016\/0305-0548(95)O0026-P","article-title":"A tabu search heuristic for the multi-depot vehicle routing problem","volume":"23","author":"Renaud","year":"1996","journal-title":"Comput. Oper. Res."},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1007\/s10732-014-9247-0","article-title":"A hybrid Granular Tabu Search algorithm for the Multi-Depot Vehicle Routing Problem","volume":"20","author":"Escobar","year":"2014","journal-title":"J. Heuristics"},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1016\/j.cie.2017.03.022","article-title":"Multiple neighborhood search, tabu search and ejection chains for the multi-depot open vehicle routing problem","volume":"107","author":"Soto","year":"2017","journal-title":"Comput. Ind. Eng."},{"key":"ref_13","doi-asserted-by":"crossref","first-page":"1393","DOI":"10.1016\/S0305-0548(01)00038-7","article-title":"Heuristic solutions to multi-depot location routing problems","volume":"29","author":"Wu","year":"2002","journal-title":"Comput. Oper. Res."},{"key":"ref_14","first-page":"282","article-title":"A fast and effective insertion algorithm for multi-depot vehicle routing problem and a new simulated annealing approach","volume":"Volume 4031","author":"Lim","year":"2006","journal-title":"Advances in Artificial Intelligence, Lecture Notes in Computer Science"},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/978-3-540-85152-3_4","article-title":"Using Genetic Algorithms for Multi-depot Vehicle Routing","volume":"Volume 161","author":"Hanshar","year":"2009","journal-title":"Bio-Inspired Algorithms for the Vehicle Routing Problem"},{"key":"ref_16","first-page":"333","article-title":"An efficient hybrid of genetic and simulated annealing algorithms for multi server vehicle routing problem with multi entry","volume":"24","author":"Seidgar","year":"2016","journal-title":"Int. J. Ind. Syst. Eng."},{"key":"ref_17","doi-asserted-by":"crossref","first-page":"519","DOI":"10.1016\/j.asoc.2014.11.005","article-title":"A survey of genetic algorithms for solving multi-depot vehicle routing problem","volume":"27","author":"Karakatic","year":"2015","journal-title":"Appl. Soft Comput."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1057\/jors.2009.161","article-title":"A parallel improved ant colony optimization for multi-depot vehicle routing problem","volume":"62","author":"Yu","year":"2010","journal-title":"J. Oper. Res. Soc."},{"key":"ref_19","first-page":"1","article-title":"Improved Ant Colony Optimization for Seafood Product Delivery Routing Problem","volume":"26","author":"Yao","year":"2014","journal-title":"Promet-Traffic Transp."},{"key":"ref_20","first-page":"385","article-title":"An Improved Ant Colony Optimization for Multi-Depot Vehicle Routing Problem. International","volume":"8","author":"Tang","year":"2016","journal-title":"J. Eng. Technol."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1177\/1687814016665297","article-title":"Automobile chain maintenance parts delivery problem using an improved ant colony algorithm","volume":"8","author":"Gao","year":"2016","journal-title":"Adv. Mech. Eng."},{"key":"ref_22","doi-asserted-by":"crossref","unstructured":"Ma, Y., Han, J., Kang, K., and Yan, F. (2017). An Improved ACO for the Multi-depot Vehicle Routing Problem with Time Windows. Proceedings of the Tenth International Conference on Management Science and Engineering Management, Springer. Advances in Intelligent Systems and Computing.","DOI":"10.1007\/978-981-10-1837-4_96"},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"85","DOI":"10.3141\/2089-11","article-title":"Combination of multiple ant colony system and simulated annealing for the multi-depot vehicle routing problem with time windows","volume":"2089","author":"Ting","year":"2008","journal-title":"Transp. Res. Rec. J. Transp. Res. Board"},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1287\/opre.1120.1048","article-title":"A Hybrid Genetic Algorithm for Multi-Depot and Periodic Vehicle Routing Problems","volume":"60","author":"Vidal","year":"2012","journal-title":"Oper. Res."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"117","DOI":"10.1016\/j.eswa.2015.08.030","article-title":"A cooperative coevolutionary algorithm for the Multi-Depot Vehicle Routing Problem","volume":"43","author":"Enayatifar","year":"2016","journal-title":"Expert Syst. Appl."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"1430","DOI":"10.1057\/jors.2014.108","article-title":"The min-max multi-depot vehicle routing problem: Heuristics and computational results","volume":"66","author":"Wang","year":"2015","journal-title":"J. Oper. Res. Soc."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"110","DOI":"10.1016\/j.cor.2016.01.008","article-title":"The min\u2013max split delivery multi-depot vehicle routing problem with minimum service time requirement","volume":"71","author":"Wang","year":"2016","journal-title":"Comput. Oper. Res."},{"key":"ref_28","unstructured":"Benning, L. (2018, May 10). Why Is the Traveling Salesman Problem NP Complete? Quora.com. Available online: https:\/\/www.quora.com\/Why-is-the-traveling-salesman-problem-NP-complete."},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G","article-title":"A tabu search heuristic for periodic and multi-depot vehicle routing problems","volume":"30","author":"Cordeau","year":"1997","journal-title":"Networks"},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"2033","DOI":"10.1016\/j.cor.2011.09.021","article-title":"A parallel iterated tabu search heuristic for vehicle routing problems","volume":"39","author":"Cordeau","year":"2012","journal-title":"Comput. Oper. Res."},{"key":"ref_31","unstructured":"NEO Web, Networking and Emerging Optimization (2018, February 19). University of Malaga, Spain. Available online: http:\/\/neo.lcc.uma.es\/vrp\/vrp-instances\/multiple-depot-vrp-instances\/."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"228","DOI":"10.1504\/IJBIC.2016.10000256","article-title":"Applying the Ant Colony Optimisation Algorithm to the Capacitated Multi-Depot Vehicle Routing Problem","volume":"8","author":"Stodola","year":"2016","journal-title":"Int. J. Bio-Inspir. Comput."},{"key":"ref_33","doi-asserted-by":"crossref","unstructured":"Stodola, P., and Mazal, J. (2016). Tactical Decision Support System to Aid Commanders in their Decision-Making. Modelling and Simulation for Autonomous Systems, Springer.","DOI":"10.1007\/978-3-319-47605-6_32"},{"key":"ref_34","first-page":"48","article-title":"Application support for topographical-geodetic issues for tactical and technical control of artillery fire","volume":"12","author":"Blaha","year":"2018","journal-title":"Int. J. Circuits Syst. Signal Proc."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1007\/978-3-319-65960-2_83","article-title":"Standards to support military autonomous system life cycle","volume":"Volume 644","author":"Hodicky","year":"2018","journal-title":"Advances in Intelligent Systems and Computing"},{"key":"ref_36","unstructured":"Rybansky, M. (June, January 31). Trafficability analysis through vegetation. Proceedings of the International Conference on Military Technologies, Brno, Czech Republic."},{"key":"ref_37","first-page":"24","article-title":"Analysis Results of the Military Observer Training System","volume":"2016","author":"Drozd","year":"2016","journal-title":"Econ. Manag."},{"key":"ref_38","unstructured":"Farlik, J., Casar, J., and Stary, V. (June, January 31). Simplification of missile effective coverage zone in air defence simulations. Proceedings of the International Conference on Military Technologies, Brno, Czech Republic."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.measurement.2017.08.030","article-title":"Non-parametric estimates of the first hitting time of Li-ion battery","volume":"113","author":"Hasilova","year":"2018","journal-title":"Measurement"}],"container-title":["Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1999-4893\/11\/5\/74\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T15:04:56Z","timestamp":1760195096000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1999-4893\/11\/5\/74"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,18]]},"references-count":39,"journal-issue":{"issue":"5","published-online":{"date-parts":[[2018,5]]}},"alternative-id":["a11050074"],"URL":"https:\/\/doi.org\/10.3390\/a11050074","relation":{},"ISSN":["1999-4893"],"issn-type":[{"value":"1999-4893","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,5,18]]}}}