{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,14]],"date-time":"2026-02-14T02:13:28Z","timestamp":1771035208266,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540755135","type":"print"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-75514-2_2","type":"book-chapter","created":{"date-parts":[[2007,9,19]],"date-time":"2007-09-19T06:34:24Z","timestamp":1190183664000},"page":"16-30","source":"Crossref","is-referenced-by-count":31,"title":["An Effective Memetic Algorithm with Population Management for the Split Delivery Vehicle Routing Problem"],"prefix":"10.1007","author":[{"given":"Mourad","family":"Boudia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christian","family":"Prins","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohamed","family":"Reghioui","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"2_CR1","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1287\/trsc.1040.0103","volume":"40","author":"C. Archetti","year":"2006","unstructured":"Archetti, C., Hertz, A., Speranza, M.G.: A tabu search algorithm for the split delivery vehicle routing problem. Transportation Science\u00a040(1), 64\u201373 (2006)","journal-title":"Transportation Science"},{"issue":"2","key":"2_CR2","doi-asserted-by":"publisher","first-page":"226","DOI":"10.1287\/trsc.1050.0117","volume":"40","author":"C. Archetti","year":"2006","unstructured":"Archetti, C., Savelsbergh, M.W.P., Speranza, M.G.: Worst-case analysis for split delivery vehicle routing problems. Transportation Science\u00a040(2), 226\u2013234 (2006)","journal-title":"Transportation Science"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Archetti, C., Savelsbergh, M.W.P., Speranza, M.G.: To split or not to split: that is the question. Transportation Research Economics (to appear)","DOI":"10.1016\/j.tre.2006.04.003"},{"issue":"5","key":"2_CR4","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1287\/opre.48.5.801.12407","volume":"48","author":"J.M. Belenguer","year":"2000","unstructured":"Belenguer, J.M., Martinez, M.C., Mota, E.: A lower bound for the split delivery vehicle routing problem. Operations Research\u00a048(5), 801\u2013810 (2000)","journal-title":"Operations Research"},{"key":"2_CR5","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1287\/ijoc.1030.0057","volume":"17","author":"V. Campos","year":"2005","unstructured":"Campos, V., Mart\u00ed, R., Laguna, M.: Context-independent scatter search and tabu search for permutation problems. INFORMS Journal on Computing\u00a017, 111\u2013122 (2005)","journal-title":"INFORMS Journal on Computing"},{"key":"2_CR6","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_CR7","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/0-387-24977-X_9","volume-title":"Logistic systems: design and optimization","author":"J.F. Cordeau","year":"2005","unstructured":"Cordeau, J.F., Gendreau, M., Hertz, A., Laporte, G., Sormany, J.S.: New heuristics for the vehicle routing problem. In: Langevin, A., Riopel, D. (eds.) Logistic systems: design and optimization, pp. 279\u2013298. Wiley, Chichester (2005)"},{"key":"2_CR8","doi-asserted-by":"publisher","first-page":"239","DOI":"10.1016\/0166-218X(92)00172-I","volume":"50","author":"M. Dror","year":"1994","unstructured":"Dror, M., Laporte, G., Trudeau, P.: Vehicle routing with split deliveries. Discrete Applied Mathematics\u00a050, 239\u2013254 (1994)","journal-title":"Discrete Applied Mathematics"},{"key":"2_CR9","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1287\/trsc.23.2.141","volume":"23","author":"M. Dror","year":"1989","unstructured":"Dror, M., Trudeau, P.: Savings by split delivery routing. Transportation Science\u00a023, 141\u2013145 (1989)","journal-title":"Transportation Science"},{"key":"2_CR10","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1002\/nav.3800370304","volume":"37","author":"M. Dror","year":"1990","unstructured":"Dror, M., Trudeau, P.: Split delivery routing. Naval Research Logistics\u00a037, 383\u2013402 (1990)","journal-title":"Naval Research Logistics"},{"key":"2_CR11","unstructured":"Feillet, D., Dejax, P., Gendreau, M., Gueguen, C.: Vehicle routing with time windows and split deliveries. In: Proceedings of Odysseus 2003, Palermo (May 2003)"},{"issue":"6","key":"2_CR12","doi-asserted-by":"publisher","first-page":"655","DOI":"10.1016\/0305-0548(94)00040-F","volume":"22","author":"P.W. Frizzell","year":"1995","unstructured":"Frizzell, P.W., Giffin, J.W.: The split delivery vehicle scheduling problem with time windows and grid network distances. Computers and Operations Research\u00a022(6), 655\u2013667 (1995)","journal-title":"Computers and Operations Research"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"491","DOI":"10.1007\/s10107-005-0644-x","volume":"106","author":"R. Fukasawa","year":"2006","unstructured":"Fukasawa, R., Lysgaard, J., de Arag\u00e3o, M.P., Reis, M., Uchoa, E., Werneck, R.F.: Robust branch-and-cut-and-price for the capacitated vehicle routing problem. Mathematical Programming\u00a0106, 491\u2013511 (2006)","journal-title":"Mathematical Programming"},{"key":"2_CR14","doi-asserted-by":"crossref","first-page":"1276","DOI":"10.1287\/mnsc.40.10.1276","volume":"40","author":"M. Gendreau","year":"1994","unstructured":"Gendreau, M., Hertz, A., Laporte, G.: A tabu search heuristic for the vehicle routing problem. Management Science\u00a040, 1276\u20131290 (1994)","journal-title":"Management Science"},{"key":"2_CR15","doi-asserted-by":"crossref","first-page":"340","DOI":"10.1287\/opre.22.2.340","volume":"22","author":"B.E. Gillett","year":"1974","unstructured":"Gillett, B.E., Miller, L.R.: A heuristic algorithm for the vehicle dispatch problem. Operations Research\u00a022, 340\u2013349 (1974)","journal-title":"Operations Research"},{"key":"2_CR16","first-page":"219","volume-title":"New ideas in optimization","author":"P. Moscato","year":"1999","unstructured":"Moscato, P.: Memetic algorithms: a short introduction. In: Corne, D., Dorigo, M., Glover, F. (eds.) New ideas in optimization, pp. 219\u2013234. McGraw-Hill, New York (1999)"},{"key":"2_CR17","doi-asserted-by":"publisher","first-page":"107","DOI":"10.2307\/3010350","volume":"48","author":"P.A. Mullaseril","year":"1997","unstructured":"Mullaseril, P.A., Dror, M., Leung, J.: Split-delivery routing heuristics in livestock feed distribution. Journal of Operational Research Society\u00a048, 107\u2013116 (1997)","journal-title":"Journal of Operational Research Society"},{"key":"2_CR18","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_CR19","unstructured":"Prins, C., Sevaux, M., S\u00f6rensen, K.: A genetic algorithm with population management (GA|PM) for the CARP. In: 5th Triennal Symposium on Transportation Analysis (Tristan V), Le Gosier, Guadeloupe (2004)"},{"key":"2_CR20","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G. Reinelt","year":"1991","unstructured":"Reinelt, G.: Tsplib-travelling salesman problem library. ORSAJ. Comput.\u00a03, 376\u2013384 (1991)","journal-title":"ORSAJ. Comput."},{"key":"2_CR21","unstructured":"S\u00f6rensen, K.: A framework for robust and flexible optimisation using metaheuristics with applications in supply chain design. PhD thesis, University of Antwerp, Belgium (2003)"},{"key":"2_CR22","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"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Toth, P., Vigo, D.: The vehicle routing problem. SIAM, Philadelphia (2002)","DOI":"10.1137\/1.9780898718515"}],"container-title":["Lecture Notes in Computer Science","Hybrid Metaheuristics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75514-2_2.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:22:34Z","timestamp":1619504554000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75514-2_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540755135"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75514-2_2","relation":{},"subject":[]}}