{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T03:00:39Z","timestamp":1761102039007,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642306648"},{"type":"electronic","value":"9783642306655"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-30665-5_14","type":"book-chapter","created":{"date-parts":[[2012,8,11]],"date-time":"2012-08-11T08:06:27Z","timestamp":1344672387000},"page":"309-339","source":"Crossref","is-referenced-by-count":3,"title":["From the TSP to the Dynamic VRP: An Application of Neural Networks in Population Based Metaheuristic"],"prefix":"10.1007","author":[{"given":"Amir","family":"Hajjam","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Charles","family":"Cr\u00e9put","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Abderrafi\u00e3a","family":"Koukam","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"4","key":"14_CR1","doi-asserted-by":"publisher","first-page":"563","DOI":"10.1145\/355921.355927","volume":"6","author":"J.-L. Bentley","year":"1980","unstructured":"Bentley, J.-L., Weide, B.W., Yao, A.C.: Optimal expected-time algorithms for closest point problems. ACM Trans. Math. Softw.\u00a06(4), 563\u2013580 (1980)","journal-title":"ACM Trans. Math. Softw."},{"issue":"2","key":"14_CR2","doi-asserted-by":"publisher","first-page":"286","DOI":"10.1287\/opre.44.2.286","volume":"44","author":"D.J. Bertsimas","year":"1996","unstructured":"Bertsimas, D.J., Levi, S.D.: A New Generation of Vehicle Routing Research: Robust Algorithms, Addressing Uncertainty. Operations Research\u00a044(2), 286\u2013304 (1996)","journal-title":"Operations Research"},{"key":"14_CR3","unstructured":"Christofides, N., Mingozzi, A., Toth, P.: The vehicle routing problem, pp. 315\u2013338. Wiley (1979)"},{"issue":"10","key":"14_CR4","doi-asserted-by":"publisher","first-page":"1499","DOI":"10.1016\/S0893-6080(03)00056-X","volume":"16","author":"E.M. Cochrane","year":"2003","unstructured":"Cochrane, E.M., Beasley, J.E.: The co-adaptive neural network approach to the euclidean travelling salesman problem. Neural Network\u00a016(10), 1499\u20131525 (2003)","journal-title":"Neural Network"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/0-387-24977-X_9","volume-title":"Logistics Systems: Design and Optimization","author":"J.-F. Cordeau","year":"2005","unstructured":"Cordeau, J.-F., Gendreau, M., Hertz, A., Laporte, G.T., Sormany, J.-S.: New heuristics for the vehicle routing problem. In: Langevin, A., Riopel, D. (eds.) Logistics Systems: Design and Optimization, pp. 279\u2013297. Springer, US (2005)"},{"issue":"8","key":"14_CR6","doi-asserted-by":"crossref","first-page":"928","DOI":"10.1057\/palgrave.jors.2601163","volume":"52","author":"J.-F. Cordeau","year":"2001","unstructured":"Cordeau, J.-F., Laporte, G., Mercier, A.: A unified tabu search heuristic for vehicle routing problems with time windows. The Journal of the Operational Research Society\u00a052(8), 928\u2013936 (2001)","journal-title":"The Journal of the Operational Research Society"},{"key":"14_CR7","unstructured":"Metaheuristics in Vehicle Routing. In: Crainic, T.G., Laporte, G. (eds.) Fleet Management and Logistics, pp. 33\u201356. Kluwer, Boston (1999)"},{"issue":"4","key":"14_CR8","doi-asserted-by":"crossref","first-page":"573","DOI":"10.1080\/02522667.2007.10699761","volume":"28","author":"J.-C. Creput","year":"2007","unstructured":"Creput, J.-C., Koukam, A.: Clustering and routing as a visual meshing process. Journal of Information and optimization sciences\u00a028(4), 573\u2013601 (2007)","journal-title":"Journal of Information and optimization sciences"},{"issue":"9","key":"14_CR9","doi-asserted-by":"publisher","first-page":"529","DOI":"10.1061\/(ASCE)0733-947X(2007)133:9(529)","volume":"133","author":"J.-C. Creput","year":"2007","unstructured":"Creput, J.-C., Koukam, A.: Interactive meshing for the design and optimization of bus transportation networks. Journal of Transportation Engineering\u00a0133(9), 529\u2013538 (2007)","journal-title":"Journal of Transportation Engineering"},{"key":"14_CR10","series-title":"STUDFUZZ","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-540-77465-5_10","volume-title":"Soft Computing Applications in Industry","author":"J.-C. Creput","year":"2008","unstructured":"Creput, J.-C., Koukam, A.: Self-organization in evolution for the solving of distributed terrestrial transportation problems. In: Prasad, B. (ed.) Soft Computing Applications in Industry. STUDFUZZ, vol.\u00a0226, pp. 189\u2013205. Springer, Heidelberg (2008)"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"1250","DOI":"10.1016\/j.neucom.2008.01.023","volume":"72","author":"J.-C. Creput","year":"2009","unstructured":"Creput, J.-C., Koukam, A.: A memetic neural network for the euclidean traveling salesman problem. Neurocomputing\u00a072, 1250\u20131264 (2009)","journal-title":"Neurocomputing"},{"issue":"1","key":"14_CR12","first-page":"103","volume":"7","author":"J.-C. Creput","year":"2007","unstructured":"Creput, J.-C., Koukam, A., Hajjam, A.: Self-organizing maps in evolutionary approach for the vehicle routing problem with time windows. International Journal of Computer Science and Network Security\u00a07(1), 103\u2013110 (2007)","journal-title":"International Journal of Computer Science and Network Security"},{"issue":"1","key":"14_CR13","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1109\/TEVC.2004.837923","volume":"9","author":"J.-C. Creput","year":"2005","unstructured":"Creput, J.-C., Koukam, A., Lissajoux, T., Caminada, A.: Automatic mesh generation for mobile network dimensioning using evolutionary approach. IEEE Trans. Evolutionary Computation\u00a09(1), 18\u201330 (2005)","journal-title":"IEEE Trans. Evolutionary Computation"},{"key":"14_CR14","first-page":"1125","volume":"12","author":"J.-C. Creput","year":"2008","unstructured":"Creput, J.-C., Koukam, A.: The memetic self-organizing map approach to the vehicle routing problem. Soft Computing - A Fusion of Foundations, Methodologies and Applications\u00a012, 1125\u20131141 (2008)","journal-title":"Soft Computing - A Fusion of Foundations, Methodologies and Applications"},{"key":"14_CR15","unstructured":"Dongarra, J.: Performance of various computers using standard linear equations software. Technical Report CS-89-85, Department of Computer Science, University of Tennesse, US (2006)"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Ergun, O., Orlin, J.B., Steele-Feldman, A.: Creating very large scale neighborhoods out of smaller ones by compounding moves: A study on the vehicle routing problem. MIT Sloan Working Paper No. 4393-02 (October 2002)","DOI":"10.2139\/ssrn.349701"},{"key":"14_CR17","unstructured":"Gambardella, L.M., Taillard, \u00c9., Agazzi, G.: Macs-vrptw: A multiple colony system for vehicle routing problems with time windows. In: New Ideas in Optimization, pp. 63\u201376. McGraw-Hill (1999)"},{"key":"14_CR18","first-page":"129","volume-title":"Metaheuristics for the capacitated VRP","author":"M. Gendreau","year":"2001","unstructured":"Gendreau, M., Laporte, G., Potvin, J.-Y.: Metaheuristics for the capacitated VRP, pp. 129\u2013154. Society for Industrial and Applied Mathematics, Philadelphia (2001)"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Ghiani, G., Guerriero, F., Laporte, G., Musmanno, R.: Real-time vehicle routing: Solution concepts, algorithms and parallel computing strategies. European Journal of Operational Research\u00a0151 (2003)","DOI":"10.1016\/S0377-2217(02)00915-3"},{"issue":"8","key":"14_CR20","doi-asserted-by":"publisher","first-page":"801","DOI":"10.1016\/0305-0548(94)90012-4","volume":"21","author":"F. Glover","year":"1994","unstructured":"Glover, F.: Optimization by ghost image processes in neural networks. Computers and Operations Research\u00a021(8), 801\u2013822 (1994); Heuristic, Genetic and Tabu Search","journal-title":"Computers and Operations Research"},{"issue":"5","key":"14_CR21","doi-asserted-by":"publisher","first-page":"515","DOI":"10.3166\/jesa.41.515-539","volume":"41","author":"G. Gon\u00e7alves","year":"2007","unstructured":"Gon\u00e7alves, G., Hsu, T., Dupas, R., Housroum, H.: Une plate-forme de simulation pour la gestion dynamique de tourn\u00e9es de v\u00e9hicules. Journal Europ\u00e9en des Syst\u00e8mes Automatis\u00e9s\u00a041(5), 515\u2013539 (2007)","journal-title":"Journal Europ\u00e9en des Syst\u00e8mes Automatis\u00e9s"},{"issue":"1","key":"14_CR22","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K. Helsgaun","year":"2000","unstructured":"Helsgaun, K.: An effective implementation of the lin-kernighan traveling salesman heuristic. European Journal of Operational Research\u00a0126(1), 106\u2013130 (2000)","journal-title":"European Journal of Operational Research"},{"key":"14_CR23","doi-asserted-by":"publisher","first-page":"369","DOI":"10.1007\/0-306-48213-4_9","volume-title":"The Traveling Salesman Problem and Its Variations of Combinatorial Optimization","author":"D. Johnson","year":"2004","unstructured":"Johnson, D., McGeoch, L.: Experimental analysis of heuristics for the stsp. In: Du, D.-Z., Pardalos, P.M., Gutin, G., Punnen, A. (eds.) The Traveling Salesman Problem and Its Variations of Combinatorial Optimization, vol.\u00a012, pp. 369\u2013443. Springer, US (2004)"},{"key":"14_CR24","unstructured":"Kilby, P., Prosser, P., Shaw, P.: Dynamic vrps: a study of scenarios. Technical Report APES-06-1998, University of Strathclyde, UK (1998)"},{"key":"14_CR25","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-88163-3","volume-title":"Self-organization and associative memory","author":"T. Kohonen","year":"1989","unstructured":"Kohonen, T.: Self-organization and associative memory, 3rd edn. Springer, New York (1989)","edition":"3"},{"key":"14_CR26","series-title":"Operations Research\/Computer Science Interfaces Series","doi-asserted-by":"publisher","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, O.B.G., Solomon, M.M.: Recent developments in dynamic vehicle routing systems. In: Sharda, R., Vo\u00df, S., Golden, B., Raghavan, S., Wasil, E. (eds.) The Vehicle Routing Problem: Latest Advances and New Challenges. Operations Research\/Computer Science Interfaces Series, vol.\u00a043, pp. 199\u2013218. Springer, US (2008)"},{"issue":"10","key":"14_CR27","doi-asserted-by":"publisher","first-page":"2964","DOI":"10.1016\/j.cor.2005.11.006","volume":"34","author":"D. Mester","year":"2007","unstructured":"Mester, D., Braysy, O.: Active-guided evolution strategies for large-scale capacitated vehicle routing problems. Computers and Operations Research\u00a034(10), 2964\u20132975 (2007)","journal-title":"Computers and Operations Research"},{"key":"14_CR28","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10878-005-4922-6","volume":"10","author":"R. Montemanni","year":"2005","unstructured":"Montemanni, R., Gambardella, L., Rizzoli, A., Donati, A.: Ant colony system for a dynamic vehicle routing problem. Journal of Combinatorial Optimization\u00a010, 327\u2013343 (2005)","journal-title":"Journal of Combinatorial Optimization"},{"key":"14_CR29","doi-asserted-by":"crossref","unstructured":"Moscato, P.: A gentle introduction to memetic algorithms. In: Handbook of Metaheuristics, pp. 105\u2013144. Kluwer Academic Publishers (2003)","DOI":"10.1007\/0-306-48056-5_5"},{"key":"14_CR30","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational geometry: an Introduction","author":"F.P. Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.I.: Computational geometry: an Introduction. Springer, New York (1985)"},{"key":"14_CR31","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BF02098286","volume":"61","author":"H.N. Psaraftis","year":"1995","unstructured":"Psaraftis, H.N.: Dynamic vehicle routing: Status and prospects. Annals of Operations Research\u00a061, 143\u2013164 (1995)","journal-title":"Annals of Operations Research"},{"key":"14_CR32","unstructured":"Psaraftis, H.N.: Dynamic vehicle routing problems, pp. 223\u2013248. Elsevier Science Ltd. (1998)"},{"issue":"4","key":"14_CR33","doi-asserted-by":"publisher","first-page":"376","DOI":"10.1287\/ijoc.3.4.376","volume":"3","author":"G. Reinelt","year":"1991","unstructured":"Reinelt, G.: Tsplib - a traveling salesman problem library. ORSA Journal on Computing\u00a03(4), 376\u2013384 (1991)","journal-title":"ORSA Journal on Computing"},{"issue":"4","key":"14_CR34","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1287\/ijoc.15.4.333.24890","volume":"15","author":"P. Toth","year":"2003","unstructured":"Toth, P., Vigo, D.: The granular tabu search and its application to the vehicle-routing problem. INFORMS Journal on Computing\u00a015(4), 333\u2013346 (2003)","journal-title":"INFORMS Journal on Computing"}],"container-title":["Studies in Computational Intelligence","Metaheuristics for Dynamic Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-30665-5_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,19]],"date-time":"2023-01-19T06:42:03Z","timestamp":1674110523000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-30665-5_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642306648","9783642306655"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-30665-5_14","relation":{},"ISSN":["1860-949X","1860-9503"],"issn-type":[{"type":"print","value":"1860-949X"},{"type":"electronic","value":"1860-9503"}],"subject":[],"published":{"date-parts":[[2013]]}}}