{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,5]],"date-time":"2026-05-05T12:22:07Z","timestamp":1777983727180,"version":"3.51.4"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2013,4,6]],"date-time":"2013-04-06T00:00:00Z","timestamp":1365206400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["4OR-Q J Oper Res"],"published-print":{"date-parts":[[2014,9]]},"DOI":"10.1007\/s10288-013-0238-z","type":"journal-article","created":{"date-parts":[[2013,4,5]],"date-time":"2013-04-05T09:49:34Z","timestamp":1365155374000},"page":"235-259","source":"Crossref","is-referenced-by-count":57,"title":["A new exact algorithm to solve the multi-trip vehicle routing problem with time windows and limited duration"],"prefix":"10.1007","volume":"12","author":[{"given":"F.","family":"Hernandez","sequence":"first","affiliation":[]},{"given":"D.","family":"Feillet","sequence":"additional","affiliation":[]},{"given":"R.","family":"Giroudeau","sequence":"additional","affiliation":[]},{"given":"O.","family":"Naud","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2013,4,6]]},"reference":[{"key":"238_CR1","unstructured":"Azi N (2010) M\u00e9thodes exactes et heuristiques pour le probl\u00e8me de tourn\u00e9es avec fen\u00eatres de temps et r\u00e9utilisation de v\u00e9hicules. Ph.D. thesis, Universit\u00e9 de Montr\u00e9al"},{"issue":"3","key":"238_CR2","doi-asserted-by":"crossref","first-page":"755","DOI":"10.1016\/j.ejor.2006.02.019","volume":"178","author":"N Azi","year":"2007","unstructured":"Azi N, Gendreau M, Potvin J-Y (2007) An exact algorithm for a single-vehicle routing problem with time windows and multiple routes. Eur J Oper Res 178(3):755\u2013766","journal-title":"Eur J Oper Res"},{"issue":"3","key":"238_CR3","doi-asserted-by":"crossref","first-page":"756","DOI":"10.1016\/j.ejor.2009.06.034","volume":"202","author":"N Azi","year":"2010","unstructured":"Azi N, Gendreau M, Potvin J-Y (2010) An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles. Eur J Oper Res 202(3):756\u2013763","journal-title":"Eur J Oper Res"},{"key":"238_CR4","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1287\/opre.46.3.316","volume":"46","author":"C Barnhart","year":"1996","unstructured":"Barnhart C, Johnson EL, Nemhauser GL, Savelsbergh MWP, Vance PH (1996) Branch-and-price: column generation for solving huge integer programs. Oper Res 46:316\u2013329","journal-title":"Oper Res"},{"issue":"11","key":"238_CR5","doi-asserted-by":"crossref","first-page":"3041","DOI":"10.1016\/j.cor.2009.02.008","volume":"36","author":"M Battarra","year":"2009","unstructured":"Battarra M, Monaci M, Vigo D (2009) An adaptive guidance approach for the heuristic solution of a minimum multiple trip vehicle routing problem. Comput Oper Res 36(11):3041\u20133050","journal-title":"Comput Oper Res"},{"issue":"2","key":"238_CR6","doi-asserted-by":"crossref","first-page":"342","DOI":"10.1287\/opre.40.2.342","volume":"40","author":"M Desrochers","year":"1992","unstructured":"Desrochers M, Desrosiers J, Solomon M (1992) A new optimization algorithm for the vehicle-routing problem with time windows. Oper Res 40(2):342\u2013354","journal-title":"Oper Res"},{"issue":"3","key":"238_CR7","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1002\/net.20033","volume":"44","author":"D Feillet","year":"2004","unstructured":"Feillet D, Dejax P, Gendreau M, Gueguen C (2004) An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems. Networks 44(3):216\u2013229","journal-title":"Networks"},{"issue":"2","key":"238_CR8","doi-asserted-by":"crossref","first-page":"407","DOI":"10.1007\/s10288-010-0130-z","volume":"8","author":"D Feillet","year":"2010","unstructured":"Feillet D (2010) A tutorial on column generation and branch-and-price for vehicle routing problems. 4OR Q J Oper Res 8(2):407\u2013424","journal-title":"4OR Q J Oper Res"},{"key":"238_CR9","unstructured":"Fleischmann B (1990) The vehicle routing problem with multiple use of vehicles. Fachbereich Wirtshaftswissenschaften, Universit\u00e4t Hamburg, Working paper"},{"key":"238_CR10","unstructured":"Hernandez F (2010) M\u00e9thodes de r\u00e9solution exactes pour le probl\u00e8me de routage de v\u00e9hicules avec fen\u00eatres de temps et routes multiples. Ph.D. thesis in French, Montpellier II University"},{"key":"238_CR11","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/S0167-5060(08)70743-X","volume":"1","author":"JK Lenstra","year":"1977","unstructured":"Lenstra JK, Rinnooy Kan AHG (1977) Complexity of scheduling machine problems. Ann Discret Math 1:343\u2013362","journal-title":"Ann Discret Math"},{"issue":"3","key":"238_CR12","doi-asserted-by":"crossref","first-page":"536","DOI":"10.1016\/j.ejor.2011.04.037","volume":"214","author":"R Macedo","year":"2011","unstructured":"Macedo R, Alves C, Clautiaux F, Hanafi S (2011) Solving the vehicle routing problem with time windows and multiple routes exactly using a pseudo-polynomial model. Eur J Oper Res 214(3):536\u2013545","journal-title":"Eur J Oper Res"},{"key":"238_CR13","unstructured":"Mingozzi A, Roberti R, Toth P (2012) An exact algorithm for the multi-trip vehicle routing problem. INFORMS J Comput, pp 757\u2013759"},{"key":"238_CR14","unstructured":"Sen A, B\u00fclb\u00fcl K (2008) A survey on multiple vehicle routing problem. International logistics and supply chain congress 2008. Istanbul, TURKEY"},{"key":"238_CR15","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 problem with time window constraints. Oper Res 35:254\u2013265","journal-title":"Oper Res"}],"container-title":["4OR"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-013-0238-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10288-013-0238-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10288-013-0238-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T12:12:59Z","timestamp":1559131979000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10288-013-0238-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,4,6]]},"references-count":15,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2014,9]]}},"alternative-id":["238"],"URL":"https:\/\/doi.org\/10.1007\/s10288-013-0238-z","relation":{},"ISSN":["1619-4500","1614-2411"],"issn-type":[{"value":"1619-4500","type":"print"},{"value":"1614-2411","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,4,6]]}}}