{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,16]],"date-time":"2026-03-16T17:46:47Z","timestamp":1773683207103,"version":"3.50.1"},"reference-count":45,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2014,5,3]],"date-time":"2014-05-03T00:00:00Z","timestamp":1399075200000},"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":["J Comb Optim"],"published-print":{"date-parts":[[2014,7]]},"DOI":"10.1007\/s10878-014-9741-1","type":"journal-article","created":{"date-parts":[[2014,5,2]],"date-time":"2014-05-02T10:18:14Z","timestamp":1399025894000},"page":"288-309","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":41,"title":["Integrated Ant Colony and Tabu Search approach for time dependent vehicle routing problems with simultaneous pickup and delivery"],"prefix":"10.1007","volume":"28","author":[{"given":"Tao","family":"Zhang","sequence":"first","affiliation":[]},{"given":"W. Art","family":"Chaovalitwongse","sequence":"additional","affiliation":[]},{"given":"Yuejie","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,5,3]]},"reference":[{"issue":"3","key":"9741_CR1","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1002\/(SICI)1520-6750(199604)43:3<415::AID-NAV7>3.0.CO;2-C","volume":"43","author":"S Anily","year":"1996","unstructured":"Anily S (1996) The vehicle-routing problem with delivery and back-haul options. Naval Res Logist 43(3):415\u2013434","journal-title":"Naval Res Logist"},{"issue":"1","key":"9741_CR2","doi-asserted-by":"crossref","first-page":"64","DOI":"10.1287\/trsc.1040.0103","volume":"40","author":"C Archetti","year":"2006","unstructured":"Archetti C, Speranza MG, Hertz A (2006) A tabu search algorithm for the split delivery vehicle routing problem. Transp Sci 40(1):64\u201373","journal-title":"Transp Sci"},{"issue":"6","key":"9741_CR3","doi-asserted-by":"crossref","first-page":"954","DOI":"10.1016\/j.cor.2010.10.011","volume":"38","author":"SR Balseiro","year":"2011","unstructured":"Balseiro SR, Loiseau I, Ramonet J (2011) An ant colony algorithm hybridized with insertion heuristics for the time dependent vehicle routing problem with time windows. Comput Oper Res 38(6):954\u2013966","journal-title":"Comput Oper Res"},{"issue":"2","key":"9741_CR4","doi-asserted-by":"crossref","first-page":"578","DOI":"10.1016\/j.cor.2005.03.014","volume":"34","author":"N Bianchessi","year":"2007","unstructured":"Bianchessi N, Righini G (2007) Heuristic algorithms for the vehicle routing problem with simultaneous pick-up and delivery. Comput Oper Res 34(2):578\u2013594","journal-title":"Comput Oper Res"},{"issue":"1","key":"9741_CR5","doi-asserted-by":"crossref","first-page":"140","DOI":"10.1016\/j.cor.2010.04.008","volume":"38","author":"J Brand\u00e3o","year":"2011","unstructured":"Brand\u00e3o J (2011) A tabu search algorithm for the heterogeneous fixed fleet vehicle routing problem. Comput Oper Res 38(1):140\u2013151","journal-title":"Comput Oper Res"},{"issue":"1","key":"9741_CR6","first-page":"25","volume":"7","author":"B Bullnheimer","year":"1999","unstructured":"Bullnheimer B, Hartl RF, Strauss C (1999) A new rank based version of the ant system: a computational study. Cent Eur J Oper Res Econ 7(1):25\u201338","journal-title":"Cent Eur J Oper Res Econ"},{"issue":"1","key":"9741_CR7","doi-asserted-by":"crossref","first-page":"6809","DOI":"10.1016\/j.eswa.2010.03.045","volume":"37","author":"B \u00c7atay","year":"2010","unstructured":"\u00c7atay B (2010) A new saving-based ant algorithm for the vehicle routing problem with simultaneous pickup and delivery. Expert Syst Appl 37(1):6809\u20136817","journal-title":"Expert Syst Appl"},{"issue":"4","key":"9741_CR8","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1287\/ijoc.9.4.417","volume":"9","author":"WC Chiang","year":"1997","unstructured":"Chiang WC, Russell RA (1997) A reactive tabu search metaheuristic for the vehicle routing problem with time windows. INFORMS J Comput 9(4):417\u2013430","journal-title":"INFORMS J Comput"},{"issue":"3","key":"9741_CR9","first-page":"292","volume":"39","author":"JF Cordeau","year":"2001","unstructured":"Cordeau JF, Laporte G (2001) A tabu search algorithm for the site dependent vehicle routing problem with time windows. INFOR 39(3):292\u2013298","journal-title":"INFOR"},{"issue":"5","key":"9741_CR10","doi-asserted-by":"crossref","first-page":"542","DOI":"10.1057\/palgrave.jors.2601707","volume":"55","author":"JF Cordeau","year":"2004","unstructured":"Cordeau JF, Laporte G, Mercier A (2004) Improved tabu search algorithm for the handling of route duration constraints in vehicle routing problems with time windows. J Oper Res Soc 55(5):542\u2013546","journal-title":"J Oper Res Soc"},{"issue":"9","key":"9741_CR11","doi-asserted-by":"crossref","first-page":"2033","DOI":"10.1016\/j.cor.2011.09.021","volume":"39","author":"JF Cordeau","year":"2012","unstructured":"Cordeau JF, Maischberger M (2012) A parallel iterated tabu search heuristic for vehicle routing problems. Comput Oper Res 39(9):2033\u20132050","journal-title":"Comput Oper Res"},{"issue":"3","key":"9741_CR12","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1287\/trsc.1070.0223","volume":"42","author":"G Desaulniers","year":"2008","unstructured":"Desaulniers G, Lessard F, Hadjar A (2008) Tabu search, partial elementarity, and generalized k-path inequalities for the vehicle routing problem with time windows. Transp Sci 42(3):387\u2013404","journal-title":"Transp Sci"},{"issue":"1","key":"9741_CR13","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 Specktrum 23(1):79\u201396","journal-title":"OR Specktrum"},{"key":"9741_CR14","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1057\/palgrave\/jors\/2601263","volume":"52","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 Oper Res Soc 52:115\u2013118","journal-title":"J Oper Res Soc"},{"issue":"3","key":"9741_CR15","doi-asserted-by":"crossref","first-page":"1174","DOI":"10.1016\/j.ejor.2006.06.047","volume":"185","author":"AV Donati","year":"2008","unstructured":"Donati AV, Montemanni R, Casagrande N et al (2008) Time dependent vehicle routing problem with a multi ant colony system. Eur J Oper Res Soc 185(3):1174\u20131191","journal-title":"Eur J Oper Res Soc"},{"issue":"1","key":"9741_CR16","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1109\/3477.484436","volume":"26","author":"M Dorigo","year":"1996","unstructured":"Dorigo M, Maniezzo V, Colorni A (1996) The ant system: optimization by a colony of cooperating agents. IEEE Trans Syst Man Cybern Part B: Cybern 26(1):29\u201341","journal-title":"IEEE Trans Syst Man Cybern Part B: Cybern"},{"issue":"2","key":"9741_CR17","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1016\/S0303-2647(97)01708-5","volume":"43","author":"M Dorigo","year":"1997","unstructured":"Dorigo M, Gambardella LM (1997) Ant colonies for the traveling salesman problem. BioSystems 43(2):73\u201381","journal-title":"BioSystems"},{"issue":"1","key":"9741_CR18","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M Dorigo","year":"1997","unstructured":"Dorigo M, Gambardella LM (1997) Ant colony system: a cooperative learning approach to the traveling salesman problem. IEEE Trans Evol Comput 1(1):53\u201366","journal-title":"IEEE Trans Evol Comput"},{"issue":"1","key":"9741_CR19","doi-asserted-by":"crossref","first-page":"49","DOI":"10.1287\/trsc.31.1.49","volume":"31","author":"C Duhamel","year":"1997","unstructured":"Duhamel C (1997) A tabu search heuristic for the vehicle routing problem with backhauls and time windows. Transp Sci 31(1):49\u201359","journal-title":"Transp Sci"},{"issue":"3","key":"9741_CR20","doi-asserted-by":"crossref","first-page":"616","DOI":"10.1016\/j.tre.2011.11.006","volume":"48","author":"MA Figliozzi","year":"2012","unstructured":"Figliozzi MA (2012) The time dependent vehicle routing problem with time windows: benchmark problems, an efficient solution algorithm, and solution characteristics. Transp Res Part E 48(3):616\u2013636","journal-title":"Transp Res Part E"},{"issue":"4","key":"9741_CR21","doi-asserted-by":"crossref","first-page":"1018","DOI":"10.1287\/opre.28.4.1018","volume":"28","author":"KR Fox","year":"1980","unstructured":"Fox KR, Gavish B, Graves SC (1980) An n-constraint formulation of the (time-dependent) traveling salesman problem. Oper Res 28(4):1018\u20131021","journal-title":"Oper Res"},{"issue":"12","key":"9741_CR22","doi-asserted-by":"crossref","first-page":"3215","DOI":"10.1016\/j.cor.2009.02.017","volume":"36","author":"Y Gajpal","year":"2009","unstructured":"Gajpal Y, Abad P (2009) An ant colony system (ACS) for vehicle routing problem with simultaneous delivery and pickup. Comput Oper Res 36(12):3215\u20133223","journal-title":"Comput Oper Res"},{"issue":"10","key":"9741_CR23","doi-asserted-by":"crossref","first-page":"1276","DOI":"10.1287\/mnsc.40.10.1276","volume":"40","author":"M Gendreau","year":"1994","unstructured":"Gendreau M, Hertz A, Laporte G (1994) A tabu search heuristic for the vehicle routing problem. Manage Sci 40(10):1276\u20131290","journal-title":"Manage Sci"},{"issue":"3","key":"9741_CR24","doi-asserted-by":"crossref","first-page":"469","DOI":"10.1287\/opre.44.3.469","volume":"44","author":"M Gendreau","year":"1996","unstructured":"Gendreau M, Laporte G, S\u00e9guin R (1996) A tabu search heuristic for the vehicle routing problem with stochastic demands and customers. Oper Res 44(3):469\u2013477","journal-title":"Oper Res"},{"issue":"7","key":"9741_CR25","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 travelling salesman problem with pickup and delivery. Comput Oper Res 26(7):699\u2013714","journal-title":"Comput Oper Res"},{"issue":"5","key":"9741_CR26","doi-asserted-by":"crossref","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"13","author":"F Glover","year":"1986","unstructured":"Glover F (1986) Future paths for integer programming and links to artificial intelligence. Comput Oper Res 13(5):533\u2013549","journal-title":"Comput Oper Res"},{"key":"9741_CR27","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 Academic Publishers, Boston"},{"issue":"4","key":"9741_CR28","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1057\/jors.1992.49","volume":"43","author":"AV Hill","year":"1992","unstructured":"Hill AV, Benton WC (1992) Modeling intra-city time-dependent travel speeds for vehicle scheduling problems. J Oper Res Soc 43(4):343\u2013351","journal-title":"J Oper Res Soc"},{"issue":"2","key":"9741_CR29","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1016\/S0377-2217(02)00147-9","volume":"144","author":"S Ichoua","year":"2003","unstructured":"Ichoua S, Gendreau M, Potvin JY (2003) Vehicle dispatching with time-dependent travel times. Eur J Oper Res 144(2):379\u2013396","journal-title":"Eur J Oper Res"},{"key":"9741_CR30","unstructured":"Malandraki C (1989) Time dependent vehicle routing problem: formulations, solution algorithms and computations experiments. University Microfilms Int."},{"issue":"3","key":"9741_CR31","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1287\/trsc.26.3.185","volume":"26","author":"C Malandraki","year":"1992","unstructured":"Malandraki C, Daskin MS (1992) Time dependent vehicle routing problems: formulations, properties and heuristic algorithms. Transp Sci 26(3):185\u2013200","journal-title":"Transp Sci"},{"issue":"1","key":"9741_CR32","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1016\/0377-2217(94)00299-1","volume":"90","author":"C Malandraki","year":"1996","unstructured":"Malandraki C, Robert BD (1996) A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem. Eur J Oper Res 90(1):45\u201355","journal-title":"Eur J Oper Res"},{"issue":"3","key":"9741_CR33","doi-asserted-by":"crossref","first-page":"305","DOI":"10.1023\/A:1015057701750","volume":"8","author":"M Middendorf","year":"2002","unstructured":"Middendorf M, Reischle F, Schmeck H (2002) Multi colony ant algorithms. J Heuristics 8(3):305\u2013320","journal-title":"J Heuristics"},{"issue":"5","key":"9741_CR34","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 problems with simultaneous delivery and pick-up points. Transp Res Part A 23(5):377\u2013386","journal-title":"Transp Res Part A"},{"key":"9741_CR35","first-page":"19","volume-title":"Vehicle routing problems with simultaneous pick-up and delivery service, vol. 38(6\/1)","author":"FA Montane","year":"2002","unstructured":"Montane FA, Galv\u00e3o RD (2002) Vehicle routing problems with simultaneous pick-up and delivery service, vol. 38(6\/1). OPSEARCH, New Delhi, pp 19\u201333"},{"key":"9741_CR36","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"},{"issue":"1","key":"9741_CR37","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1287\/opre.26.1.86","volume":"26","author":"JC Picard","year":"1978","unstructured":"Picard JC, Queryranne M (1978) The time-dependent traveling salesman problem and its application to the tardiness problem in one-machine scheduling. Oper Res 26(1):86\u2013110","journal-title":"Oper Res"},{"issue":"2","key":"9741_CR38","doi-asserted-by":"crossref","first-page":"246","DOI":"10.1016\/j.trb.2009.07.004","volume":"44","author":"L Santos","year":"2010","unstructured":"Santos L, Coutinho-Rodrigues J, Current JR (2010) An improved ant colony optimization based algorithm for the capacitated arc routing problem. Transp Res Part B 44(2):246\u2013266","journal-title":"Transp Res Part B"},{"issue":"1","key":"9741_CR39","doi-asserted-by":"crossref","first-page":"37","DOI":"10.1016\/j.orl.2008.07.007","volume":"37","author":"D Soler","year":"2009","unstructured":"Soler D, Albiach J, Mart\u00ednez E (2009) A way to optimally solve a time-dependent vehicle routing problem with time windows. Oper Res Lett 37(1):37\u201342","journal-title":"Oper Res Lett"},{"issue":"2","key":"9741_CR40","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","journal-title":"Oper Res"},{"issue":"8","key":"9741_CR41","doi-asserted-by":"crossref","first-page":"889","DOI":"10.1016\/S0167-739X(00)00043-1","volume":"16","author":"T Stutzle","year":"2000","unstructured":"Stutzle T, Hoos H (2000) Max\u2013min ant system. Future Gener Comput Syst 16(8):889\u2013914","journal-title":"Future Gener Comput Syst"},{"issue":"11","key":"9741_CR42","doi-asserted-by":"crossref","first-page":"1899","DOI":"10.1016\/j.cor.2009.10.011","volume":"37","author":"A Subramanian","year":"2010","unstructured":"Subramanian A, Drummond LMA, Bentes C et al (2010) A parallel heuristic for the vehicle routing problem with simultaneous pickup and delivery. Comput Oper Res 37(11):1899\u20131911","journal-title":"Comput Oper Res"},{"issue":"1","key":"9741_CR43","first-page":"19","volume":"39","author":"FA Tang","year":"2002","unstructured":"Tang FA, Galv\u0101o RD (2002) Vehicle routing problems with simultaneous pick-up and delivery service. J Oper Res Soc India 39(1):19\u201333","journal-title":"J Oper Res Soc India"},{"issue":"3","key":"9741_CR44","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\u0101o RD (2006) A tabu search algorithm for the vehicle routing problem with simultaneous pick-up and delivery service. Comput Oper Res 33(3):595\u2013619","journal-title":"Comput Oper Res"},{"issue":"2","key":"9741_CR45","doi-asserted-by":"crossref","first-page":"1070","DOI":"10.1016\/j.eswa.2007.11.005","volume":"36","author":"EE Zachariadis","year":"2009","unstructured":"Zachariadis EE, Tarantilis CD, Kiranoudis CT (2009) A hybrid metaheuristic algorithm for the vehicle routing problem with simultaneous delivery and pick-up service. Expert Syst Appl 36(2):1070\u20131081","journal-title":"Expert Syst Appl"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9741-1.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-014-9741-1\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-014-9741-1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:23Z","timestamp":1559276603000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-014-9741-1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,5,3]]},"references-count":45,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,7]]}},"alternative-id":["9741"],"URL":"https:\/\/doi.org\/10.1007\/s10878-014-9741-1","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,5,3]]}}}