{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T05:47:22Z","timestamp":1744177642595,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319126302"},{"type":"electronic","value":"9783319126319"}],"license":[{"start":{"date-parts":[[2014,12,2]],"date-time":"2014-12-02T00:00:00Z","timestamp":1417478400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,12,2]],"date-time":"2014-12-02T00:00:00Z","timestamp":1417478400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-12631-9_1","type":"book-chapter","created":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T18:31:08Z","timestamp":1417458668000},"page":"1-19","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["A Three-Stage Heuristic for the Capacitated Vehicle Routing Problem with Time Windows"],"prefix":"10.1007","author":[{"given":"Hakim","family":"Akeb","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Adel","family":"Bouchakhchoukha","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mhand","family":"Hifi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,12,2]]},"reference":[{"key":"1_CR1","doi-asserted-by":"publisher","first-page":"685","DOI":"10.1111\/j.1475-3995.2008.00655.x","volume":"15","author":"H Akeb","year":"2008","unstructured":"Akeb, H., Hifi, M.: Algorithms for the circular two-dimensional open dimension problem. Int. Trans. Oper. Res. 15, 685\u2013704 (2008)","journal-title":"Int. Trans. Oper. Res."},{"key":"1_CR2","doi-asserted-by":"publisher","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.: An exact algorithm for a single vehicle routing problem with time windows and multiple routes. Eur. J. Oper. Res. 178, 755\u2013766 (2007)","journal-title":"Eur. J. Oper. Res."},{"key":"1_CR3","doi-asserted-by":"publisher","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.: An exact algorithm for a vehicle routing problem with time windows and multiple use of vehicles. Eur. J. Oper. Res. 202, 756\u2013763 (2010)","journal-title":"Eur. J. Oper. Res."},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"723","DOI":"10.1287\/opre.1040.0111","volume":"52","author":"R Baldacci","year":"2004","unstructured":"Baldacci, R., Hadjiconstantinou, E.A., Mingozzi, E.A.: An exact algorithm for the capacitated vehicle routing problem based on a two-commodity network flow formulation. Oper. Res. 52, 723\u2013738 (2004)","journal-title":"Oper. Res."},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"52","DOI":"10.1002\/net.20091","volume":"47","author":"R Baldacci","year":"2006","unstructured":"Baldacci, R., Maniezzo, V.: Exact methods based on node-routing formulations for undirected arc-routing problems. Networks. 47, 52\u201360 (2006)","journal-title":"Networks."},{"key":"1_CR6","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1016\/S0377-2217(97)00010-6","volume":"100","author":"JCS Brand\u00e3o","year":"1997","unstructured":"Brand\u00e3o, J.C.S., Mercer, A.: A tabu search algorithm for the multi-trip vehicle routing and scheduling problem. Eur. J. Oper. Res. 100, 180\u2013191 (1997)","journal-title":"Eur. J. Oper. Res."},{"key":"1_CR7","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1287\/trsc.1030.0046","volume":"38","author":"AM Campbell","year":"2004","unstructured":"Campbell, A.M., Savelsbergh, M.: Efficient insertion heuristics for vehicle routing and scheduling problems. Transp. Sci. 38, 369\u2013378 (2004)","journal-title":"Transp. Sci."},{"key":"1_CR8","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0377-2217(94)00165-0","volume":"88","author":"IM Chao","year":"1996","unstructured":"Chao, I.M., Golden, B.L., Wasil, E.A.: A fast and effective heuristic for the orienteering problem. Eur. J. Oper. Res. 88, 101\u2013111 (1996)","journal-title":"Eur. J. Oper. Res."},{"key":"1_CR9","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1002\/net.20181","volume":"49","author":"S Chen","year":"2007","unstructured":"Chen, S., Golden, B., Wasil, E.: The split delivery vehicle routing problem: applications, algorithms, test problems, and computational results. Networks 49, 661\u2013673 (2007)","journal-title":"Networks"},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"928","DOI":"10.1057\/palgrave.jors.2601163","volume":"52","author":"J-F Cordeau","year":"2001","unstructured":"Cordeau, J.-F., Laporte, G., Mercier, A.: A unified tabu search heuristic for vehicle routing problems with time windows. J. Oper. Res. Soc. 52, 928\u2013936 (2001)","journal-title":"J. Oper. Res. Soc."},{"key":"1_CR11","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1002\/net.20033","volume":"44","author":"D Feillet","year":"2004","unstructured":"Feillet, D., Dejax, P., Gendreau, M., Gueguen, C.: An exact algorithm for the elementary shortest path problem with resource constraints: application to some vehicle routing problems. Networks 44, 216\u2013229 (2004)","journal-title":"Networks"},{"issue":"C","key":"1_CR12","doi-asserted-by":"publisher","first-page":"504","DOI":"10.1016\/j.asoc.2013.08.015","volume":"14","author":"SF Ghannadpour","year":"2014","unstructured":"Ghannadpour, S.F., Noori, S., Tavakkoli-Moghaddam, R., Ghoseiri, K.: A multi-objective dynamic vehicle routing problem with fuzzy time windows: model, solution and application. Appl. Soft Comput. 14(C), 504\u2013527 (2014)","journal-title":"Appl. Soft Comput."},{"issue":"4","key":"1_CR13","doi-asserted-by":"publisher","first-page":"1096","DOI":"10.1016\/j.asoc.2010.04.001","volume":"10","author":"K Ghoseiri","year":"2010","unstructured":"Ghoseiri, K., Ghannadpour, S.F.: Multi-objective vehicle routing problem with time windows using goal programming and genetic algorithm. Appl. Soft Comput. 10(4), 1096\u20131107 (2010)","journal-title":"Appl. Soft Comput."},{"issue":"8","key":"1_CR14","doi-asserted-by":"publisher","first-page":"3748","DOI":"10.1016\/j.eswa.2013.11.029","volume":"41","author":"J Jiang","year":"2014","unstructured":"Jiang, J., Ng, K.M., Poh, K.L., Teo, K.M.: Vehicle routing problem with a heterogeneous fleet and time windows. Expert Syst. Appl. 41(8), 3748\u20133760 (2014)","journal-title":"Expert Syst. Appl."},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Li, X., Tian, P.: An ant colony system for the open vehicle routing problem. Lecture Notes in Computer Science vol. 4150 (Springer, Heidelberg, 2006), pp. 356\u2013363","DOI":"10.1007\/11839088_33"},{"issue":"3","key":"1_CR16","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1287\/ijoc.1060.0186","volume":"19","author":"A Lim","year":"2007","unstructured":"Lim, A., Zhang, X.: A two-stage heuristic with ejection pools and generalized ejection chains for the vehicle routing problem with time windows. J. Comput. Inform. 19(3), 443\u2013457 (2007)","journal-title":"J. Comput. Inform."},{"key":"1_CR17","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.swevo.2013.05.005","volume":"13","author":"KV Narasimha","year":"2013","unstructured":"Narasimha, K.V., Kivelevitch, E., Sharma, B., Kumar, M.: An ant colony optimization technique for solving minmax Multi-Depot Vehicle Routing Problem. Swarm Evol. Comput. 13, 63\u201373 (2013)","journal-title":"Swarm Evol. Comput."},{"issue":"1","key":"1_CR18","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1080\/00207548808947840","volume":"26","author":"PS Ow","year":"1988","unstructured":"Ow, P.S., Morton, T.E.: Filtered beam search in scheduling. Int. J. Prod. Res. 26(1), 35\u201362 (1988)","journal-title":"Int. J. Prod. Res."},{"key":"1_CR19","doi-asserted-by":"publisher","first-page":"2403","DOI":"10.1016\/j.cor.2005.09.012","volume":"34","author":"D Pisinger","year":"2007","unstructured":"Pisinger, D., Ropke, S.: A general heuristic for vehicle routing problems. Comput. Oper. Res. 34, 2403\u20132435 (2007)","journal-title":"Comput. Oper. Res."},{"key":"1_CR20","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1287\/ijoc.8.2.165","volume":"8","author":"JY Potvin","year":"1996","unstructured":"Potvin, J.Y., Bengio, S.: The vehicle routing problem with time windows. Part II. Genetic search. J. Comput. Inform. 8, 165\u2013172 (1996)","journal-title":"J. Comput. Inform."},{"key":"1_CR21","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y Rochat","year":"1995","unstructured":"Rochat, Y., Taillard, E.D.: Probabilistic diversification and intensification in local search for vehicle routing. J. Heurisctics. 1, 147\u2013167 (1995)","journal-title":"J. Heurisctics."},{"issue":"2","key":"1_CR22","doi-asserted-by":"publisher","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon, M.M.: Algorithms for the vehicle routing and scheduling problems with time window constraints. Oper. Res. 35(2), 254\u2013265 (1987)","journal-title":"Oper. Res."},{"key":"1_CR23","unstructured":"Solomon, M.M.: VRPTW benchmark problems. http:\/\/w.cba.neu.edu\/~msolomon"},{"key":"1_CR24","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/s10589-005-3070-3","volume":"34","author":"KC Tan","year":"2006","unstructured":"Tan, K.C., Chew, Y.H., Lee, L.H.: A hybrid multiobjective evolutionary algorithm for solving vehicle routing problem with time windows. Comput. Optim. Appl. 34, 115\u2013151 (2006)","journal-title":"Comput. Optim. Appl."},{"key":"1_CR25","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1016\/S0954-1810(01)00005-X","volume":"15","author":"KC Tan","year":"2001","unstructured":"Tan, K.C., Lee, L.H., Zhu, Q.L., Ou, K.: Heuristic methods for vehicle routing problem with time windows. Artif. Intell. Eng. 15, 281\u2013295 (2001)","journal-title":"Artif. Intell. Eng."},{"issue":"1","key":"1_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.ejor.2013.02.053","volume":"231","author":"T Vidal","year":"2013","unstructured":"Vidal, T., Crainic, T.G., Gendreau, M., Prins, C.: Heuristics for multi-attribute vehicle routing problems: a survey and synthesis. Eur. J. Oper. Res. 231(1), 1\u201321 (2013)","journal-title":"Eur. J. Oper. Res."}],"container-title":["Studies in Computational Intelligence","Recent Advances in Computational Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-12631-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,8]],"date-time":"2023-02-08T06:04:51Z","timestamp":1675836291000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-12631-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,12,2]]},"ISBN":["9783319126302","9783319126319"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-12631-9_1","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2014,12,2]]},"assertion":[{"value":"2 December 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}