{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T13:08:13Z","timestamp":1776776893727,"version":"3.51.2"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642160530","type":"print"},{"value":"9783642160547","type":"electronic"}],"license":[{"start":{"date-parts":[[2010,1,1]],"date-time":"2010-01-01T00:00:00Z","timestamp":1262304000000},"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":[[2010]]},"DOI":"10.1007\/978-3-642-16054-7_13","type":"book-chapter","created":{"date-parts":[[2010,10,1]],"date-time":"2010-10-01T02:07:50Z","timestamp":1285898870000},"page":"174-189","source":"Crossref","is-referenced-by-count":27,"title":["Variable Neighborhood Search Coupled with ILP-Based Very Large Neighborhood Searches for the (Periodic) Location-Routing Problem"],"prefix":"10.1007","author":[{"given":"Sandro","family":"Pirkwieser","sequence":"first","affiliation":[]},{"given":"G\u00fcnther R.","family":"Raidl","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"2","key":"13_CR1","doi-asserted-by":"publisher","first-page":"150","DOI":"10.1016\/0377-2217(89)90188-4","volume":"39","author":"S. Salhi","year":"1989","unstructured":"Salhi, S., Rand, G.K.: The effect of ignoring routes when locating depots. European Journal of Operational Research\u00a039(2), 150\u2013156 (1989)","journal-title":"European Journal of Operational Research"},{"issue":"3","key":"13_CR2","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/s10288-006-0001-9","volume":"4","author":"C. Prins","year":"2006","unstructured":"Prins, C., Prodhon, C., Calvo, R.W.: Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking. 4OR\u00a04(3), 221\u2013238 (2006)","journal-title":"4OR"},{"key":"13_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/11730095_16","volume-title":"Evolutionary Computation in Combinatorial Optimization","author":"C. Prins","year":"2006","unstructured":"Prins, C., Prodhon, C., Calvo, R.W.: A memetic algorithm with population management (MA|PM) for the capacitated location-routing problem. In: Gottlieb, J., Raidl, G.R. (eds.) EvoCOP 2006. LNCS, vol.\u00a03906, pp. 183\u2013194. Springer, Heidelberg (2006)"},{"key":"13_CR4","unstructured":"Duhamel, C., Lacomme, P., Prins, C., Prodhon, C.: A memetic approach for the capacitated location routing problem. In: Prodhon, C., et al. (eds.) Proceedings of the 9th EU\/MEeting on Metaheuristics for Logistics and Vehicle Routing, Troyes, France (2008)"},{"issue":"11","key":"13_CR5","doi-asserted-by":"publisher","first-page":"1912","DOI":"10.1016\/j.cor.2009.07.004","volume":"37","author":"C. Duhamel","year":"2010","unstructured":"Duhamel, C., Lacomme, P., Prins, C., Prodhon, C.: A GRASP\u00d7ELS approach for the capacitated location-routing problem. Computers & OR\u00a037(11), 1912\u20131923 (2010)","journal-title":"Computers & OR"},{"issue":"4","key":"13_CR6","doi-asserted-by":"publisher","first-page":"470","DOI":"10.1287\/trsc.1060.0187","volume":"41","author":"C. Prins","year":"2007","unstructured":"Prins, C., Prodhon, C., Ruiz, A., Sorianoa, P., Calvo, R.W.: Solving the capacitated location-routing problem by a cooperative Lagrangean relaxation-granular tabu search heuristic. Transportation Science\u00a041(4), 470\u2013483 (2007)","journal-title":"Transportation Science"},{"issue":"2","key":"13_CR7","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1016\/j.ejor.2006.04.004","volume":"177","author":"G. Nagy","year":"2007","unstructured":"Nagy, G., Salhi, S.: Location-routing: Issues, models and methods. European Journal of Operational Research\u00a0177(2), 649\u2013672 (2007)","journal-title":"European Journal of Operational Research"},{"key":"13_CR8","first-page":"159","volume-title":"Proceedings of Operations Research 2007","author":"C. Prodhon","year":"2007","unstructured":"Prodhon, C.: A metaheuristic for the periodic location-routing problem. In: Kalcsics, J., Nickel, S. (eds.) Proceedings of Operations Research 2007, pp. 159\u2013164. Springer, Heidelberg (2007)"},{"key":"13_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-540-88439-2_4","volume-title":"Hybrid Metaheuristics","author":"C. Prodhon","year":"2008","unstructured":"Prodhon, C., Prins, C.: A memetic algorithm with population management (MA|PM) for the periodic location-routing problem. In: Blesa, M.J., Blum, C., Cotta, C., Fern\u00e1ndez, A.J., Gallardo, J.E., Roli, A., Sampels, M. (eds.) HM 2008. LNCS, vol.\u00a05296, pp. 43\u201357. Springer, Heidelberg (2008)"},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1007\/978-3-642-04918-7_2","volume-title":"Hybrid Metaheuristics","author":"C. Prodhon","year":"2009","unstructured":"Prodhon, C.: An ELS\u00d7path relinking hybrid for the periodic location-routing problem. In: Blesa, M.J., Blum, C., Gaspero, L.D., Roli, A., Sampels, M., Schaerf, A. (eds.) HM 2009. LNCS, vol.\u00a05818, pp. 15\u201329. Springer, Heidelberg (2009)"},{"issue":"3","key":"13_CR11","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1016\/j.ejor.2007.08.048","volume":"195","author":"V.C. Hemmelmayr","year":"2009","unstructured":"Hemmelmayr, V.C., Doerner, K.F., Hartl, R.F.: A variable neighborhood search heuristic for periodic routing problems. European Journal of Operational Research\u00a0195(3), 791\u2013802 (2009)","journal-title":"European Journal of Operational Research"},{"key":"13_CR12","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"},{"key":"13_CR13","doi-asserted-by":"publisher","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.F., Reimann, M.: A variable neighborhood search for the multi depot vehicle routing problem with time windows. Journal of Heuristics\u00a010, 613\u2013627 (2004)","journal-title":"Journal of Heuristics"},{"issue":"2-3","key":"13_CR14","doi-asserted-by":"publisher","first-page":"471","DOI":"10.1007\/s10107-005-0662-8","volume":"105","author":"R. De Franceschi","year":"2006","unstructured":"De Franceschi, R., Fischetti, M., Toth, P.: A new ILP-based refinement heuristic for vehicle routing problems. Math. Program.\u00a0105(2-3), 471\u2013499 (2006)","journal-title":"Math. Program."},{"key":"13_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-642-04918-7_4","volume-title":"Hybrid Metaheuristics","author":"S. Pirkwieser","year":"2009","unstructured":"Pirkwieser, S., Raidl, G.R.: Multiple variable neighborhood search enriched with ILP techniques for the periodic vehicle routing problem with time windows. In: Blesa, M.J., Blum, C., Di Gaspero, L., Roli, A., Sampels, M., Schaerf, A. (eds.) HM 2009. LNCS, vol.\u00a05818, pp. 45\u201359. Springer, Heidelberg (2009)"},{"key":"13_CR16","series-title":"SCI","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/978-3-540-78295-7_2","volume-title":"Hybrid Metaheuristics \u2013 An Emergent Approach for Combinatorial Optimization","author":"G.R. Raidl","year":"2008","unstructured":"Raidl, G.R., Puchinger, J.: Combining (integer) linear programming techniques and metaheuristics for combinatorial optimization. In: Blum, C., et al. (eds.) Hybrid Metaheuristics \u2013 An Emergent Approach for Combinatorial Optimization. SCI, vol.\u00a0114, pp. 31\u201362. Springer, Heidelberg (2008)"},{"key":"13_CR17","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/0-306-48056-5_6","volume-title":"Handbook of Metaheuristics","author":"P. Hansen","year":"2003","unstructured":"Hansen, P., Mladenovi\u0107, N.: Variable neighborhood search. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 145\u2013184. Kluwer Academic Publishers, Boston (2003)"},{"issue":"4","key":"13_CR18","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"},{"key":"13_CR19","doi-asserted-by":"publisher","first-page":"1433","DOI":"10.1057\/jors.1995.204","volume":"46","author":"J.Y. Potvin","year":"1995","unstructured":"Potvin, J.Y., Rousseau, J.M.: An exchange heuristic for routeing problems with time windows. Journal of the Operational Research Society\u00a046, 1433\u20131446 (1995)","journal-title":"Journal of the Operational Research Society"},{"issue":"4598","key":"13_CR20","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gelatt Jr., C.D., Vecchi, M.P.: Optimization by simulated annealing. Science\u00a0220(4598), 671\u2013680 (1983)","journal-title":"Science"},{"issue":"1-3","key":"13_CR21","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/S0166-218X(01)00338-9","volume":"123","author":"R.K. Ahuja","year":"2002","unstructured":"Ahuja, R.K., Ergun, \u00d6., Orlin, J.B., Punnen, A.P.: A survey of very large-scale neighborhood search techniques. Discrete Applied Mathematics\u00a0123(1-3), 75\u2013102 (2002)","journal-title":"Discrete Applied Mathematics"},{"key":"13_CR22","series-title":"Operations Research\/Computer Science Interfaces Series","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-0-387-88843-9_16","volume-title":"Operations Research and Cyber-Infrastructure","author":"Z. Akca","year":"2009","unstructured":"Akca, Z., Berger, R.T., Ralphs, T.K.: A branch-and-price algorithm for combined location and routing problems under capacity restrictions. In: Chinneck, J.W., et al. (eds.) Operations Research and Cyber-Infrastructure. Operations Research\/Computer Science Interfaces Series, vol.\u00a047, pp. 309\u2013330. Springer, Heidelberg (2009)"},{"key":"13_CR23","first-page":"1","volume-title":"Column Generation","author":"J. Desrosiers","year":"2005","unstructured":"Desrosiers, J., L\u00fcbbecke, M.E.: A primer in column generation. In: Desaulniers, G., et al. (eds.) Column Generation, pp. 1\u201332. Springer, Heidelberg (2005)"},{"issue":"1","key":"13_CR24","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1023\/A:1013661617536","volume":"8","author":"L.M. Rousseau","year":"2002","unstructured":"Rousseau, L.M., Gendreau, M., Pesant, G.: Using constraint-based operators to solve the vehicle routing problem with time windows. Journal of Heuristics\u00a08(1), 43\u201358 (2002)","journal-title":"Journal of Heuristics"},{"key":"13_CR25","unstructured":"Prodhon, C. (June 2010), http:\/\/prodhonc.free.fr\/"}],"container-title":["Lecture Notes in Computer Science","Hybrid Metaheuristics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-16054-7_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,12]],"date-time":"2020-06-12T08:20:33Z","timestamp":1591950033000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-16054-7_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642160530","9783642160547"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-16054-7_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010]]}}}