{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:38:10Z","timestamp":1759847890553},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,3,5]],"date-time":"2014-03-05T00:00:00Z","timestamp":1393977600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2016,3]]},"DOI":"10.1007\/s10100-014-0341-z","type":"journal-article","created":{"date-parts":[[2014,3,4]],"date-time":"2014-03-04T11:25:46Z","timestamp":1393932346000},"page":"29-48","source":"Crossref","is-referenced-by-count":15,"title":["Vehicle routing problems with time windows and multiple service workers: a systematic comparison between ACO and GRASP"],"prefix":"10.1007","volume":"24","author":[{"given":"Gerald","family":"Senarclens de Grancy","sequence":"first","affiliation":[]},{"given":"Marc","family":"Reimann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,3,5]]},"reference":[{"key":"341_CR1","doi-asserted-by":"crossref","unstructured":"Belfiore PP, F\u00e1vero LPL (2007) Scatter search for the fleet size and mix vehicle routing problem with time windows. Cent Eur J Operations Res 15(4):351\u2013368. ISSN:1435-246X. doi: 10.1007\/s10100-007-0036-9","DOI":"10.1007\/s10100-007-0036-9"},{"key":"341_CR2","doi-asserted-by":"crossref","unstructured":"Br\u00e4ysy O, Gendreau M (2005a) Vehicle routing problem with time windows, Part I: route construction and local search algorithms. Transp Sci 39(1):104\u2013118. ISSN: 1526-5447. doi: 10.1287\/trsc.1030.0056","DOI":"10.1287\/trsc.1030.0056"},{"key":"341_CR3","doi-asserted-by":"crossref","unstructured":"Br\u00e4ysy O, Gendreau M (2005b) Vehicle routing problem with time windows, Part II: metaheuristics. Transp Sci 39(1):119\u2013139. ISSN: 1526-5447. doi: 10.1287\/trsc.1030.0057","DOI":"10.1287\/trsc.1030.0057"},{"key":"341_CR4","doi-asserted-by":"crossref","unstructured":"Clarke G, Wright JW (1964) Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12.4:568\u2013581","DOI":"10.1287\/opre.12.4.568"},{"key":"341_CR5","unstructured":"Colorni A, Dorigo M, Maniezzo V (1991) Distributed optimization by ant colonies. In: Actes de la premi\u2018ere conf\u00e9rence europ\u00e9enne sur la vie artificielle. Elsevier, Amsterdam, pp 134\u2013142"},{"key":"341_CR6","doi-asserted-by":"crossref","unstructured":"Dantzig GB, Ramser JH (1959) The truck dispatching problem. Manag Sci 6:80\u201391","DOI":"10.1287\/mnsc.6.1.80"},{"key":"341_CR7","unstructured":"Dorigo M (1992) Optimization, learning and natural algorithms. PhD thesis. Politecnico di Milano"},{"key":"341_CR8","doi-asserted-by":"crossref","unstructured":"Feo TA, Resende MGC (1989) A probabilistic heuristic for a computationally difficult set covering problem. Oper Res Lett 8.2:67\u201371. ISSN: 0167-6377. doi: 10.1016\/0167-6377(89)90002-3","DOI":"10.1016\/0167-6377(89)90002-3"},{"key":"341_CR9","doi-asserted-by":"crossref","unstructured":"Feo TA, Resende MGC (1995) Greedy randomized adaptive search procedures. J Glob Optim 6:109\u2013133","DOI":"10.1007\/BF01096763"},{"key":"341_CR10","doi-asserted-by":"crossref","unstructured":"Fleurent C, Glover F (1999) Improved constructive multistart strategies for the quadratic assignment problem using adaptive memory. INFORMS J Comput 11.2:198\u2013204","DOI":"10.1287\/ijoc.11.2.198"},{"key":"341_CR11","doi-asserted-by":"crossref","unstructured":"Golden BL, Wasil EA (1987) Computerized vehicle routing in the soft drink industry. Oper Res 35.1:6. ISSN: 0030364X","DOI":"10.1287\/opre.35.1.6"},{"key":"341_CR12","unstructured":"Louren\u00e7o HR, Martin OC, St\u00fctzle T (2002) Iterated local search. In: Glover F, Kochenberger G (eds) Handbook of metaheuristics, volume 57 of international series in operations research and management science. Kluwer, pp 321\u2013353"},{"key":"341_CR13","doi-asserted-by":"crossref","unstructured":"Pureza V, Morabito R, Reimann M (2011) Vehicle routing with multiple deliverymen: modeling and heuristic approaches for the VRPTW. Eur J Oper Res 218.3:636\u2013647. ISSN: 0377-2217. doi: 10.1016\/j.ejor.2011.12.005","DOI":"10.1016\/j.ejor.2011.12.005"},{"key":"341_CR14","doi-asserted-by":"crossref","unstructured":"Reimann M, D\u00f6rner K, Hartl R (2002) Insertion based ants for vehicle routing problems with backhauls and time windows. In: Proceedings of the third international workshop on ant algorithms. ANTS \u201902. Springer, London, UK, pp 135\u2013148. ISBN: 3-540-44146-8","DOI":"10.1007\/3-540-45724-0_12"},{"key":"341_CR15","doi-asserted-by":"crossref","unstructured":"Reimann M, D\u00f6rner K, Hartl R (2004) D-Ants: savings based ants divide and conquer the vehicle routing problem. Comput Oper Res 31:563\u2013591","DOI":"10.1016\/S0305-0548(03)00014-5"},{"key":"341_CR16","doi-asserted-by":"crossref","unstructured":"Salehipour A, S\u00f6rensen K, Goos P, Br\u00e4ysy O (2011) Efficient GRASP+VND and GRASP+VNS metaheuristics for the traveling repairman problem. 4OR 9(2):189\u2013209. ISSN: 1619-4500. doi: 10.1007\/s10288-011-0153-0","DOI":"10.1007\/s10288-011-0153-0"},{"key":"341_CR17","doi-asserted-by":"crossref","unstructured":"Solomon MM (1987) Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper Res 35.2:254\u2013265. doi: 10.1287\/opre.35.2.254","DOI":"10.1287\/opre.35.2.254"},{"key":"341_CR18","unstructured":"Tange O (2011) GNU Parallel\u2014the command-line power tool. In: login: the USENIX magazine, vol 36.1, pp 42\u201347. http:\/\/www.gnu.org\/s\/parallel"},{"key":"341_CR19","doi-asserted-by":"crossref","unstructured":"Thompson PM, Psaraftis HN (1993) Cyclic transfer algorithms for multivehicle routing and scheduling problems. Oper Res 41.5:935\u2013946. ISSN: 0030-364X. doi: 10.1287\/opre.41.5.935","DOI":"10.1287\/opre.41.5.935"},{"key":"341_CR20","doi-asserted-by":"crossref","unstructured":"Wilcoxon F (1945) Individual comparisons by ranking methods. Biometr Bull 1.6:80\u201383. doi: 10.2307\/3001968","DOI":"10.2307\/3001968"},{"key":"341_CR21","unstructured":"World Bank (2010) Population in Urban agglomerations of more than 1 Million. Internet resource. Accessed 2012-01-10. http:\/\/data.worldbank.org\/indicator\/EN.URB.MCTY.TL.ZS\/countries?display=graph"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-014-0341-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-014-0341-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-014-0341-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,8]],"date-time":"2019-08-08T04:16:19Z","timestamp":1565237779000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-014-0341-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,3,5]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,3]]}},"alternative-id":["341"],"URL":"https:\/\/doi.org\/10.1007\/s10100-014-0341-z","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,3,5]]}}}