{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,4,9]],"date-time":"2025-04-09T11:30:57Z","timestamp":1744198257360},"publisher-location":"Berlin, Heidelberg","reference-count":30,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642049170"},{"type":"electronic","value":"9783642049187"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-04918-7_2","type":"book-chapter","created":{"date-parts":[[2009,10,6]],"date-time":"2009-10-06T06:08:27Z","timestamp":1254809307000},"page":"15-29","source":"Crossref","is-referenced-by-count":9,"title":["An ELSxPath Relinking Hybrid for the Periodic Location-Routing Problem"],"prefix":"10.1007","author":[{"given":"Caroline","family":"Prodhon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"unstructured":"http:\/\/neo.lcc.uma.es\/radi-aeb\/WebVRP\/ (2007)","key":"2_CR1"},{"key":"2_CR2","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1016\/S0305-0548(03)00245-4","volume":"32","author":"M. Albareda-Sambola","year":"2005","unstructured":"Albareda-Sambola, M., D\u00edaz, J.A., Fern\u00e1ndez, E.: A compact model and tight bounds for a combined location-routing problem. Computers and Operations Research\u00a032, 407\u2013428 (2005)","journal-title":"Computers and Operations Research"},{"doi-asserted-by":"crossref","unstructured":"Belenguer, J.M., Benavent, E., Prins, C., Prodhon, C., Wolfler-Calvo, R.: A cutting plane method for the capacitated location-routing problem. In: Odysseus 2006 - Third International Workshop on Freight Transportation and Logistics, Altea, Spain, May 2006, pp. 50\u201352 (2006)","key":"2_CR3","DOI":"10.1109\/ICSSSM.2006.320765"},{"doi-asserted-by":"crossref","unstructured":"Boudia, M., Louly, M.A.O., Prins, C.: A memetic algorithm with population management for a production-distribution problem. In: Dolgui, A., Morel, G., Pereira, C.E. (eds.) Preprints of the 12th IFAC Symposium on Information Control Problems in Manufacturing INCOM 2006, Saint Etienne-France, May 2006, vol.\u00a03, pp. 541\u2013546 (2006)","key":"2_CR4","DOI":"10.3182\/20060517-3-FR-2903.00280"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1002\/net.3230260104","volume":"26","author":"M. Chao","year":"1995","unstructured":"Chao, M., Golden, B.L., Wasil, E.: An improved heuristic for the periodic vehicle routing problem. Networks\u00a026, 25\u201344 (1995)","journal-title":"Networks"},{"key":"2_CR6","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1002\/net.3230140205","volume":"14","author":"N. Christofides","year":"1984","unstructured":"Christofides, N., Beasley, J.E.: The period routing problem. Networks\u00a014, 237\u2013256 (1984)","journal-title":"Networks"},{"key":"2_CR7","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, 568\u2013581 (1964)","journal-title":"Operations Research"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1002\/(SICI)1097-0037(199709)30:2<105::AID-NET5>3.0.CO;2-G","volume":"30","author":"J.F. Cordeau","year":"1997","unstructured":"Cordeau, J.F., Gendreau, M., Laporte, G.: A tabu search heuristic for periodic and multi-depot vehicle routing problems. Networks\u00a030, 105\u2013119 (1997)","journal-title":"Networks"},{"key":"2_CR9","first-page":"653","volume":"39","author":"F. Glover","year":"2000","unstructured":"Glover, F., Laguna, M., Mart\u00ed, R.: Fundamentals of Scatter Search and Path Relinking. Control and Cybernetics\u00a039, 653\u2013684 (2000)","journal-title":"Control and Cybernetics"},{"issue":"3","key":"2_CR10","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":"2_CR11","first-page":"283","volume":"44","author":"G. Laporte","year":"1984","unstructured":"Laporte, G., Norbert, Y., Arpin, D.: Optimal solutions to capacitated multi-depot vehicle routing problems. Congressus Numerantium\u00a044, 283\u2013292 (1984)","journal-title":"Congressus Numerantium"},{"key":"2_CR12","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.endm.2004.06.027","volume":"18","author":"C.M.R.R. Lima","year":"2004","unstructured":"Lima, C.M.R.R., Goldbarg, M.C., Goldbarg, E.F.G.: A memetic algorithm for heterogeneous fleet vehicle routing problem. Electronic Notes in Discrete Mathematics\u00a018, 171\u2013176 (2004)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"2_CR13","first-page":"321","volume-title":"Handbook of Metaheuristics","author":"H.R. Louren\u00e7o","year":"2003","unstructured":"Louren\u00e7o, H.R., Martin, O., St\u00fctzle, T.: Iterated Local Search. In: Glover, F., Kochenberger, G. (eds.) Handbook of Metaheuristics, pp. 321\u2013353. Kluwer, Boston (2003)"},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/S0377-2217(97)00172-0","volume":"108","author":"H. Min","year":"1998","unstructured":"Min, H., Jayaraman, V., Srivastava, R.: Combined location-routing problems: a synthesis and future research directions. European Journal of Operational Research\u00a0108, 1\u201315 (1998)","journal-title":"European Journal of Operational Research"},{"unstructured":"Mingozzi, A., Valletta, A.: An exact algorithm for period and multi-depot vehicle routing problems. In: Odysseus 2003 - Second International Workshop on Freight Transportation and Logistics, Palermo, Italy (May 2003)","key":"2_CR15"},{"key":"2_CR16","doi-asserted-by":"publisher","first-page":"1985","DOI":"10.1016\/S0305-0548(03)00158-8","volume":"31","author":"C. Prins","year":"2004","unstructured":"Prins, C.: A simple and effective evolutionary algorithm for the vehicle routing problem. Computers and Operations Research\u00a031, 1985\u20132002 (2004)","journal-title":"Computers and Operations Research"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/978-3-540-85152-3_2","volume-title":"Bio-inspired Algorithms for the Vehicle Routing Problem, Studies in Computational Intelligence","author":"C. Prins","year":"2009","unstructured":"Prins, C.: A GRASP \u00d7 Evolutionary Local Search Hybrid for the Vehicle Routing Problem. In: Bio-inspired Algorithms for the Vehicle Routing Problem, Studies in Computational Intelligence, pp. 35\u201353. Springer, Berlin (2009)"},{"key":"2_CR18","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., Wolfler-Calvo, R.: 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":"2_CR19","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., Wolfler-Calvo, R.: Solving the capacitated location-routing problem by a GRASP complemented by a learning process and a path relinking. 4OR - A Quarterly Journal of Operations Research\u00a04, 221\u2013238 (2006)","journal-title":"4OR - A Quarterly Journal of Operations Research"},{"issue":"4","key":"2_CR20","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., Wolfler-Calvo, R.: 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"},{"unstructured":"Prodhon, C.: http:\/\/prodhonc.free.fr\/homepage (2007)","key":"2_CR21"},{"unstructured":"Prodhon, C.: An iterative metaheurtistic for the periodic location-routing problem. In: GOR 2007, Saarbr\u00fccken (September 2007)","key":"2_CR22"},{"key":"2_CR23","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)"},{"unstructured":"Prodhon, C.: An evolutionary algorithm for the periodic location-routing problem. In: Odysseus 2009 - Third International Workshop on Freight Transportation and Logistics, Cesme, Turkey, May 2009, pp. 43\u201357 (2009)","key":"2_CR24"},{"key":"2_CR25","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, 150\u2013156 (1989)","journal-title":"European Journal of Operational Research"},{"key":"2_CR26","doi-asserted-by":"publisher","first-page":"1214","DOI":"10.1016\/j.cor.2004.09.011","volume":"33","author":"K. S\u00f6rensen","year":"2006","unstructured":"S\u00f6rensen, K., Sevaux, M.: MA | PM: memetic algorithms with population management. Computers and Operations Research\u00a033, 1214\u20131225 (2006)","journal-title":"Computers and Operations Research"},{"issue":"5","key":"2_CR27","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1016\/0305-0483(84)90050-1","volume":"12","author":"C.C.R. Tan","year":"1984","unstructured":"Tan, C.C.R., Beasley, J.E.: A heuristic algorithm for the periodic vehicle routing problem. OMEGA International Journal of Management Science\u00a012(5), 497\u2013504 (1984)","journal-title":"OMEGA International Journal of Management Science"},{"key":"2_CR28","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/S0377-2217(98)00107-6","volume":"116","author":"D. Tuzun","year":"1999","unstructured":"Tuzun, D., Burke, L.I.: A two-phase tabu search approach to the location routing problem. European Journal of Operational Research\u00a0116, 87\u201399 (1999)","journal-title":"European Journal of Operational Research"},{"key":"2_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-540-75514-2_1","volume-title":"Hybrid Metaheuristics","author":"S. Wolf","year":"2007","unstructured":"Wolf, S., Merz, P.: Evolutionary local search for the super-peer selection problem and the p-hub median problem. In: Bartz-Beielstein, T., Blesa Aguilera, M.J., Blum, C., Naujoks, B., Roli, A., Rudolph, G., Sampels, M. (eds.) HCI\/ICCV 2007. LNCS, vol.\u00a04771, pp. 1\u201315. Springer, Heidelberg (2007)"},{"key":"2_CR30","doi-asserted-by":"publisher","first-page":"1393","DOI":"10.1016\/S0305-0548(01)00038-7","volume":"29","author":"T.H. Wu","year":"2002","unstructured":"Wu, T.H., Low, C., Bai, J.W.: Heuristic solutions to multi-depot location-routing problems. Computers and Operations Research\u00a029, 1393\u20131415 (2002)","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-642-04918-7_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,23]],"date-time":"2019-05-23T01:13:58Z","timestamp":1558574038000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04918-7_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642049170","9783642049187"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04918-7_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}