{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T06:08:18Z","timestamp":1774937298406,"version":"3.50.1"},"reference-count":44,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2020,10,6]],"date-time":"2020-10-06T00:00:00Z","timestamp":1601942400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,10,6]],"date-time":"2020-10-06T00:00:00Z","timestamp":1601942400000},"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":["Soft Comput"],"published-print":{"date-parts":[[2021,2]]},"DOI":"10.1007\/s00500-020-05350-4","type":"journal-article","created":{"date-parts":[[2020,10,6]],"date-time":"2020-10-06T23:05:08Z","timestamp":1602025508000},"page":"2935-2948","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":30,"title":["A multiple ant colony system with random variable neighborhood descent for the dynamic vehicle routing problem with time windows"],"prefix":"10.1007","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0743-8024","authenticated-orcid":false,"given":"Orivalde Soares","family":"da Silva J\u00fanior","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 Eug\u00eanio","family":"Leal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marc","family":"Reimann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,10,6]]},"reference":[{"key":"5350_CR2","doi-asserted-by":"publisher","first-page":"1766","DOI":"10.1016\/j.cor.2013.01.022","volume":"40","author":"B Barkaoui","year":"2013","unstructured":"Barkaoui B, Gendreau M (2013) An adaptive evolutionary approach for real-time vehicle routing and dispatching. Comput Oper Res 40:1766\u20131776","journal-title":"Comput Oper Res"},{"issue":"1","key":"5350_CR3","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1287\/trsc.1050.0133","volume":"40","author":"Z Chen","year":"2006","unstructured":"Chen Z, Xu H (2006) Dynamic column generation for dynamic vehicle routing with time windows. Transp Sci 40(1):74\u201388","journal-title":"Transp Sci"},{"key":"5350_CR5","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"G Croes","year":"1958","unstructured":"Croes G (1958) A method for solving traveling salesman problems. Oper Res 6:791\u2013812","journal-title":"Oper Res"},{"key":"5350_CR6","unstructured":"Gambardella L, Taillard \u00c9, Agazzi G (1999) MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows. New Ideas in Optimization. Londres, McGraw-Hill, pp 63\u201376"},{"key":"5350_CR7","unstructured":"Gambardella L, Rizzoli A, Oliverio F, Casagrande N, Donati A, Montemanni R, Lucibello E (2003) Ant colony optimization for vehicle routing in advanced logistics systems. In: International workshop on modelling and applied simulation, MAS 2003, Sl, pp 3\u20139"},{"issue":"4","key":"5350_CR8","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1287\/trsc.33.4.381","volume":"33","author":"M Gendreau","year":"1999","unstructured":"Gendreau M, Guertin F, Potvin J, Taillard E (1999) Parallel tabu search for real-time vehicle routing and dispatching. Transp Sci 33(4):381\u2013390","journal-title":"Transp Sci"},{"key":"5350_CR9","doi-asserted-by":"crossref","unstructured":"Guntsch M, Middendorf M (2001) Pheromone modification strategies for ant algorithms applied to dynamic TSP. In: Proceedings of EcoWorkshops on applications of evolutionary computing, vol 2037, Lecture Notes in Computer Science, pp 213\u2013222","DOI":"10.1007\/3-540-45365-2_22"},{"issue":"2","key":"5350_CR10","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.cor.2011.03.006","volume":"39","author":"L Hong","year":"2012","unstructured":"Hong L (2012) An improved LNS algorithm for real-time vehicle routing problem with time windows. Comput Oper Res 39(2):151\u2013163","journal-title":"Comput Oper Res"},{"issue":"4","key":"5350_CR11","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1287\/trsc.34.4.426.12325","volume":"34","author":"S Ichoua","year":"2000","unstructured":"Ichoua S, Gendreau M, Potvin J (2000) Diversion issues in real-time vehicle dispatching. Transp Sci 34(4):426\u2013438","journal-title":"Transp Sci"},{"key":"5350_CR13","volume-title":"Dynamic VRPs: a study of scenarios","author":"P Kilby","year":"1998","unstructured":"Kilby P, Prosser P, Shaw P (1998) Dynamic VRPs: a study of scenarios. Strathclyde, UK"},{"key":"5350_CR14","volume-title":"Dynamische Tourenplanung mit ausgew\u00e4hlten Metaheuristiken, 47","author":"A Lackner","year":"2004","unstructured":"Lackner A (2004) Dynamische Tourenplanung mit ausgew\u00e4hlten Metaheuristiken, 47. G\u00f6ttinger Wirtschaftsinformatik, Cuvillier"},{"key":"5350_CR15","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1002\/net.3230110211","volume":"11","author":"J Lenstra","year":"1981","unstructured":"Lenstra J, Rinnooy Kan A (1981) Complexity of vehicle routing and scheduling problems. Networks 11:221\u2013227","journal-title":"Networks"},{"key":"5350_CR16","doi-asserted-by":"publisher","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S Lin","year":"1965","unstructured":"Lin S (1965) Computer solutions of the traveling salesman problem. Bell Syst Tech J 44:2245\u20132269","journal-title":"Bell Syst Tech J"},{"key":"5350_CR17","volume-title":"Vehicle routing problems with varying degrees of dynamism","author":"K Lund","year":"1996","unstructured":"Lund K (1996) Vehicle routing problems with varying degrees of dynamism. Lyngby, Denmark"},{"issue":"11","key":"5350_CR18","doi-asserted-by":"publisher","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovic","year":"1997","unstructured":"Mladenovic N, Hansen P (1997) Variable Neighborhood Search. Comput Oper Res 24(11):1097\u20131100","journal-title":"Comput Oper Res"},{"key":"5350_CR19","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10878-005-4922-6","volume":"10","author":"R Montemanni","year":"2005","unstructured":"Montemanni R, Gambardella LM, Rizzoli AE, Donati AV (2005) Ant colony system for a dynamic vehicle routing problem. J Comb Optim 10:327\u2013343","journal-title":"J Comb Optim"},{"key":"5350_CR20","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.ejor.2002.11.003","volume":"162","author":"G Nagy","year":"2005","unstructured":"Nagy G, Salhi S (2005) Heuristic algorithms for single and multiple depot vehicle routing problems with pickups and deliveries. Eur J Oper Res 162:126\u2013141","journal-title":"Eur J Oper Res"},{"key":"5350_CR21","unstructured":"Oliveira S (2009) A study of pheromone modification strategies for using ACO on the dynamic vehicle routing problem. Doctoral symposium on engineering stochastic local search algorithms, SLS-DS\u201909, Brussels, Belgium, pp 6\u201310"},{"key":"5350_CR22","unstructured":"Or I (1976) Traveling salesman-type combinatorial problems and their relation to the logistics of regional blood banking. Ph.D. Thesis, Department of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL"},{"issue":"1\u20134","key":"5350_CR23","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/BF02023004","volume":"41","author":"I Osman","year":"1993","unstructured":"Osman I (1993) Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann Oper Res 41(1\u20134):421\u2013451","journal-title":"Ann Oper Res"},{"key":"5350_CR24","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/j.trb.2019.08.004","volume":"128","author":"G Ozbaygin","year":"2019","unstructured":"Ozbaygin G, Savelsbergh M (2019) An iterative re-optimization framework for the dynamic vehicle routing problem with roaming delivery locations. Transp Res Part B Methodol 128:207\u2013235","journal-title":"Transp Res Part B Methodol"},{"key":"5350_CR25","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/j.trb.2017.02.003","volume":"100","author":"G Ozbaygin","year":"2017","unstructured":"Ozbaygin G, Karasan OE, Savelsbergh M, Yaman H (2017) A branch-and-price algorithm for the vehicle routing problem with roaming delivery locations. Transp Res Part B Methodol 100:115\u2013137","journal-title":"Transp Res Part B Methodol"},{"key":"5350_CR26","first-page":"1","volume-title":"A fast re-optimization approach for dynamic vehicle routing","author":"V Pillac","year":"2012","unstructured":"Pillac V, Gu\u00e9ret C, Medaglia A (2012) A fast re-optimization approach for dynamic vehicle routing. \u00c9cole des Mines de Nantes, Nantes, pp 1\u201322"},{"issue":"1","key":"5350_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2012.08.015","volume":"225","author":"V Pillac","year":"2013","unstructured":"Pillac V, Gendreau M, Gu\u00e9ret C, Medaglia A (2013) A review of dynamic vehicle routing problems. Eur J Oper Res 225(1):1\u201311","journal-title":"Eur J Oper Res"},{"key":"5350_CR28","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1287\/trsc.14.2.130","volume":"14","author":"H Psaraftis","year":"1980","unstructured":"Psaraftis H (1980) A dynamic programming solution to the single-vehicle many-to-many immediate request dial-a-ride problem. Transp Sci 14:130\u2013154","journal-title":"Transp Sci"},{"key":"5350_CR29","first-page":"223","volume-title":"Vehicle routing: methods and studies","author":"H Psaraftis","year":"1988","unstructured":"Psaraftis H (1988) Dynamic vehicle routing problems. In: Assad B (ed) Vehicle routing: methods and studies. Elsevier, Holland, pp 223\u2013248"},{"key":"5350_CR30","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BF02098286","volume":"61","author":"H Psaraftis","year":"1995","unstructured":"Psaraftis H (1995) Dynamic vehicle routing: Status and prospects. Ann Oper Res 61:143\u2013164","journal-title":"Ann Oper Res"},{"key":"5350_CR31","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1080\/00207543.2015.1043403","volume":"54","author":"U Ritzinger","year":"2016","unstructured":"Ritzinger U, Puchinger G, Hartl RF (2016) A survey on dynamic and stochastic vehicle routing problems. Int J Prod Res 54:1\u201319","journal-title":"Int J Prod Res"},{"key":"5350_CR32","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1007\/s11721-007-0005-x","volume":"1","author":"A Rizzoli","year":"2007","unstructured":"Rizzoli A, Montemanni R, Lucibello E, Gambardella L (2007) Ant colony optimization for real-world vehicle routing problems. Swarm Intell 1:135\u2013151","journal-title":"Swarm Intell"},{"key":"5350_CR33","volume-title":"Exact Algorithms for Different Classes of Vehicle Routing Problems","author":"R Roberti","year":"2012","unstructured":"Roberti R (2012) Exact Algorithms for Different Classes of Vehicle Routing Problems. Alma Mater Studiorum-University of Bologna, Bologna"},{"key":"5350_CR34","unstructured":"Ropke S (2013) Branching decisions in branch-and-cut-and-price algorithms for vehicle routing problems. DTU Transport, Dispon\u00edvel em: http:\/\/www.gerad.ca\/colloques\/ColumnGeneration2012\/presentations\/session7\/Ropke.pdf, Acesso em 10 de julho de 2013"},{"issue":"3","key":"5350_CR35","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1016\/j.ejor.2015.04.009","volume":"245","author":"M Schyns","year":"2015","unstructured":"Schyns M (2015) An ant colony system for responsive dynamic vehicle routing. Eur J Oper Res 245(3):704\u2013718","journal-title":"Eur J Oper Res"},{"key":"5350_CR36","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/3-540-49481-2_30","volume-title":"Principles and practice of constraint programming, CP98, Lecture Notes in Computer Science","author":"P Shaw","year":"1998","unstructured":"Shaw P (1998) Using constraint programming and local search methods to solve vehicle routing problems. In: Maher M (ed) Principles and practice of constraint programming, CP98, Lecture Notes in Computer Science. Springer, New York, pp 417\u2013431"},{"key":"5350_CR37","volume-title":"Roteiriza\u00e7\u00e3o din\u00e2mica de ve\u00edculos com janelas de tempo usando de um algoritmo de col\u00f4nia de formigas. Congresso de Pesquisa e Ensino em Transportes","author":"O Silva J\u00fanior","year":"2009","unstructured":"Silva J\u00fanior O, Leal J (2009) Roteiriza\u00e7\u00e3o din\u00e2mica de ve\u00edculos com janelas de tempo usando de um algoritmo de col\u00f4nia de formigas. Congresso de Pesquisa e Ensino em Transportes. Anais do XXIII ANPET, Vit\u00f3ria, ES"},{"key":"5350_CR38","unstructured":"Silva J\u00fanior OS, Leal JE (2013) Algorithms for the static and dynamic vehicle routing problem with time windows. Doctoral Thesis, Departamento de Engenharia Industrial, Pontif\u00edcia Universidade Cat\u00f3lica do Rio de Janeiro, Rio de Janeiro"},{"key":"5350_CR39","doi-asserted-by":"crossref","unstructured":"Silva J\u00fanior OS, Leal JE (2020, in press) A multiple ant colony system with random variable neighborhood descent for the vehicle routing problem with time windows. Int J Syst Manag","DOI":"10.1007\/s00500-020-05350-4"},{"issue":"2","key":"5350_CR40","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"M Solomon","year":"1987","unstructured":"Solomon M (1987) Algorithms for the vehicle routing and scheduling problems with time windows constraints. Oper Res 35(2):254\u2013265","journal-title":"Oper Res"},{"key":"5350_CR41","volume-title":"Heuristic, Exact and Hybrid Approaches for Vehicle Routing Problem","author":"A Subramanian","year":"2012","unstructured":"Subramanian A (2012) Heuristic, Exact and Hybrid Approaches for Vehicle Routing Problem. Tese de Doutorado, Universidade Federal Fluminense, Niter\u00f3i"},{"issue":"2","key":"5350_CR42","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1287\/trsc.31.2.170","volume":"31","author":"E Taillard","year":"1997","unstructured":"Taillard E, Badeau P, Gendreau M, Guertin F, Potvin J (1997) A tabu search heuristic for the vehicle routing problem with soft time windows. Transp Sci 31(2):170\u2013186","journal-title":"Transp Sci"},{"issue":"1","key":"5350_CR43","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(00)00268-X","volume":"135","author":"E Taillard","year":"2001","unstructured":"Taillard E, Gambardella L, Gendreau M, Potvin J (2001) Adaptive memory programming: a unified view of metaheuristics. Eur J Oper Res 135(1):1\u201316","journal-title":"Eur J Oper Res"},{"key":"5350_CR44","unstructured":"Thangiah S, Osman I, Sun T (1994) Hybrid genetic algorithm simulated annealing and Tabu search methods for vehicle routing problem with time windows. Technical Report, 27, Computer Science Department, Slippery Rock University"},{"key":"5350_CR45","doi-asserted-by":"crossref","unstructured":"Veen VB, Emmerich M, Yang Z, B\u00e4ck T, Kok J (2013) Ant colony algorithms for the dynamic vehicle routing problem with time windows. In: Natural and artificial computation in engineering and medical applications. Springer Berlin Heidelberg, pp 1\u201310","DOI":"10.1007\/978-3-642-38622-0_1"},{"issue":"2","key":"5350_CR46","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1287\/trsc.1030.0068","volume":"38","author":"J Yang","year":"2004","unstructured":"Yang J, Jaillet P, Mahmassani H (2004) Real-time multivehicle truckload pickup and delivery problems. Transp Sci 38(2):135\u2013148","journal-title":"Transp Sci"},{"key":"5350_CR47","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1007\/s11047-016-9550-9","volume":"16","author":"Z Yang","year":"2017","unstructured":"Yang Z, van Osta JP, van Veen B, van Krevelen R, van Klaveren R, Stam A, Kok J, B\u00e4ck T, Emmerich M (2017) Dynamic vehicle routing with time windows in theory and practice. Nat Comput 16:119\u2013134","journal-title":"Nat Comput"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-020-05350-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00500-020-05350-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-020-05350-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,10,6]],"date-time":"2021-10-06T05:30:24Z","timestamp":1633498224000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00500-020-05350-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,10,6]]},"references-count":44,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2021,2]]}},"alternative-id":["5350"],"URL":"https:\/\/doi.org\/10.1007\/s00500-020-05350-4","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,10,6]]},"assertion":[{"value":"6 October 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Compliance with ethical standards"}},{"value":"The authors declare that there is no conflict of interest regarding the publication of this paper.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"This article does not contain any studies with human participants or animals performed by any of the authors.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical approval"}},{"value":"Informed consent is obtained from all individual participants included in the study.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed consent"}}]}}