{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,18]],"date-time":"2026-01-18T04:43:41Z","timestamp":1768711421713,"version":"3.49.0"},"reference-count":25,"publisher":"Elsevier BV","issue":"12","license":[{"start":{"date-parts":[[2004,10,1]],"date-time":"2004-10-01T00:00:00Z","timestamp":1096588800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Operations Research"],"published-print":{"date-parts":[[2004,10]]},"DOI":"10.1016\/s0305-0548(03)00155-2","type":"journal-article","created":{"date-parts":[[2003,5,27]],"date-time":"2003-05-27T22:48:19Z","timestamp":1054075699000},"page":"1947-1964","source":"Crossref","is-referenced-by-count":165,"title":["A tabu search heuristic for the vehicle routing problem with time windows and split deliveries"],"prefix":"10.1016","volume":"31","author":[{"given":"S.C.","family":"Ho","sequence":"first","affiliation":[]},{"given":"D.","family":"Haugland","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0305-0548(03)00155-2_BIB1","doi-asserted-by":"crossref","first-page":"221","DOI":"10.1002\/net.3230110211","article-title":"Complexity of vehicle routing and scheduling problems","volume":"11","author":"Lenstra","year":"1981","journal-title":"Networks"},{"issue":"3","key":"10.1016\/S0305-0548(03)00155-2_BIB2","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1002\/nav.3800370304","article-title":"Split delivery routing","volume":"37","author":"Dror","year":"1990","journal-title":"Naval Research Logistics"},{"key":"10.1016\/S0305-0548(03)00155-2_BIB3","doi-asserted-by":"crossref","unstructured":"Toth P, Vigo D, editors. The vehicle routing problem. Philadelphia, PA: SIAM, 2002.","DOI":"10.1137\/1.9780898718515"},{"key":"10.1016\/S0305-0548(03)00155-2_BIB4","unstructured":"Golden BL, Assad AA, editors. Vehicle routing: methods and studies. Amsterdam: North-Holland, 1998."},{"key":"10.1016\/S0305-0548(03)00155-2_BIB5","unstructured":"Br\u00e4ysy O, Gendreau M. Metaheuristics for the vehicle routing problem with time windows. Technical Report STF42 A01025, SINTEF Applied Mathematics, Department of Optimization, Oslo, Norway, 2001."},{"issue":"3","key":"10.1016\/S0305-0548(03)00155-2_BIB6","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/0166-218X(92)00172-I","article-title":"Vehicle routing with split deliveries","volume":"50","author":"Dror","year":"1994","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"10.1016\/S0305-0548(03)00155-2_BIB7","first-page":"101","article-title":"The bounded split delivery vehicle routing problem with grid network distances","volume":"9","author":"Frizzell","year":"1992","journal-title":"Asia\u2013Pacific Journal of Operational Research"},{"issue":"6","key":"10.1016\/S0305-0548(03)00155-2_BIB8","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1016\/0305-0548(94)00040-F","article-title":"The split delivery vehicle scheduling problem with time windows and grid network distances","volume":"22","author":"Frizzell","year":"1995","journal-title":"Computers & Operational Research"},{"issue":"2","key":"10.1016\/S0305-0548(03)00155-2_BIB9","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1057\/palgrave.jors.2600338","article-title":"Split-delivery routing heuristics in livestock feed distribution","volume":"48","author":"Mullaseril","year":"1997","journal-title":"Journal of the Operational Research Society"},{"issue":"2","key":"10.1016\/S0305-0548(03)00155-2_BIB10","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1287\/trsc.23.2.141","article-title":"Savings by split delivery routing","volume":"23","author":"Dror","year":"1989","journal-title":"Transportation Science"},{"issue":"5","key":"10.1016\/S0305-0548(03)00155-2_BIB11","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1287\/opre.48.5.801.12407","article-title":"A lower bound for the split delivery vehicle routing problem","volume":"48","author":"Belenguer","year":"2000","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(03)00155-2_BIB12","unstructured":"Larsen J. Vehicle routing with time windows\u2014finding optimal solutions efficiently. DORSnyt 119, 1999."},{"key":"10.1016\/S0305-0548(03)00155-2_BIB13","series-title":"Tabu search","author":"Glover","year":"1997"},{"issue":"3","key":"10.1016\/S0305-0548(03)00155-2_BIB14","doi-asserted-by":"crossref","first-page":"330","DOI":"10.1287\/opre.46.3.330","article-title":"A generalized insertion heuristic for the traveling salesman problem with time windows","volume":"43","author":"Gendreau","year":"1998","journal-title":"Operations Research"},{"issue":"6","key":"10.1016\/S0305-0548(03)00155-2_BIB15","doi-asserted-by":"crossref","first-page":"1086","DOI":"10.1287\/opre.40.6.1086","article-title":"New insertion and postoptimization procedures for the traveling salesman problem","volume":"40","author":"Gendreau","year":"1992","journal-title":"Operations Research"},{"issue":"2","key":"10.1016\/S0305-0548(03)00155-2_BIB16","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","article-title":"Algorithms for the vehicle routing and scheduling problems with time window constraints","volume":"35","author":"Solomon","year":"1987","journal-title":"Operations Research"},{"key":"10.1016\/S0305-0548(03)00155-2_BIB17","unstructured":"Bent R, Van Hentenryck P. A two-stage hybrid local search for the vehicle routing problem with time windows. Technical Report CS-01-06, Brown University, Providence, USA, 2001."},{"issue":"8","key":"10.1016\/S0305-0548(03)00155-2_BIB18","doi-asserted-by":"crossref","first-page":"928","DOI":"10.1057\/palgrave.jors.2601163","article-title":"A unified tabu search heuristic for vehicle routing problems with time windows","volume":"52","author":"Cordeau","year":"2001","journal-title":"Journal of the Operational Research Society"},{"issue":"4","key":"10.1016\/S0305-0548(03)00155-2_BIB19","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1023\/A:1009621410177","article-title":"Solving vehicle routing problems using constraint programming and metaheuristics","volume":"6","author":"De Backer","year":"2000","journal-title":"Journal of Heuristics"},{"key":"10.1016\/S0305-0548(03)00155-2_BIB20","unstructured":"Gambardella LM, Taillard \u00c9, Agazzi G. MACS-VRPTW: A multiple ant colony system for vehicle routing problems with time windows. In: Corne D, Dorigo M, Glover F, editors. New ideas in optimization. Dordrecht: Kluwer Academic Publishers, 1999."},{"issue":"3","key":"10.1016\/S0305-0548(03)00155-2_BIB21","first-page":"297","article-title":"Two evolutionary metaheuristics for the vehicle routing problem with time windows","volume":"37","author":"Homberger","year":"1999","journal-title":"INFOR"},{"issue":"1","key":"10.1016\/S0305-0548(03)00155-2_BIB22","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1023\/A:1013661617536","article-title":"Using constraint-based operators to solve the vehicle routing problem with time windows","volume":"8","author":"Rousseau","year":"2002","journal-title":"Journal of Heuristics"},{"issue":"1","key":"10.1016\/S0305-0548(03)00155-2_BIB23","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02430370","article-title":"Probabilistic diversification and intensification in local search for vehicle routing","volume":"1","author":"Rochat","year":"1995","journal-title":"Journal of Heuristics"},{"key":"10.1016\/S0305-0548(03)00155-2_BIB24","series-title":"Principles and practice of constraint programming","article-title":"Using constraint programming and local search methods to solve vehicle routing problems","author":"Shaw","year":"1998"},{"issue":"2","key":"10.1016\/S0305-0548(03)00155-2_BIB25","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1287\/trsc.31.2.170","article-title":"A tabu search heuristic for the vehicle routing problem with soft time windows","volume":"31","author":"Taillard","year":"1997","journal-title":"Transportation Science"}],"container-title":["Computers & Operations Research"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803001552?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0305054803001552?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T08:52:16Z","timestamp":1553158336000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0305054803001552"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,10]]},"references-count":25,"journal-issue":{"issue":"12","published-print":{"date-parts":[[2004,10]]}},"alternative-id":["S0305054803001552"],"URL":"https:\/\/doi.org\/10.1016\/s0305-0548(03)00155-2","relation":{},"ISSN":["0305-0548"],"issn-type":[{"value":"0305-0548","type":"print"}],"subject":[],"published":{"date-parts":[[2004,10]]}}}