{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,17]],"date-time":"2024-07-17T13:55:44Z","timestamp":1721224544409},"reference-count":25,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2014,12,14]],"date-time":"2014-12-14T00:00:00Z","timestamp":1418515200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Cent Eur J Oper Res"],"published-print":{"date-parts":[[2015,6]]},"DOI":"10.1007\/s10100-014-0373-4","type":"journal-article","created":{"date-parts":[[2014,12,13]],"date-time":"2014-12-13T11:24:59Z","timestamp":1418469899000},"page":"479-500","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Evaluating two new heuristics for constructing customer clusters in a VRPTW with multiple service workers"],"prefix":"10.1007","volume":"23","author":[{"given":"Gerald","family":"Senarclens de Grancy","sequence":"first","affiliation":[]},{"given":"Marc","family":"Reimann","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,12,14]]},"reference":[{"issue":"4","key":"373_CR1","doi-asserted-by":"crossref","first-page":"351","DOI":"10.1007\/s10100-007-0036-9","volume":"15","author":"PP Belfiore","year":"2007","unstructured":"Belfiore PP, F\u00e1vero LPL (2007) Scatter search for the fleet size and mix vehicle routing problem with time windows. Cent Eur J Oper Res 15(4):351\u2013368. doi: 10.1007\/s10100-007-0036-9","journal-title":"Cent Eur J Oper Res"},{"issue":"1","key":"373_CR2","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1287\/trsc.1030.0056","volume":"39","author":"O Br\u00e4ysy","year":"2005","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. doi: 10.1287\/trsc.1030.0056","journal-title":"Transp Sci"},{"issue":"1","key":"373_CR3","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1287\/trsc.1030.0057","volume":"39","author":"O Br\u00e4ysy","year":"2005","unstructured":"Br\u00e4ysy O, Gendreau M (2005b) Vehicle routing problem with time windows, part II: metaheuristics. Transp Sci 39(1):119\u2013139. doi: 10.1287\/trsc.1030.0057","journal-title":"Transp Sci"},{"key":"373_CR4","doi-asserted-by":"crossref","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"GB Dantzig","year":"1959","unstructured":"Dantzig GB, Ramser JH (1959) The truck dispatching problem. Manag Sci 6:80\u201391","journal-title":"Manag Sci"},{"key":"373_CR5","unstructured":"Dorigo M (1992) Optimization, learning and natural algorithms. PhD thesis, Politecnico di Milano"},{"issue":"1","key":"373_CR6","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/j.ejor.2012.06.015","volume":"224","author":"SHH Doulabi","year":"2013","unstructured":"Doulabi SHH, Seifi A (2013) Lower and upper bounds for location-arc routing problems with vehicle capacity constraints. Eur J Oper Res 224(1):189\u2013208","journal-title":"Eur J Oper Res"},{"key":"373_CR7","unstructured":"ECMA (2013) ECMA-404: The JSON data interchange format. Geneva, Switzerland: ECMA (European Association for Standardizing Information and Communication Systems). http:\/\/www.ecma.ch\/ecma1\/STAND\/ECMA-404 . HTM"},{"issue":"1","key":"373_CR8","doi-asserted-by":"crossref","first-page":"70","DOI":"10.1016\/j.cor.2012.05.008","volume":"40","author":"JW Escobar","year":"2013","unstructured":"Escobar JW, Linfati R, Toth P (2013) A two-phase hyhbrid heuristic algorithm for the capacitated location-routing problem. Comput Oper Res 40(1):70\u201379. doi: 10.1016\/j.cor.2012.05.008","journal-title":"Comput Oper Res"},{"key":"373_CR9","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1007\/BF01096763","volume":"6","author":"TA Feo","year":"1995","unstructured":"Feo TA, Resende MGC (1995) Greedy randomized adaptive search procedures. J Glob Optim 6:109\u2013133","journal-title":"J Glob Optim"},{"issue":"1","key":"373_CR10","doi-asserted-by":"crossref","first-page":"6","DOI":"10.1287\/opre.35.1.6","volume":"35","author":"BL Golden","year":"1987","unstructured":"Golden BL, Wasil EA (1987) Computerized vehicle routing in the soft drink industry. Oper Res 35(1):6","journal-title":"Oper Res"},{"issue":"12","key":"373_CR11","doi-asserted-by":"crossref","first-page":"3215","DOI":"10.1016\/j.cor.2012.04.007","volume":"39","author":"VC Hemmelmayr","year":"2012","unstructured":"Hemmelmayr VC, Cordeau J-F, Crainic TG (2012) An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics. Comput Oper Res 39(12):3215\u20133228. doi: 10.1016\/j.cor.2012.04.007","journal-title":"Comput Oper Res"},{"issue":"1","key":"373_CR12","doi-asserted-by":"crossref","first-page":"0377","DOI":"10.1016\/j.ejor.2004.01.027","volume":"162","author":"J Homberger","year":"2005","unstructured":"Homberger J, Gehring H (2005) A two-phase hybrid metaheuristic for the vehicle routing problem with time windows. Eur J Oper Res 162(1):0377\u20132217. doi: 10.1016\/j.ejor.2004.01.027","journal-title":"Eur J Oper Res"},{"issue":"3","key":"373_CR13","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1109\/MCSE.2007.55","volume":"9","author":"JD Hunter","year":"2007","unstructured":"Hunter JD (2007) Matplotlib: a 2D graphics environment. Comput Sci Eng 9(3):90\u201395","journal-title":"Comput Sci Eng"},{"key":"373_CR14","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1016\/S0927-0507(05)80189-6","volume":"4","author":"EL Lawler","year":"1993","unstructured":"Lawler EL, Lenstra JK, Shmoys DB (1993) Sequencing and scheduling: algorithms and complexity. Handb Oper Res Manag Sci 4:445\u2013522","journal-title":"Handb Oper Res Manag Sci"},{"issue":"5","key":"373_CR15","doi-asserted-by":"crossref","first-page":"1683","DOI":"10.1016\/j.cor.2008.04.005","volume":"36","author":"S-W Lin","year":"2009","unstructured":"Lin S-W, Yu VF, Chou S-Y (2009) Solving the truck and trailer routing problem based on a simulated annealing heuristic. Comput Oper Res 36(5):1683\u20131692","journal-title":"Comput Oper Res"},{"issue":"12","key":"373_CR16","doi-asserted-by":"crossref","first-page":"15244","DOI":"10.1016\/j.eswa.2011.05.075","volume":"38","author":"S-W Lin","year":"2011","unstructured":"Lin S-W, Yu VF, Lu C-C (2011) A simulated annealing heuristic for the truck and trailer routing problem with time windows. Expert Syst Appl 38(12):15244\u201315252","journal-title":"Expert Syst Appl"},{"issue":"3","key":"373_CR17","doi-asserted-by":"crossref","first-page":"636","DOI":"10.1016\/j.ejor.2011.12.005","volume":"218","author":"V Pureza","year":"2011","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. doi: 10.1016\/j.ejor.2011.12.005","journal-title":"Eur J Oper Res"},{"key":"373_CR18","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1016\/S0305-0548(03)00014-5","volume":"31","author":"M Reimann","year":"2004","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","journal-title":"Comput Oper Res"},{"issue":"10","key":"373_CR19","doi-asserted-by":"crossref","first-page":"1034","DOI":"10.1057\/palgrave.jors.2600808","volume":"50","author":"S Salhi","year":"1999","unstructured":"Salhi S, Nagy G (1999) A cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling. J Oper Res Soc 50(10):1034\u20131042","journal-title":"J Oper Res Soc"},{"key":"373_CR20","doi-asserted-by":"crossref","unstructured":"Senarclens de Grancy G, Reimann M (2014) Vehicle routing problems with time windows and multiple service workers: a systematic comparison between ACO and GRASP. Cent Eur J Oper Res 1\u201320. issn: 1435\u2013246X. doi: 10.1007\/s10100-014-0341-z","DOI":"10.1007\/s10100-014-0341-z"},{"issue":"2","key":"373_CR21","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","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","journal-title":"Oper Res"},{"key":"373_CR22","doi-asserted-by":"crossref","unstructured":"van der Walt S, Colbert SC, Varoquaux G (2011) The NumPy array: a structure for efficient numerical computation. Comput Sci Eng 13 (2): 22\u201330. http:\/\/dblp.uni-trier.de\/db\/journals\/cse\/cse13.html#WaltCV11","DOI":"10.1109\/MCSE.2011.37"},{"issue":"9","key":"373_CR23","doi-asserted-by":"crossref","first-page":"1319","DOI":"10.1016\/j.cor.2010.11.011","volume":"38","author":"JG Villegas","year":"2011","unstructured":"Villegas JG, Prins C, Prodhon C, Medaglia AL, Velasco N (2011) A GRASP with evolutionary path relinking for the truck and trailer routing problem. Comput Oper Res 38(9):1319\u20131334","journal-title":"Comput Oper Res"},{"issue":"6","key":"373_CR24","doi-asserted-by":"crossref","first-page":"80","DOI":"10.2307\/3001968","volume":"1","author":"F Wilcoxon","year":"1945","unstructured":"Wilcoxon F (1945) Individual comparisons by ranking methods. Biometr Bull 1(6):80\u201383. doi: 10.2307\/3001968","journal-title":"Biometr Bull"},{"key":"373_CR25","unstructured":"World Bank (2010) Population in urban agglomerations of more than 1 million. Internet resource. http:\/\/data.worldbank.org\/indicator\/EN.URB.MCTY.TL.ZS\/countries?display=graph . Accessed 10 Jan 2012"}],"container-title":["Central European Journal of Operations Research"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-014-0373-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10100-014-0373-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10100-014-0373-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:49:33Z","timestamp":1559123373000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10100-014-0373-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,14]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2015,6]]}},"alternative-id":["373"],"URL":"https:\/\/doi.org\/10.1007\/s10100-014-0373-4","relation":{},"ISSN":["1435-246X","1613-9178"],"issn-type":[{"value":"1435-246X","type":"print"},{"value":"1613-9178","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,12,14]]}}}