{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T12:07:35Z","timestamp":1768738055483,"version":"3.49.0"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2022,3,15]],"date-time":"2022-03-15T00:00:00Z","timestamp":1647302400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,3,15]],"date-time":"2022-03-15T00:00:00Z","timestamp":1647302400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Oper Res Int J"],"published-print":{"date-parts":[[2022,11]]},"DOI":"10.1007\/s12351-022-00701-5","type":"journal-article","created":{"date-parts":[[2022,3,15]],"date-time":"2022-03-15T14:05:24Z","timestamp":1647353124000},"page":"5107-5136","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Vehicle routing problem under safe separation distance for multiple unmanned aerial vehicle operation"],"prefix":"10.1007","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1185-4151","authenticated-orcid":false,"given":"Hyun Seop","family":"Uhm","sequence":"first","affiliation":[]},{"given":"Young Hoon","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,3,15]]},"reference":[{"issue":"3","key":"701_CR1","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.omega.2004.10.004","volume":"34","author":"T Bektas","year":"2006","unstructured":"Bektas T (2006) The multiple traveling salesman problem: an overview of formulations and solution procedures. Omega 34(3):209\u2013219","journal-title":"Omega"},{"issue":"1","key":"701_CR2","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s11750-007-0009-0","volume":"15","author":"G Berbeglia","year":"2007","unstructured":"Berbeglia G, Cordeau JF, Gribkovskaia I, Laporte G (2007) Static pickup and delivery problems: a classification scheme and survey. TOP 15(1):1\u201331","journal-title":"TOP"},{"issue":"2","key":"701_CR3","doi-asserted-by":"publisher","first-page":"458","DOI":"10.1111\/itor.12560","volume":"26","author":"L Calvet","year":"2019","unstructured":"Calvet L, Wang D, Juan A, Bov\u00e9 L (2019) Solving the multidepot vehicle routing problem with limited depot capacity and stochastic demands. Int Trans Oper Res 26(2):458\u2013484","journal-title":"Int Trans Oper Res"},{"issue":"1","key":"701_CR4","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/BF01589353","volume":"20","author":"N Christofides","year":"1981","unstructured":"Christofides N, Mingozzi A, Toth P (1981) Exact algorithms for the vehicle routing problem, based on spanning tree and shortest path relaxations. Math Program 20(1):255\u2013282","journal-title":"Math Program"},{"key":"701_CR5","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1016\/j.disopt.2014.03.001","volume":"12","author":"C Contardo","year":"2014","unstructured":"Contardo C, Martinelli R (2014) A new exact algorithm for the multi-depot vehicle routing problem under capacity and route length constraints. Discret Optim 12:129\u2013146","journal-title":"Discret Optim"},{"issue":"9","key":"701_CR6","doi-asserted-by":"publisher","first-page":"2033","DOI":"10.1016\/j.cor.2011.09.021","volume":"39","author":"JF Cordeau","year":"2012","unstructured":"Cordeau JF, Maischberger M (2012) A parallel iterated tabu search heuristic for vehicle routing problems. Comput Oper Res 39(9):2033\u20132050","journal-title":"Comput Oper Res"},{"issue":"2","key":"701_CR7","first-page":"105","volume":"30","author":"JF Cordeau","year":"1997","unstructured":"Cordeau JF, Gendreau M, Laporte G (1997) A tabu search heuristic for periodic and multi\u2010depot vehicle routing problems. Netw Int J 30(2):105\u2013119","journal-title":"Netw Int J"},{"issue":"2","key":"701_CR8","doi-asserted-by":"publisher","first-page":"756","DOI":"10.1016\/j.ejor.2005.08.015","volume":"176","author":"B Crevier","year":"2007","unstructured":"Crevier B, Cordeau JF, Laporte G (2007) The multi-depot vehicle routing problem with inter-depot routes. Eur J Oper Res 176(2):756\u2013773","journal-title":"Eur J Oper Res"},{"issue":"5","key":"701_CR9","doi-asserted-by":"publisher","first-page":"483","DOI":"10.1007\/s10732-014-9247-0","volume":"20","author":"JW Escobar","year":"2014","unstructured":"Escobar JW, Linfati R, Toth P, Baldoquin MG (2014) A hybrid granular tabu search algorithm for the multi-depot vehicle routing problem. J Heuristics 20(5):483\u2013509","journal-title":"J Heuristics"},{"issue":"10","key":"701_CR10","doi-asserted-by":"publisher","first-page":"1276","DOI":"10.1287\/mnsc.40.10.1276","volume":"40","author":"M Gendreau","year":"1994","unstructured":"Gendreau M, Hertz A, Laporte G (1994) A tabu search heuristic for the vehicle routing problem. Manag Sci 40(10):1276\u20131290","journal-title":"Manag Sci"},{"issue":"5","key":"701_CR11","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F Glover","year":"1986","unstructured":"Glover F (1986) Future paths for integer programming and links to artificial intelligence. Comput Oper Res 13(5):533\u2013549","journal-title":"Comput Oper Res"},{"issue":"5","key":"701_CR12","doi-asserted-by":"publisher","first-page":"235","DOI":"10.5772\/56286","volume":"10","author":"D Habib","year":"2013","unstructured":"Habib D, Jamal H, Khan SA (2013) Employing multiple unmanned aerial vehicles for co-operative path planning. Int J Adv Rob Syst 10(5):235","journal-title":"Int J Adv Rob Syst"},{"issue":"1","key":"701_CR13","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K Helsgaun","year":"2000","unstructured":"Helsgaun K (2000) An effective implementation of the Lin-Kernighan traveling salesman heuristic. Eur J Oper Res 126(1):106\u2013130","journal-title":"Eur J Oper Res"},{"key":"701_CR14","doi-asserted-by":"crossref","unstructured":"Jiang J, Ng KM (2011) Priority-based routing of unmanned combat aerial vehicles. In: 2011 Defense Science Research Conference and Expo, pp 1\u20134. IEEE","DOI":"10.1109\/DSR.2011.6026850"},{"issue":"3","key":"701_CR15","first-page":"66","volume":"4","author":"SN Kumar","year":"2012","unstructured":"Kumar SN, Panneerselvam R (2012) A survey on the vehicle routing problem and its variants. Intell Inf Manag 4(3):66\u201374","journal-title":"Intell Inf Manag"},{"issue":"2","key":"701_CR16","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin S, Kernighan BW (1973) An effective heuristic algorithm for the traveling-salesman problem. Oper Res 21(2):498\u2013516","journal-title":"Oper Res"},{"issue":"4","key":"701_CR17","doi-asserted-by":"publisher","first-page":"411","DOI":"10.1002\/net.21818","volume":"72","author":"A Otto","year":"2018","unstructured":"Otto A, Agatz N, Campbell J, Golden B, Pesch E (2018) Optimization approaches for civil applications of unmanned aerial vehicles (UAVs) or aerial drones: a survey. Networks 72(4):411\u2013458","journal-title":"Networks"},{"issue":"1","key":"701_CR18","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1109\/6979.994791","volume":"3","author":"L Pallottino","year":"2002","unstructured":"Pallottino L, Feron EM, Bicchi A (2002) Conflict resolution problems for air traffic management systems solved with mixed integer programming. IEEE Trans Intell Transp Syst 3(1):3\u201311","journal-title":"IEEE Trans Intell Transp Syst"},{"key":"701_CR19","doi-asserted-by":"crossref","unstructured":"Richards A, How JP (2002) Aircraft trajectory planning with collision avoidance using mixed integer linear programming. In: IEEE Proceedings of the 2002 American Control Conference 3:1936\u20131941","DOI":"10.1109\/ACC.2002.1023918"},{"issue":"4","key":"701_CR20","doi-asserted-by":"publisher","first-page":"755","DOI":"10.2514\/2.4943","volume":"25","author":"A Richards","year":"2002","unstructured":"Richards A, Schouwenaars T, How JP, Feron E (2002) Spacecraft trajectory planning with avoidance constraints using mixed-integer linear programming. J Guid Control Dyn 25(4):755\u2013764","journal-title":"J Guid Control Dyn"},{"issue":"3","key":"701_CR21","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1287\/trsc.1090.0272","volume":"43","author":"S Ropke","year":"2009","unstructured":"Ropke S, Cordeau JF (2009) Branch and cut and price for the pickup and delivery problem with time windows. Transp Sci 43(3):267\u2013286","journal-title":"Transp Sci"},{"issue":"2","key":"701_CR22","doi-asserted-by":"publisher","first-page":"835","DOI":"10.1111\/itor.12669","volume":"27","author":"MEH Sadati","year":"2020","unstructured":"Sadati MEH, Aksen D, Aras N (2020) The r-interdiction selective multi-depot vehicle routing problem. Int Trans Oper Res 27(2):835\u2013866","journal-title":"Int Trans Oper Res"},{"key":"701_CR23","doi-asserted-by":"crossref","unstructured":"Schouwenaars T, De Moor B, Feron E, How J (2001) Mixed integer programming for multi-vehicle path planning. In: 2001 European Controlled Conference (ECC), pp 2603\u20132608. IEEE","DOI":"10.23919\/ECC.2001.7076321"},{"issue":"4","key":"701_CR24","first-page":"1752","volume":"3","author":"N Sharma","year":"2015","unstructured":"Sharma N, Monika M (2015) A literature survey on multi-depot vehicle routing problem. Int J Res Dev 3(4):1752\u20131757","journal-title":"Int J Res Dev"},{"issue":"10","key":"701_CR25","doi-asserted-by":"publisher","first-page":"2519","DOI":"10.1016\/j.cor.2013.01.013","volume":"40","author":"A Subramanian","year":"2013","unstructured":"Subramanian A, Uchoa E, Ochi LS (2013) A hybrid algorithm for a class of vehicle routing problems. Comput Oper Res 40(10):2519\u20132531","journal-title":"Comput Oper Res"},{"issue":"8","key":"701_CR26","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1002\/net.3230230804","volume":"23","author":"\u00c9 Taillard","year":"1993","unstructured":"Taillard \u00c9 (1993) Parallel iterative search methods for vehicle routing problems. Networks 23(8):661\u2013673","journal-title":"Networks"},{"key":"701_CR27","doi-asserted-by":"crossref","unstructured":"Toth P, Vigo D (eds) (2002) The vehicle routing problem.\u00a0Society for Industrial and Applied\u00a0Mathematics","DOI":"10.1137\/1.9780898718515"}],"container-title":["Operational Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-022-00701-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s12351-022-00701-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s12351-022-00701-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,20]],"date-time":"2024-09-20T09:19:28Z","timestamp":1726823968000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s12351-022-00701-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,3,15]]},"references-count":27,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2022,11]]}},"alternative-id":["701"],"URL":"https:\/\/doi.org\/10.1007\/s12351-022-00701-5","relation":{},"ISSN":["1109-2858","1866-1505"],"issn-type":[{"value":"1109-2858","type":"print"},{"value":"1866-1505","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,3,15]]},"assertion":[{"value":"5 August 2020","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"16 February 2022","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"17 February 2022","order":3,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 March 2022","order":4,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}