{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T13:08:12Z","timestamp":1776776892805,"version":"3.51.2"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2007,6,8]],"date-time":"2007-06-08T00:00:00Z","timestamp":1181260800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2008,5]]},"DOI":"10.1007\/s10878-007-9090-4","type":"journal-article","created":{"date-parts":[[2007,6,7]],"date-time":"2007-06-07T11:00:15Z","timestamp":1181214015000},"page":"368-386","source":"Crossref","is-referenced-by-count":91,"title":["A reactive tabu search algorithm for the vehicle routing problem with simultaneous pickups and deliveries"],"prefix":"10.1007","volume":"15","author":[{"given":"Niaz A.","family":"Wassan","sequence":"first","affiliation":[]},{"given":"A. Hameed","family":"Wassan","sequence":"additional","affiliation":[]},{"given":"G\u00e1bor","family":"Nagy","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,6,8]]},"reference":[{"key":"9090_CR1","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1016\/0167-6377(94)90016-7","volume":"16","author":"S Anily","year":"1994","unstructured":"Anily S, Mosheiov G (1994) The traveling salesman problem with delivery and backhauls. Oper Res Lett 16:11\u201318","journal-title":"Oper Res Lett"},{"key":"9090_CR2","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1287\/ijoc.6.2.126","volume":"6","author":"R Battiti","year":"1994","unstructured":"Battiti R, Tecchioli G (1994) Reactive tabu search. ORSA J Comput 6:126\u2013140","journal-title":"ORSA J Comput"},{"key":"9090_CR3","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1057\/palgrave.jors.2602028","volume":"57","author":"J-F Chen","year":"2006","unstructured":"Chen J-F, Wu T-H (2006) Vehicle routing problem with simultaneous deliveries and pickups. J\u00a0Oper Res Soc 57:579\u2013587","journal-title":"J\u00a0Oper Res Soc"},{"key":"9090_CR4","first-page":"315","volume-title":"Combinatorial optimization","author":"N Christofides","year":"1979","unstructured":"Christofides N, Mingozzi A, Toth P (1979) The vehicle routing problem. In: Christofides N, Mingozzi A, Toth P, Sandi C (eds) Combinatorial optimization. Wiley, Chichester, pp\u00a0315\u2013338"},{"key":"9090_CR5","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G Clarke","year":"1964","unstructured":"Clarke G, Wright J (1964) Scheduling of vehicles for a central depot to a number of delivery points. Oper Res 12:568\u2013581","journal-title":"Oper Res"},{"key":"9090_CR6","doi-asserted-by":"crossref","first-page":"512","DOI":"10.1057\/palgrave.jors.2601319","volume":"53","author":"J-F Cordeau","year":"2002","unstructured":"Cordeau J-F, Gendreau M, Laporte G, Potvin J-Y, Semet F (2002) A\u00a0guide to vehicle routing heuristics. J\u00a0Oper Res Soc 53:512\u2013522","journal-title":"J\u00a0Oper Res Soc"},{"key":"9090_CR7","doi-asserted-by":"crossref","first-page":"1296","DOI":"10.1057\/palgrave.jors.2601935","volume":"56","author":"J Crispim","year":"2005","unstructured":"Crispim J, Brand\u00e3o J (2005) Metaheuristics applied to mixed and simultaneous extensions of vehicle routing problems with backhauls. J\u00a0Oper Res Soc 56:1296\u20131302","journal-title":"J\u00a0Oper Res Soc"},{"key":"9090_CR8","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/PL00013346","volume":"23","author":"J Dethloff","year":"2001","unstructured":"Dethloff J (2001) Vehicle routing and reverse logistics: the vehicle routing problem with simultaneous delivery and pick-up. OR Spektrum 23:79\u201396","journal-title":"OR Spektrum"},{"key":"9090_CR9","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1057\/palgrave\/jors\/2601263","volume":"53","author":"J Dethloff","year":"2002","unstructured":"Dethloff J (2002) Relation between vehicle routing problems: an insertion heuristic for the vehicle routing problem with simultaneous delivery and pick-up applied to the vehicle routing problem with backhauls. J\u00a0Oper Res Soc 53:115\u2013118","journal-title":"J\u00a0Oper Res Soc"},{"key":"9090_CR10","first-page":"243","volume":"14","author":"Z Drezner","year":"1982","unstructured":"Drezner Z (1982) Fast algorithms for the round trip location problem. IEE Trans 14:243\u2013248","journal-title":"IEE Trans"},{"key":"9090_CR11","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1016\/j.trb.2005.04.002","volume":"40","author":"A Fabri","year":"2006","unstructured":"Fabri A, Recht P (2006) On dynamic pickup and delivery vehicle routing with several time windows and waiting times. Transportation Res Part B 40:335\u2013350","journal-title":"Transportation Res Part B"},{"key":"9090_CR12","doi-asserted-by":"crossref","first-page":"281","DOI":"10.1057\/jors.1967.44","volume":"18","author":"T Gaskell","year":"1967","unstructured":"Gaskell T (1967) Bases for vehicle fleet scheduling. Oper Res Quart 18:281\u2013295","journal-title":"Oper Res Quart"},{"key":"9090_CR13","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1016\/S0305-0548(98)00085-9","volume":"26","author":"M Gendreau","year":"1999","unstructured":"Gendreau M, Laporte G, Vigo D (1999) Heuristics for the traveling salesman problem with pickup and delivery. Comput Oper Res 26:699\u2013714","journal-title":"Comput Oper Res"},{"key":"9090_CR14","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1287\/opre.22.2.340","volume":"22","author":"BE Gillett","year":"1974","unstructured":"Gillett BE, Miller LR (1974) A\u00a0heuristic algorithm for the vehicle-dispatch problem. Oper Res 22:340\u2013349","journal-title":"Oper Res"},{"key":"9090_CR15","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-6089-0","volume-title":"Tabu search","author":"F Glover","year":"1997","unstructured":"Glover F, Laguna M (1997) Tabu search. Kluwer, New York"},{"key":"9090_CR16","unstructured":"Halse K (1992) Modeling and solving complex vehicle routing problems. PhD thesis, Institute of Mathematical Statistics and Operations Research, Technical University of Denmark, Lyngby"},{"key":"9090_CR17","doi-asserted-by":"crossref","first-page":"310","DOI":"10.1016\/S0377-2217(99)00235-0","volume":"122","author":"S Irnich","year":"2000","unstructured":"Irnich S (2000) A multi-depot pickup and delivery problem with a single hub and heterogeneous vehicles. Eur J Oper Res 122:310\u2013328","journal-title":"Eur J Oper Res"},{"key":"9090_CR18","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0191-2607(89)90085-X","volume":"23","author":"H Min","year":"1989","unstructured":"Min H (1989) The multiple vehicle routing problem with simultaneous delivery and pick-up points. Transp Res A 23:377\u2013386","journal-title":"Transp Res A"},{"key":"9090_CR19","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1016\/0377-2217(94)90360-3","volume":"79","author":"G Mosheiov","year":"1994","unstructured":"Mosheiov G (1994) The traveling salesman problem with pick-up and delivery. Eur J Oper Res 79:299\u2013310","journal-title":"Eur J Oper Res"},{"key":"9090_CR20","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1002\/net.3230260408","volume":"26","author":"G Mosheiov","year":"1995","unstructured":"Mosheiov G (1995) The pickup delivery location problem on networks. Networks 26:243\u2013251","journal-title":"Networks"},{"key":"9090_CR21","unstructured":"Nagy G (1996) Heuristic methods for the many-to-many location-routing problem. PhD thesis, School of Mathematics and Statistics, The University of Birmingham, Birmingham"},{"key":"9090_CR22","doi-asserted-by":"crossref","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":"9090_CR23","doi-asserted-by":"crossref","first-page":"107","DOI":"10.1016\/S0191-2615(99)00016-8","volume":"34","author":"WP Nanry","year":"2000","unstructured":"Nanry WP, Barnes JW (2000) Solving the pickup and delivery problem with time windows using reactive tabu search. Transp Res Part B 34:107\u2013121","journal-title":"Transp Res Part B"},{"key":"9090_CR24","first-page":"263","volume":"5","author":"IH Osman","year":"2002","unstructured":"Osman IH, Wassan NA (2002) A\u00a0reactive tabu search meta-heuristic for the vehicle routing problem with backhauls. J\u00a0Sched 5:263\u2013285","journal-title":"J\u00a0Sched"},{"key":"9090_CR25","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\u00a0cluster insertion heuristic for single and multiple depot vehicle routing problems with backhauling. J\u00a0Oper Res Soc 50:1034\u20131042","journal-title":"J\u00a0Oper Res Soc"},{"key":"9090_CR26","doi-asserted-by":"crossref","first-page":"595","DOI":"10.1016\/j.cor.2004.07.009","volume":"33","author":"FA Tang","year":"2006","unstructured":"Tang FA, Galv\u00e3o RD (2006) A\u00a0tabu search algorithm for the vehicle routing problems with simultaneous pickup and delivery service. Comput Oper Res 33:595\u2013619","journal-title":"Comput Oper Res"},{"key":"9090_CR27","doi-asserted-by":"crossref","first-page":"1043","DOI":"10.1016\/0305-0548(96)00018-4","volume":"23","author":"SR Thangiah","year":"1996","unstructured":"Thangiah SR, Sun T, Potvin J-Y (1996) Heuristic approaches to vehicle routing with backhauls and time windows. Comput Oper Res 23:1043\u20131057","journal-title":"Comput Oper Res"},{"key":"9090_CR28","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1137\/1.9780898718515.ch8","volume-title":"The vehicle routing problem","author":"P Toth","year":"2002","unstructured":"Toth P, Vigo D (2002) VRP with backhauls. In: Toth P, Vigo D (eds) The vehicle routing problem. Society for Industrial and Applied Mathematics, Philadelphia, pp\u00a0195\u2013224"},{"key":"9090_CR29","doi-asserted-by":"crossref","unstructured":"Wade AC (2002) Constructive and ant system heuristics for a class of vehicle routing problems with backhauls. PhD thesis, School of Mathematics and Statistics, The University of Birmingham, Birmingham","DOI":"10.1016\/S0305-0483(02)00056-7"},{"key":"9090_CR30","doi-asserted-by":"crossref","first-page":"479","DOI":"10.1016\/S0305-0483(02)00056-7","volume":"30","author":"AC Wade","year":"2002","unstructured":"Wade AC, Salhi S (2002) An investigation into a new class of vehicle routing problem with backhauls. Omega 30:479\u2013487","journal-title":"Omega"},{"key":"9090_CR31","doi-asserted-by":"crossref","first-page":"699","DOI":"10.1007\/978-1-4757-4137-7_33","volume-title":"Metaheuristics: computer decision-making","author":"AC Wade","year":"2003","unstructured":"Wade AC, Salhi S (2003) An ant system algorithm for the mixed vehicle routing problem with backhauls. In: Resende MG, de Sousa JP (eds) Metaheuristics: computer decision-making. Kluwer, New York, pp\u00a0699\u2013719"},{"key":"9090_CR32","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1057\/palgrave.jors.2601957","volume":"57","author":"NA Wassan","year":"2006","unstructured":"Wassan NA (2006a) A reactive tabu search for the vehicle routing problem. J\u00a0Oper Res Soc 57:111\u2013116","journal-title":"J\u00a0Oper Res Soc"},{"key":"9090_CR33","doi-asserted-by":"crossref","unstructured":"Wassan NA (2006b) Reactive tabu adaptive memory programming search for the vehicle routing problem with backhauls. J Oper Res Soc (available online)","DOI":"10.1057\/palgrave.jors.2601957"},{"key":"9090_CR34","doi-asserted-by":"crossref","first-page":"768","DOI":"10.1057\/palgrave.jors.2601344","volume":"53","author":"NA Wassan","year":"2002","unstructured":"Wassan NA, Osman IH (2002) Tabu search variants for the mix fleet vehicle routing problem. J\u00a0Oper Res Soc 53:768\u2013782","journal-title":"J\u00a0Oper Res Soc"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9090-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-007-9090-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-007-9090-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T00:18:12Z","timestamp":1559261892000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-007-9090-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,6,8]]},"references-count":34,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2008,5]]}},"alternative-id":["9090"],"URL":"https:\/\/doi.org\/10.1007\/s10878-007-9090-4","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,6,8]]}}}