{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T11:54:05Z","timestamp":1778846045249,"version":"3.51.4"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2015,8,15]],"date-time":"2015-08-15T00:00:00Z","timestamp":1439596800000},"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":["Constraints"],"published-print":{"date-parts":[[2016,1]]},"DOI":"10.1007\/s10601-015-9203-0","type":"journal-article","created":{"date-parts":[[2015,8,14]],"date-time":"2015-08-14T05:51:39Z","timestamp":1439531499000},"page":"2-21","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Fleet design optimisation from historical data using constraint programming and large neighbourhood search"],"prefix":"10.1007","volume":"21","author":[{"given":"Philip","family":"Kilby","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tommaso","family":"Urli","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,8,15]]},"reference":[{"key":"9203_CR1","doi-asserted-by":"crossref","unstructured":"Archetti, C., & Speranza, M. (2008). The split delivery vehicle routing problem: a survey. In Golden, B., Raghavan, S., & Wasil, E. (Eds.) The vehicle routing problem: latest advances and new challenges, operations research\/computer science interfaces, (Vol. 43 pp. 103\u2013122). US: Springer.","DOI":"10.1007\/978-0-387-77778-8_5"},{"issue":"2","key":"9203_CR2","doi-asserted-by":"crossref","first-page":"589","DOI":"10.1016\/j.cie.2012.11.007","volume":"64","author":"P Belfiore","year":"2013","unstructured":"Belfiore, P., & Yoshizaki, H.T. (2013). Heuristic methods for the fleet size and mix vehicle routing problem with time windows and split deliveries. Computers & Industrial Engineering, 64(2), 589\u2013601.","journal-title":"Computers & Industrial Engineering"},{"key":"9203_CR3","doi-asserted-by":"crossref","unstructured":"Birattari, M., Yuan, Z., Balaprakash, P., & St\u00fctzle, T. (2010). F-Race and iterated F-Race: an overview. In Experimental methods for the analysis of optimization algorithms (pp. 311\u2013336). Springer.","DOI":"10.1007\/978-3-642-02538-9_13"},{"issue":"3","key":"9203_CR4","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1287\/trsc.1070.0217","volume":"42","author":"O Br\u00e4ysy","year":"2008","unstructured":"Br\u00e4ysy, O., Dullaert, W., Hasle, G., Mester, D., & Gendreau, M. (2008). An effective multirestart deterministic annealing metaheuristic for the fleet size and mix vehicle-routing problem with time windows. Transportation Science, 42(3), 371\u2013386.","journal-title":"Transportation Science"},{"key":"9203_CR5","doi-asserted-by":"crossref","unstructured":"Crainic, T.G. (2003). Long-haul freight transportation. In Hall, R.W. (Ed.) Handbook of transportation science, international series in operations research & management science, (Vol. 56 pp. 451\u2013516). US: Springer.","DOI":"10.1007\/0-306-48058-1_13"},{"issue":"4","key":"9203_CR6","doi-asserted-by":"crossref","first-page":"516","DOI":"10.1287\/trsc.1070.0190","volume":"41","author":"M Dell\u2019Amico","year":"2007","unstructured":"Dell\u2019Amico, M., Monaci, M., Pagani, C., & Vigo, D. (2007). Heuristic approaches for the fleet size and mix vehicle routing problem with time windows. Transportation Science, 41(4), 516\u2013526.","journal-title":"Transportation Science"},{"key":"9203_CR7","doi-asserted-by":"crossref","unstructured":"Di Gaspero, L., Rendl, A., & Urli, T. (2015). Balancing bike sharing systems with constraint programming. Constraints, 1\u201331.","DOI":"10.1007\/s10601-015-9182-1"},{"key":"9203_CR8","doi-asserted-by":"crossref","unstructured":"Di Gaspero, L., & Urli, T. (2014). A cp\/lns approach for multi-day homecare scheduling problems. In Hybrid metaheuristics (pp. 1\u201315). Springer.","DOI":"10.1007\/978-3-319-07644-7_1"},{"issue":"2","key":"9203_CR9","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1287\/trsc.23.2.141","volume":"23","author":"M Dror","year":"1989","unstructured":"Dror, M., & Trudeau, P. (1989). Savings by split delivery routing. Transportation Science, 23(2), 141\u2013145.","journal-title":"Transportation Science"},{"issue":"3","key":"9203_CR10","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1002\/nav.3800370304","volume":"37","author":"M Dror","year":"1990","unstructured":"Dror, M., & Trudeau, P. (1990). Split delivery routing. Naval Research Logistics (NRL), 37(3), 383\u2013402.","journal-title":"Naval Research Logistics (NRL)"},{"key":"9203_CR11","unstructured":"Gurobi Optimization, I. (2015). Gurobi optimizer reference manual. http:\/\/www.gurobi.com ."},{"key":"9203_CR12","doi-asserted-by":"crossref","unstructured":"Kilby, P., & Shaw, P. (2006). Vehicle routing. Handbook of Constraint Programming, 799\u2013834.","DOI":"10.1016\/S1574-6526(06)80027-1"},{"issue":"9","key":"9203_CR13","doi-asserted-by":"crossref","first-page":"2743","DOI":"10.1016\/j.cor.2005.10.010","volume":"34","author":"J Kyt\u00f6joki","year":"2007","unstructured":"Kyt\u00f6joki, J., Nuortio, T., Br\u00e4ysy, O., & Gendreau, M. (2007). An efficient variable neighborhood search heuristic for very large scale vehicle routing problems. Computers & Operations Research, 34(9), 2743\u20132757.","journal-title":"Computers & Operations Research"},{"key":"9203_CR14","doi-asserted-by":"crossref","unstructured":"Pisinger, D., & Ropke, S. (2010). Large neighborhood search. In Handbook of metaheuristics (pp. 399\u2013419). Springer.","DOI":"10.1007\/978-1-4419-1665-5_13"},{"issue":"4","key":"9203_CR15","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1287\/trsc.1050.0135","volume":"40","author":"S Ropke","year":"2006","unstructured":"Ropke, S., & Pisinger, D. (2006). An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows. Transportation science, 40(4), 455\u2013472.","journal-title":"Transportation science"},{"key":"9203_CR16","unstructured":"Schulte, C., Tack, G., & Lagerkvist, M.Z. (2015). Modeling and programming with gecode. In Schulte, C., Tack, G., & Lagerkvist, M.Z (Eds.) Modeling and programming with gecode."},{"key":"9203_CR17","doi-asserted-by":"crossref","unstructured":"Shaw, P. (1998). Using constraint programming and local search methods to solve vehicle routing problems. In Maher, M. J., & Puget, J.F. (Eds.) CP\u201998: the 4th international conference on principles and practice of constraint programming, 1998, proceedings of, lecture notes in computer science, (Vol. 1520 pp. 417\u2013431): Springer.","DOI":"10.1007\/3-540-49481-2_30"},{"key":"9203_CR18","doi-asserted-by":"crossref","unstructured":"Toth, P., & Vigo, D. (2002). The vehicle routing problem. Society for Industrial and Applied Mathematics.","DOI":"10.1137\/1.9780898718515"},{"key":"9203_CR19","unstructured":"Urli, T. (2013). json2run: a tool for experiment design & analysis. arXiv preprint arXiv: 1305.1112 ."},{"issue":"3","key":"9203_CR20","doi-asserted-by":"crossref","first-page":"658","DOI":"10.1016\/j.ejor.2013.09.045","volume":"234","author":"T Vidal","year":"2014","unstructured":"Vidal, T., Crainic, T.G., Gendreau, M., & Prins, C. (2014). A unified solution framework for multi-attribute vehicle routing problems. European Journal of Operational Research, 234(3), 658\u2013673.","journal-title":"European Journal of Operational Research"}],"container-title":["Constraints"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-015-9203-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10601-015-9203-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10601-015-9203-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T15:14:18Z","timestamp":1559229258000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10601-015-9203-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,8,15]]},"references-count":20,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2016,1]]}},"alternative-id":["9203"],"URL":"https:\/\/doi.org\/10.1007\/s10601-015-9203-0","relation":{},"ISSN":["1383-7133","1572-9354"],"issn-type":[{"value":"1383-7133","type":"print"},{"value":"1572-9354","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,8,15]]}}}