{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,5]],"date-time":"2026-01-05T22:14:50Z","timestamp":1767651290364},"reference-count":31,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[2011,5,18]],"date-time":"2011-05-18T00:00:00Z","timestamp":1305676800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comb Optim"],"published-print":{"date-parts":[[2012,11]]},"DOI":"10.1007\/s10878-011-9400-8","type":"journal-article","created":{"date-parts":[[2011,5,17]],"date-time":"2011-05-17T15:22:44Z","timestamp":1305645764000},"page":"437-458","source":"Crossref","is-referenced-by-count":27,"title":["Self-organizing maps in population based metaheuristic to the dynamic vehicle routing problem"],"prefix":"10.1007","volume":"24","author":[{"given":"Jean-Charles","family":"Cr\u00e9put","sequence":"first","affiliation":[]},{"given":"Amir","family":"Hajjam","sequence":"additional","affiliation":[]},{"given":"Abderrafiaa","family":"Koukam","sequence":"additional","affiliation":[]},{"given":"Olivier","family":"Kuhn","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,5,18]]},"reference":[{"key":"9400_CR1","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1016\/0893-6080(88)90002-0","volume":"1","author":"B Angeniol","year":"1988","unstructured":"Angeniol B, de\u00a0La Croix Vaubois G, Le Texier JY (1988) Self-organizing feature maps and the travelling salesman problem. Neural Netw 1:289\u2013293","journal-title":"Neural Netw"},{"key":"9400_CR2","first-page":"1362","volume-title":"Proceedings of the 18th international joint conference on artificial intelligence","author":"R Bent","year":"2003","unstructured":"Bent R, Van Hentenryck P (2003) Dynamic vehicle routing with stochastic requests. In: Proceedings of the 18th international joint conference on artificial intelligence, Acapulco, Mexico, pp 1362\u20131363"},{"key":"9400_CR3","doi-asserted-by":"crossref","first-page":"977","DOI":"10.1287\/opre.1040.0124","volume":"52","author":"R Bent","year":"2004","unstructured":"Bent R, Van Hentenryck P (2004) Scenario-based planning for partially dynamic vehicle routing with stochastic customers. Oper Res 52:977\u2013987","journal-title":"Oper Res"},{"key":"9400_CR4","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1145\/355921.355927","volume":"6","author":"JL Bentley","year":"1980","unstructured":"Bentley JL, Weide BW, Yao AC (1980) Optimal expected time algorithms for closest point problems. ACM Trans Math Softw 6:563\u2013580","journal-title":"ACM Trans Math Softw"},{"key":"9400_CR5","doi-asserted-by":"crossref","first-page":"286","DOI":"10.1287\/opre.44.2.286","volume":"4","author":"D Bertsimas","year":"1996","unstructured":"Bertsimas D, Simchi-Levi D (1996) A new generation of vehicle routing research: robust algorithms, addressing uncertainty. Oper Res 4:286\u2013304","journal-title":"Oper Res"},{"key":"9400_CR6","first-page":"315","volume-title":"Combinatorial optimization","author":"N Christofides","year":"1979","unstructured":"Christofides N, Mingozzi A, Toth P (1979) The vehicle routing problem. In: Christofides N et al. (eds) Combinatorial optimization. Wiley, New York, pp 315\u2013338"},{"key":"9400_CR7","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1007\/0-387-24977-X_9","volume-title":"Logistics systems: design and optimization","author":"JF Cordeau","year":"2005","unstructured":"Cordeau JF, Gendreau M, Hertz A, Laporte G, Sormany JS (2005) New heuristics for the vehicle routing problem. In: Langevin A, Riopel D (eds) Logistics systems: design and optimization. Springer, New York, pp 279\u2013297"},{"key":"9400_CR8","doi-asserted-by":"crossref","first-page":"928","DOI":"10.1057\/palgrave.jors.2601163","volume":"52","author":"JF Cordeau","year":"2001","unstructured":"Cordeau JF, Laporte G, Mercier A (2001) A unified tabu search heuristic for vehicle routing problems with time windows. J Oper Res Soc 52:928\u2013936","journal-title":"J Oper Res Soc"},{"key":"9400_CR9","doi-asserted-by":"crossref","first-page":"1250","DOI":"10.1016\/j.neucom.2008.01.023","volume":"72","author":"JC Creput","year":"2009","unstructured":"Creput JC, Koukam A (2009) A memetic neural network for the Euclidean traveling salesman problem. Neurocomputing 72:1250\u20131264","journal-title":"Neurocomputing"},{"key":"9400_CR10","doi-asserted-by":"crossref","first-page":"1125","DOI":"10.1007\/s00500-008-0281-4","volume":"12","author":"JC Creput","year":"2008","unstructured":"Creput JC, Koukam A (2008) The memetic self-organizing map approach to the vehicle routing problem. Soft Comput 12:1125\u20131141","journal-title":"Soft Comput"},{"key":"9400_CR11","first-page":"444","volume-title":"Proceedings of the 21th international conference on computer, electrical, and systems science, and engineering","author":"JC Creput","year":"2007","unstructured":"Creput JC, Koukam A, Hajjam A (2007) Self-organizing maps in evolutionary approach meant for dimensioning routes to the demand. In: Proceedings of the 21th international conference on computer, electrical, and systems science, and engineering, Vienna, Austria, May 25\u201327, pp 444\u2013551"},{"key":"9400_CR12","doi-asserted-by":"crossref","first-page":"689","DOI":"10.1038\/326689a0","volume":"326","author":"R Durbin","year":"1987","unstructured":"Durbin R, Willshaw DJ (1987) An analogue approach to the traveling salesman problem using an elastic net method. Nature 326:689\u2013691","journal-title":"Nature"},{"key":"9400_CR13","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1002\/net.3230110205","volume":"11","author":"M Fisher","year":"1981","unstructured":"Fisher M, Jakumar R, van Wassenhove L (1981) A generalized assignment heuristic for vehicle routing. Networks 11:109\u2013124","journal-title":"Networks"},{"key":"9400_CR14","first-page":"63","volume-title":"New ideas in optimization","author":"LM Gambardella","year":"1999","unstructured":"Gambardella LM, Taillard E, Agazzi G (1999) MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows. In: Corne D, Dorigo M, Glover F (eds) New ideas in optimization. McGraw-Hill, New York, pp 63\u201376"},{"key":"9400_CR15","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1287\/trsc.33.4.381","volume":"33","author":"M Gendreau","year":"1999","unstructured":"Gendreau M, Guertin F, Potvin JY, Taillard E (1999) Parallel tabu search for real-time vehicle routing and dispatching. Transp Sci 33:381\u2013390","journal-title":"Transp Sci"},{"key":"9400_CR16","doi-asserted-by":"crossref","first-page":"129","DOI":"10.1137\/1.9780898718515.ch6","volume-title":"The vehicle routing problem","author":"M Gendreau","year":"2002","unstructured":"Gendreau M, Laporte G, Potvin J-Y (2002) Metaheuristics for the capacitated VRP. In: Toth P, Vigo D (eds) The vehicle routing problem. SIAM, Philadelphia, pp 129\u2013154"},{"key":"9400_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(02)00915-3","volume":"151","author":"G Ghiani","year":"2003","unstructured":"Ghiani G, Guerriero F, Laporte G, Musmanno R (2003) Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies. Eur J Oper Res 151:1\u201311","journal-title":"Eur J Oper Res"},{"key":"9400_CR18","first-page":"33","volume-title":"Fleet management and logistics","author":"BL Golden","year":"1999","unstructured":"Golden BL, Wasil EA, Kelly JP, Chao IM (1999) Metaheuristics in vehicle routing. In: Crainic TG, Laporte G (eds) Fleet management and logistics. Kluwer, Boston, pp 33\u201356"},{"key":"9400_CR19","first-page":"515","volume":"41","author":"G Goncalves","year":"2007","unstructured":"Goncalves G, Hsu T, Dupas R, Housroum H (2007) Plateforme de simulation pour la gestion dynamique de tourn\u00e9es des v\u00e9hicules. J Eur Des Syst Autom 41:515\u2013539","journal-title":"J Eur Des Syst Autom"},{"key":"9400_CR20","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K Helsgaun","year":"2000","unstructured":"Helsgaun K (2000) An effective implementation of the Lin-Kernighan traveling salesman heuristic. Eur J Oper Res 126:106\u2013130","journal-title":"Eur J Oper Res"},{"key":"9400_CR21","unstructured":"Kilby P, Prosser P, Shaw P (1998) Dynamic VRPs: a study of scenarios. Technical Report APES-06-1998, University of Strathclyde, UK"},{"key":"9400_CR22","volume-title":"Self-organization maps and associative memory","author":"T Kohonen","year":"2001","unstructured":"Kohonen T (2001) Self-organization maps and associative memory, 3rd edn. Springer, Berlin","edition":"3"},{"key":"9400_CR23","unstructured":"Larsen A (2000) The dynamic vehicle routing problem. PhD thesis, Technical University of Denmark, Lyngby, Denmark"},{"key":"9400_CR24","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1007\/978-0-387-77778-8_9","volume-title":"The vehicle routing problem: latest advances and new challenges","author":"A Larsen","year":"2008","unstructured":"Larsen A, Madsen OBG, Solomon M (2008) Recent developments in dynamic vehicle routing systems. In: The vehicle routing problem: latest advances and new challenges. Springer, Berlin, pp 199\u2013218"},{"key":"9400_CR25","doi-asserted-by":"crossref","first-page":"1593","DOI":"10.1016\/j.cor.2003.11.017","volume":"32","author":"D Mester","year":"2005","unstructured":"Mester D, Br\u00e4ysy O (2005) Active guided evolution strategies for large scale vehicle routing problems with time windows. Comput Oper Res 32:1593\u20131614","journal-title":"Comput Oper Res"},{"key":"9400_CR26","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/s10878-005-4922-6","volume":"10","author":"R Montemanni","year":"2005","unstructured":"Montemanni R, Gambardella LM, Rizzoli AE, Donati AV (2005) Ant colony system for a dynamic vehicle routing problem. J Comb Optim 10:327\u2013343","journal-title":"J Comb Optim"},{"key":"9400_CR27","doi-asserted-by":"crossref","first-page":"105","DOI":"10.1007\/0-306-48056-5_5","volume-title":"Handbook of metaheuristics","author":"P Moscato","year":"2003","unstructured":"Moscato P, Cotta C (2003) A gentle introduction to memetic algorithms. In: Glover F, Kochenberger G (eds) Handbook of metaheuristics. Kluwer Academic, Boston, pp 105\u2013144"},{"key":"9400_CR28","first-page":"1","volume":"3","author":"M Oja","year":"2003","unstructured":"Oja M, Kaski S, Kohonen T (2003) Bibliography of self-organizing map (SOM) papers: 1998\u20132001 addendum. Neural Comput Surv 3:1\u2013156","journal-title":"Neural Comput Surv"},{"key":"9400_CR29","doi-asserted-by":"crossref","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G Reinelt","year":"1991","unstructured":"Reinelt G (1991) TSPLIB-A traveling salesman problem library. ORSA J Comput 3:376\u2013384","journal-title":"ORSA J Comput"},{"key":"9400_CR30","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1002\/net.3230230804","volume":"23","author":"E Taillard","year":"1994","unstructured":"Taillard E (1994) Parallel iterative search methods for vehicle-routing problems. Networks 23:661\u2013673","journal-title":"Networks"},{"key":"9400_CR31","volume-title":"International workshop on advanced information systems for enterprises","author":"B Zeddini","year":"2008","unstructured":"Zeddini B, Temani M, Yassine A, Ghedira K (2008) An agent-oriented approach for the dynamic vehicle routing problem. In: International workshop on advanced information systems for enterprises. IEEE Comput Soc, Los Alamitos. doi: 10.1109\/IWAISE"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9400-8.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10878-011-9400-8\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10878-011-9400-8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T04:23:15Z","timestamp":1559276595000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10878-011-9400-8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5,18]]},"references-count":31,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2012,11]]}},"alternative-id":["9400"],"URL":"https:\/\/doi.org\/10.1007\/s10878-011-9400-8","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"value":"1382-6905","type":"print"},{"value":"1573-2886","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,5,18]]}}}