{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T11:19:37Z","timestamp":1725880777773},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319539812"},{"type":"electronic","value":"9783319539829"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2017]]},"DOI":"10.1007\/978-3-319-53982-9_1","type":"book-chapter","created":{"date-parts":[[2017,2,14]],"date-time":"2017-02-14T15:14:02Z","timestamp":1487085242000},"page":"3-19","source":"Crossref","is-referenced-by-count":1,"title":["An Investigation on Compound Neighborhoods for VRPTW"],"prefix":"10.1007","author":[{"given":"Binhui","family":"Chen","sequence":"first","affiliation":[]},{"given":"Rong","family":"Qu","sequence":"additional","affiliation":[]},{"given":"Ruibin","family":"Bai","sequence":"additional","affiliation":[]},{"given":"Hisao","family":"Ishibuchi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,15]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1016\/0377-2217(92)90192-C","volume":"59","author":"G Laporte","year":"1992","unstructured":"Laporte, G.: The vehicle routing problem: an overview of exact and approximate algorithms. Eur. J. Oper. Res. 59, 345\u2013358 (1992)","journal-title":"Eur. J. Oper. Res."},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Cordeau, J.F., Desaulniers, G., Desrosiers, J., Solomon, M., Soumis, F.: VRP with time windows. In: The vehicle routing problem, Society for Industrial and Applied Mathematics, pp. 157\u2013193 (2001)","DOI":"10.1137\/1.9780898718515.ch7"},{"key":"1_CR3","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1287\/ijoc.15.4.347.24896","volume":"15","author":"O Br\u00e4ysy","year":"2003","unstructured":"Br\u00e4ysy, O.: A reactive variable neighborhood search for the vehicle-routing problem with time windows. INFORMS J. Comput. 15, 347\u2013368 (2003)","journal-title":"INFORMS J. Comput."},{"key":"1_CR4","doi-asserted-by":"crossref","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, 1096\u20131107 (2010)","journal-title":"Appl. Soft Comput."},{"key":"1_CR5","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1016\/j.ejor.2007.05.055","volume":"189","author":"N Jozefowiez","year":"2008","unstructured":"Jozefowiez, N., Semet, F., Talbi, E.G.: Multi-objective vehicle routing problems. Eur. J. Oper. Res. 189, 293\u2013309 (2008)","journal-title":"Eur. J. Oper. Res."},{"key":"1_CR6","doi-asserted-by":"crossref","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, 254\u2013265 (1987)","journal-title":"Oper. Res."},{"key":"1_CR7","unstructured":"Br\u00e4ysy, O., Gendreau, M.: Metaheuristics for the vehicle routing problem with time windows. Report STF42 A 1025 (2001)"},{"key":"1_CR8","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1287\/ijoc.8.2.158","volume":"8","author":"JY Potvin","year":"1996","unstructured":"Potvin, J.Y., Kervahut, T., Garcia, B.L., Rousseau, J.M.: The vehicle routing problem with time windows part I: tabu search. INFORMS J. Comput. 8, 158\u2013164 (1996)","journal-title":"INFORMS J. Comput."},{"key":"1_CR9","doi-asserted-by":"crossref","first-page":"480","DOI":"10.1016\/0377-2217(94)00064-J","volume":"86","author":"A Breedam Van","year":"1995","unstructured":"Van Breedam, A.: Improvement heuristics for the vehicle routing problem based on simulated annealing. Eur. J. Oper. Res. 86, 480\u2013490 (1995)","journal-title":"Eur. J. Oper. Res."},{"key":"1_CR10","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/s10479-009-0657-6","volume":"175","author":"P Hansen","year":"2010","unstructured":"Hansen, P., Mladenovi\u0107, N., P\u00e9rez, J.A.M.: Variable neighbourhood search: methods and applications. Ann. Oper. Res. 175, 367\u2013407 (2010)","journal-title":"Ann. Oper. Res."},{"key":"1_CR11","doi-asserted-by":"crossref","first-page":"1097","DOI":"10.1016\/S0305-0548(97)00031-2","volume":"24","author":"N Mladenovi\u0107","year":"1997","unstructured":"Mladenovi\u0107, N., Hansen, P.: Variable neighborhood search. Comput. Oper. Res. 24, 1097\u20131100 (1997)","journal-title":"Comput. Oper. Res."},{"key":"1_CR12","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1016\/S0031-3203(99)00216-2","volume":"34","author":"P Hansen","year":"2001","unstructured":"Hansen, P., Mladenovi\u0107, N.: J-means: a new local search heuristic for minimum sum of squares clustering. Pattern Recogn. 34, 405\u2013413 (2001)","journal-title":"Pattern Recogn."},{"key":"1_CR13","doi-asserted-by":"crossref","first-page":"335","DOI":"10.1023\/A:1011336210885","volume":"7","author":"P Hansen","year":"2001","unstructured":"Hansen, P., Mladenovi\u0107, N., Perez-Britos, D.: Variable neighborhood decomposition search. J. Heuristics 7, 335\u2013350 (2001)","journal-title":"J. Heuristics"},{"key":"1_CR14","doi-asserted-by":"crossref","first-page":"3034","DOI":"10.1016\/j.cor.2005.02.033","volume":"33","author":"P Hansen","year":"2006","unstructured":"Hansen, P., Mladenovi\u0107, N., Uro\u015bevi\u0107, D.: Variable neighborhood search and local branching. Comput. Oper. Res. 33, 3034\u20133045 (2006)","journal-title":"Comput. Oper. Res."},{"key":"1_CR15","doi-asserted-by":"crossref","first-page":"613","DOI":"10.1007\/s10732-005-5432-5","volume":"10","author":"M Polacek","year":"2004","unstructured":"Polacek, M., Hartl, R.F., Doerner, K., Reimann, M.: A variable neighborhood search for the multi depot vehicle routing problem with time windows. J. Heuristics 10, 613\u2013627 (2004)","journal-title":"J. Heuristics"},{"key":"1_CR16","doi-asserted-by":"crossref","first-page":"803","DOI":"10.1016\/j.ejor.2007.06.064","volume":"195","author":"K Fleszar","year":"2009","unstructured":"Fleszar, K., Osman, I.H., Hindi, K.S.: A variable neighbourhood search algorithm for the open vehicle routing problem. Eur. J. Oper. Res. 195, 803\u2013809 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"1_CR17","doi-asserted-by":"crossref","first-page":"791","DOI":"10.1016\/j.ejor.2007.08.048","volume":"195","author":"VC Hemmelmayr","year":"2009","unstructured":"Hemmelmayr, V.C., Doerner, K.F., Hartl, R.F.: A variable neighborhood search heuristic for periodic routing problems. Eur. J. Oper. Res. 195, 791\u2013802 (2009)","journal-title":"Eur. J. Oper. Res."},{"key":"1_CR18","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S Lin","year":"1965","unstructured":"Lin, S.: Computer solutions of the traveling salesman problem. Bell Syst. Tech. J. 44, 2245\u20132269 (1965)","journal-title":"Bell Syst. Tech. J."},{"key":"1_CR19","unstructured":"Or, I.: Traveling salesman-type combinatorial problems and their relation to the logistics of regional blood banking. Xerox University Microfilms (1976)"},{"key":"1_CR20","doi-asserted-by":"crossref","first-page":"421","DOI":"10.1007\/BF02023004","volume":"41","author":"IH Osman","year":"1993","unstructured":"Osman, I.H.: Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem. Ann. Oper. Res. 41, 421\u2013451 (1993)","journal-title":"Ann. Oper. Res."},{"key":"1_CR21","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1287\/trsc.31.2.170","volume":"31","author":"A Taillard","year":"1997","unstructured":"Taillard, A., Badeau, P., Gendreau, M., Guertin, F.A., Potvin, J.Y.: A tabu search heuristic for the vehicle routing problem with soft time windows. Transp. Sci. 31, 170\u2013186 (1997)","journal-title":"Transp. Sci."},{"key":"1_CR22","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10732-006-5561-5","volume":"12","author":"\u00d6 Ergun","year":"2006","unstructured":"Ergun, \u00d6., Orlin, J.B., Steele-Feldman, A.: Creating very large scale neighborhoods out of smaller ones by compounding moves. J. Heuristics 12, 115\u2013140 (2006)","journal-title":"J. Heuristics"},{"key":"1_CR23","doi-asserted-by":"crossref","first-page":"1447","DOI":"10.1287\/mnsc.44.10.1447","volume":"44","author":"C Rego","year":"1998","unstructured":"Rego, C.: A subpath ejection method for the vehicle routing problem. Manag. Sci. 44, 1447\u20131459 (1998)","journal-title":"Manag. Sci."},{"key":"1_CR24","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1006\/jcph.1993.1010","volume":"104","author":"G Dueck","year":"1993","unstructured":"Dueck, G.: New optimization heuristics: the great deluge algorithm and the record-to-record travel. J. Comput. Phys. 104, 86\u201392 (1993)","journal-title":"J. Comput. Phys."},{"key":"1_CR25","unstructured":"SINTEF: Best known solution values for solomon benchmark (2015). http:\/\/www.sintef.no\/Projectweb\/TOP\/VRPTW\/Solomon-benchmark\/100-customers\/"},{"key":"1_CR26","doi-asserted-by":"crossref","first-page":"1561","DOI":"10.1016\/j.cor.2005.07.025","volume":"34","author":"GB Alvarenga","year":"2007","unstructured":"Alvarenga, G.B., Mateus, G.R., De Tomi, G.: A genetic and set partitioning two-phase approach for the vehicle routing problem with time windows. Comput. Oper. Res. 34, 1561\u20131584 (2007)","journal-title":"Comput. Oper. Res."},{"key":"1_CR27","doi-asserted-by":"crossref","first-page":"115","DOI":"10.1007\/s10589-005-3070-3","volume":"34","author":"K Tan","year":"2006","unstructured":"Tan, K., Chew, Y., Lee, L.: 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_CR28","doi-asserted-by":"crossref","unstructured":"K\u00fc\u00e7\u00fcko\u011flu, \u0130., \u00d6zt\u00fcrk, N.: An advanced hybrid meta-heuristic algorithm for the vehicle routing problem with backhauls and time windows. Comput. Ind. Eng. 86, 60\u201368 (2014)","DOI":"10.1016\/j.cie.2014.10.014"},{"key":"1_CR29","doi-asserted-by":"crossref","first-page":"1464","DOI":"10.1016\/j.cor.2004.11.002","volume":"33","author":"B Kallehauge","year":"2006","unstructured":"Kallehauge, B., Larsen, J., Madsen, O.B.: Lagrangian duality applied to the vehicle routing problem with time windows. Comput. Oper. Res. 33, 1464\u20131487 (2006)","journal-title":"Comput. Oper. Res."},{"key":"1_CR30","unstructured":"Cook, W., Rich, J.L.: A parallel cutting-plane algorithm for the vehicle routing problem with time windows. Computational and Applied Mathematics Department, Rice University, Houston, TX, Technical report (1999)"},{"key":"1_CR31","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/s10489-006-6926-z","volume":"24","author":"B Ombuki","year":"2006","unstructured":"Ombuki, B., Ross, B.J., Hanshar, F.: Multi-objective genetic algorithms for vehicle routing problem with time windows. Appl. Intell. 24, 17\u201330 (2006)","journal-title":"Appl. Intell."},{"key":"1_CR32","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1287\/ijoc.9.4.417","volume":"9","author":"WC Chiang","year":"1997","unstructured":"Chiang, W.C., Russell, R.A.: A reactive tabu search metaheuristic for the vehicle routing problem with time windows. INFORMS J. Comput. 9, 417\u2013430 (1997)","journal-title":"INFORMS J. Comput."},{"key":"1_CR33","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y Rochat","year":"1995","unstructured":"Rochat, Y., Taillard, \u00c9.D.: Probabilistic diversification and intensification in local search for vehicle routing. J. Heuristics 1, 147\u2013167 (1995)","journal-title":"J. Heuristics"},{"key":"1_CR34","doi-asserted-by":"crossref","first-page":"5375","DOI":"10.1016\/j.asoc.2011.05.021","volume":"11","author":"Z Ursani","year":"2011","unstructured":"Ursani, Z., Essam, D., Cornforth, D., Stocker, R.: Localized genetic algorithm for vehicle routing problem with time windows. Appl. Soft Comput. 11, 5375\u20135390 (2011)","journal-title":"Appl. Soft Comput."}],"container-title":["Communications in Computer and Information Science","Operations Research and Enterprise Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-53982-9_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T17:29:40Z","timestamp":1568827780000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-53982-9_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319539812","9783319539829"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-53982-9_1","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2017]]}}}