{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T11:40:28Z","timestamp":1725795628654},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319076430"},{"type":"electronic","value":"9783319076447"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-07644-7_14","type":"book-chapter","created":{"date-parts":[[2014,6,4]],"date-time":"2014-06-04T21:27:11Z","timestamp":1401917231000},"page":"183-197","source":"Crossref","is-referenced-by-count":8,"title":["Speeding Up Logic-Based Benders\u2019 Decomposition by a Metaheuristic for a Bi-Level Capacitated Vehicle Routing Problem"],"prefix":"10.1007","author":[{"given":"G\u00fcnther R.","family":"Raidl","sequence":"first","affiliation":[]},{"given":"Thomas","family":"Baumhauer","sequence":"additional","affiliation":[]},{"given":"Bin","family":"Hu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/BF01386316","volume":"4","author":"J.F. Benders","year":"1962","unstructured":"Benders, J.F.: Partitioning procedures for solving mixed-variables programming problems. Numerische Mathematik\u00a04, 238\u2013252 (1962)","journal-title":"Numerische Mathematik"},{"issue":"4","key":"14_CR2","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/BF00934810","volume":"10","author":"A.M. Geoffrion","year":"1972","unstructured":"Geoffrion, A.M.: Generalized Benders decomposition. Journal of Optimization Theory and Applications\u00a010(4), 237\u2013260 (1972)","journal-title":"Journal of Optimization Theory and Applications"},{"key":"14_CR3","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/s10107-003-0375-9","volume":"96","author":"J.N. Hooker","year":"2003","unstructured":"Hooker, J.N., Ottosson, G.: Logic-based benders decomposition. Mathematical Programming\u00a096, 33\u201360 (2003)","journal-title":"Mathematical Programming"},{"issue":"3","key":"14_CR4","doi-asserted-by":"publisher","first-page":"588","DOI":"10.1287\/opre.1060.0371","volume":"55","author":"J.N. Hooker","year":"2007","unstructured":"Hooker, J.N.: Planning and scheduling by logic-based Benders decomposition. Operations Research\u00a055(3), 588\u2013602 (2007)","journal-title":"Operations Research"},{"issue":"1","key":"14_CR5","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.ejor.2008.10.033","volume":"199","author":"C.A. Poojari","year":"2009","unstructured":"Poojari, C.A., Beasley, J.E.: Improving Benders decomposition using a genetic algorithm. European Journal of Operational Research\u00a0199(1), 89\u201397 (2009)","journal-title":"European Journal of Operational Research"},{"issue":"12","key":"14_CR6","doi-asserted-by":"publisher","first-page":"8599","DOI":"10.1016\/j.eswa.2010.06.104","volume":"37","author":"M.C. Lai","year":"2010","unstructured":"Lai, M.C., Sohn, H.S., Tseng, T.L., Chiang, C.: A hybrid algorithm for capacitated plant location problem. Expert Systems with Applications\u00a037(12), 8599\u20138605 (2010)","journal-title":"Expert Systems with Applications"},{"key":"14_CR7","doi-asserted-by":"crossref","unstructured":"Lai, M.C., Sohn, H.S.: Using a genetic algorithm to solve the Benders master problem for capacitated plant location. In: Gao, S. (ed.) Bio-Inspired Computational Algorithms and Their Applications, pp. 405\u2013420. InTech (2012)","DOI":"10.5772\/36069"},{"issue":"1","key":"14_CR8","first-page":"33","volume":"19","author":"M.C. Lai","year":"2012","unstructured":"Lai, M.C., Sohn, H.S., Tseng, T.L., Bricker, D.L.: A hybrid Benders\/genetic algorithm for vehicle routing and scheduling problem. International Journal of Industrial Engineering\u00a019(1), 33\u201346 (2012)","journal-title":"International Journal of Industrial Engineering"},{"issue":"2","key":"14_CR9","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1287\/ijoc.1080.0296","volume":"21","author":"W. Rei","year":"2008","unstructured":"Rei, W., Cordeau, J.F., Gendreau, M., Soriano, P.: Accelerating Benders decomposition by local branching. INFORMS Journal on Computing\u00a021(2), 333\u2013345 (2008)","journal-title":"INFORMS Journal on Computing"},{"issue":"3","key":"14_CR10","doi-asserted-by":"publisher","first-page":"643","DOI":"10.1137\/S1052623497318700","volume":"10","author":"G. Zakeri","year":"1999","unstructured":"Zakeri, G., Philpott, A.B., Ryan, D.M.: Inexact cuts in Benders decomposition. SIAM Journal on Optimization\u00a010(3), 643\u2013657 (1999)","journal-title":"SIAM Journal on Optimization"},{"issue":"3","key":"14_CR11","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1287\/trsc.1110.0368","volume":"45","author":"G. Perboli","year":"2011","unstructured":"Perboli, G., Tadei, R., Vigo, D.: The two-echelon capacitated vehicle routing problem: Models and math-based heuristics. Transportation Science\u00a045(3), 364\u2013380 (2011)","journal-title":"Transportation Science"},{"issue":"12","key":"14_CR12","doi-asserted-by":"publisher","first-page":"3215","DOI":"10.1016\/j.cor.2012.04.007","volume":"39","author":"V.C. Hemmelmayr","year":"2012","unstructured":"Hemmelmayr, V.C., Cordeau, J.F., Crainic, T.G.: An adaptive large neighborhood search heuristic for two-echelon vehicle routing problems arising in city logistics. Computers and Operations Research\u00a039(12), 3215\u20133228 (2012)","journal-title":"Computers and Operations Research"},{"key":"14_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1007\/978-3-642-29124-1_2","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"M. Schwengerer","year":"2012","unstructured":"Schwengerer, M., Pirkwieser, S., Raidl, G.R.: A variable neighborhood search approach for the two-echelon location-routing problem. In: Hao, J.-K., Middendorf, M. (eds.) EvoCOP 2012. LNCS, vol.\u00a07245, pp. 13\u201324. Springer, Heidelberg (2012)"},{"key":"14_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"179","DOI":"10.1007\/978-3-642-20364-0_16","volume-title":"EvoCOP 2011","author":"T.G. Crainic","year":"2011","unstructured":"Crainic, T.G., Mancini, S., Perboli, G., Tadei, R.: Multi-start heuristics for the two-echelon vehicle routing problem. In: Hao, J.-K. (ed.) EvoCOP 2011. LNCS, vol.\u00a06622, pp. 179\u2013190. Springer, Heidelberg (2011)"},{"issue":"6","key":"14_CR15","doi-asserted-by":"publisher","first-page":"378","DOI":"10.1016\/0377-2217(80)90124-1","volume":"5","author":"S.K. Jacobsen","year":"1980","unstructured":"Jacobsen, S.K., Madsen, O.B.G.: A comparative study of heuristics for a two-level routing-location problem. European Journal of Operational Research\u00a05(6), 378\u2013387 (1980)","journal-title":"European Journal of Operational Research"},{"key":"14_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"288","DOI":"10.1007\/978-3-642-13193-6_25","volume-title":"Experimental Algorithms","author":"M. Boccia","year":"2010","unstructured":"Boccia, M., Crainic, T., Sforza, A., Sterle, C.: A metaheuristic for a two echelon location-routing problem. In: Festa, P. (ed.) SEA 2010. LNCS, vol.\u00a06049, pp. 288\u2013301. Springer, Heidelberg (2010)"},{"key":"14_CR17","unstructured":"Boccia, M., Crainic, T.G., Sforza, A., Sterle, C.: Location-routing models for designing a two-echelon freight distribution system. Technical Report CIRRELT-2011-06, University of Montreal (2011)"},{"issue":"2","key":"14_CR18","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1002\/net.3230110205","volume":"11","author":"M.L. Fisher","year":"1981","unstructured":"Fisher, M.L., Jaikumar, R.: A generalized assignment heuristic for vehicle routing. Networks\u00a011(2), 109\u2013124 (1981)","journal-title":"Networks"},{"key":"14_CR19","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1007\/s10732-007-9064-9","volume":"15","author":"M. Boschetti","year":"2009","unstructured":"Boschetti, M., Maniezzo, V.: Benders decomposition, Lagrangian relaxation and metaheuristic design. Journal of Heuristics\u00a015, 283\u2013312 (2009)","journal-title":"Journal of Heuristics"},{"issue":"2","key":"14_CR20","doi-asserted-by":"publisher","first-page":"365","DOI":"10.1007\/s10107-005-0611-6","volume":"106","author":"H. Yaman","year":"2006","unstructured":"Yaman, H.: Formulations and valid inequalities for the heterogeneous vehicle routing problem. Mathematical Programming\u00a0106(2), 365\u2013390 (2006)","journal-title":"Mathematical Programming"},{"key":"14_CR21","doi-asserted-by":"crossref","unstructured":"Pirkwieser, S., Raidl, G.R.: A variable neighborhood search for the periodic vehicle routing problem with time windows. In: Prodhon, C., et al. (eds.) Proceedings of the 9th EU\/MEeting on Metaheuristics for Logistics and Vehicle Routing, Troyes, France (2008)","DOI":"10.1007\/978-3-642-04918-7_4"},{"issue":"4","key":"14_CR22","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G. Clarke","year":"1964","unstructured":"Clarke, G., Wright, J.W.: Scheduling of vehicles from a central depot to a number of delivery points. Operations Research\u00a012(4), 568\u2013581 (1964)","journal-title":"Operations Research"},{"issue":"11","key":"14_CR23","doi-asserted-by":"publisher","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. Computers and Operations Research\u00a024(11), 1097\u20131100 (1997)","journal-title":"Computers and Operations Research"}],"container-title":["Lecture Notes in Computer Science","Hybrid Metaheuristics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-07644-7_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,27]],"date-time":"2019-05-27T00:16:06Z","timestamp":1558916166000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-07644-7_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319076430","9783319076447"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-07644-7_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}