{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,4,16]],"date-time":"2024-04-16T07:18:30Z","timestamp":1713251910716},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"11","license":[{"start":{"date-parts":[[2008,2,13]],"date-time":"2008-02-13T00:00:00Z","timestamp":1202860800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Soft Comput"],"published-print":{"date-parts":[[2008,9]]},"DOI":"10.1007\/s00500-008-0281-4","type":"journal-article","created":{"date-parts":[[2008,2,12]],"date-time":"2008-02-12T03:52:50Z","timestamp":1202788370000},"page":"1125-1141","source":"Crossref","is-referenced-by-count":14,"title":["The memetic self-organizing map approach to the vehicle routing problem"],"prefix":"10.1007","volume":"12","author":[{"given":"Jean-Charles","family":"Cr\u00e9put","sequence":"first","affiliation":[]},{"given":"Abderrafia\u00e2","family":"Koukam","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,2,13]]},"reference":[{"issue":"5","key":"281_CR1","doi-asserted-by":"crossref","first-page":"753","DOI":"10.1145\/290179.290180","volume":"45","author":"S Arora","year":"1998","unstructured":"Arora S (1998). Polynomial-time approximation schemes for Euclidean TSP and other geometric problems. J ACM 45(5): 753\u2013782","journal-title":"J ACM"},{"key":"281_CR2","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1016\/0167-6377(94)90065-5","volume":"16","author":"KD Boese","year":"1994","unstructured":"Boese KD, Kahng AB and Muddu S (1994). Adaptive multi-start technique for combinatorial global optimization. J Oper Res Lett 16: 101\u2013113","journal-title":"J Oper Res Lett"},{"issue":"5","key":"281_CR3","doi-asserted-by":"crossref","first-page":"483","DOI":"10.1023\/B:HEUR.0000045321.59202.52","volume":"10","author":"L Buriol","year":"2004","unstructured":"Buriol L, Fran\u00e7a PM and Moscato P (2004). A new memetic algorithm for the asymmetric traveling salesman problem. J Heuristics 10(5): 483\u2013506","journal-title":"J Heuristics"},{"key":"281_CR4","unstructured":"B\u00e4ck T, Hoffmeister F, Schwefel HP (1991) A survey of evolution strategies. In: 4th Int. Conf. on Genetic Algorithms, La Jolla, CA"},{"issue":"4","key":"281_CR5","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1145\/355921.355927","volume":"6","author":"JL Bentley","year":"1980","unstructured":"Bentley JL, Weide BW and Yao AC (1980). Optimal expected time algorithms for closest point problems. ACM Trans Math Softw 6(4): 563\u2013580","journal-title":"ACM Trans Math Softw"},{"key":"281_CR6","first-page":"315","volume-title":"Combinatorial optimization","author":"N Christofides","year":"1979","unstructured":"Christofides N, Mingozzi A and Toth P (1979). The vehicle routing problem. In: Christofides, N. (eds) Combinatorial optimization, pp 315\u2013338. Wiley, New York"},{"key":"281_CR7","doi-asserted-by":"crossref","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G Clarke","year":"1964","unstructured":"Clarke G and Wright JW (1964). Scheduling of vehicles from a central depot to a number of delivery points. Oper Res 12: 568\u2013581","journal-title":"Oper Res"},{"key":"281_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 and 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":"281_CR9","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 and Sormany JS (2005). New heuristics for the vehicle routing problem. In: Langevin, A and Riopel, D (eds) Logistics systems: design and optimization, pp 279\u2013297. Springer, New York"},{"key":"281_CR10","unstructured":"Cr\u00e9put JC, Lissajoux T, Koukam A (2000) A connexionnist approach to the hexagonal mesh generation. In: 16th IMACS World Congress, Lausanne"},{"issue":"1","key":"281_CR11","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1109\/TEVC.2004.837923","volume":"9","author":"JC Cr\u00e9put","year":"2005","unstructured":"Cr\u00e9put JC, Koukam A, Lissajoux T and Caminada A (2005). Automatic mesh generation for mobile network dimensioning using evolutionary approach. IEEE Trans Evol Comput 9(1): 18\u201330","journal-title":"IEEE Trans Evol Comput"},{"issue":"2","key":"281_CR12","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1504\/IJMNDI.2006.010816","volume":"1","author":"JC Cr\u00e9put","year":"2006","unstructured":"Cr\u00e9put JC and Koukam A (2006). Local search study of honeycomb clustering problem for cellular planning. Int J Mobile Network Des Innov 1(2): 153\u2013160","journal-title":"Int J Mobile Network Des Innov"},{"issue":"9","key":"281_CR13","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1061\/(ASCE)0733-947X(2007)133:9(529)","volume":"133","author":"JC Cr\u00e9put","year":"2007","unstructured":"Cr\u00e9put JC and Koukam A (2007). Interactive meshing for the design and optimization of bus transportation networks. J Transp Eng 133(9): 529\u2013538","journal-title":"J Transp Eng"},{"issue":"4","key":"281_CR14","first-page":"573","volume":"28","author":"JC Cr\u00e9put","year":"2007","unstructured":"Cr\u00e9put JC and Koukam A (2007). Transport clustering and routing as a visual meshing process. J Inform Optim Sci 28(4): 573\u2013601","journal-title":"J Inform Optim Sci"},{"issue":"1","key":"281_CR15","first-page":"103","volume":"7","author":"JC Cr\u00e9put","year":"2007","unstructured":"Cr\u00e9put JC, Koukam A and Hajjam A (2007). Self-organizing maps in evolutionary approach for the vehicle routing problem with time windows. Int J Comput Sci Network Secur 7(1): 103\u2013110","journal-title":"Int J Comput Sci Network Secur"},{"key":"281_CR16","doi-asserted-by":"crossref","first-page":"1499","DOI":"10.1016\/S0893-6080(03)00056-X","volume":"16","author":"EM Cochrane","year":"2003","unstructured":"Cochrane EM and Beasley JE (2003). The co-adaptive neural network approach to the Euclidean travelling salesman problem. Neural Networks 16: 1499\u20131525","journal-title":"Neural Networks"},{"key":"281_CR17","unstructured":"Dongarra JJ (2006) Performance of various computers using standard linear equations software. In: Technical Report CS-89-85, Department of Computer Science, University of Tennessee, USA, available at http:\/\/www.netlib.org\/benchmark\/performance.ps"},{"key":"281_CR18","doi-asserted-by":"crossref","unstructured":"Ergun \u00d6, Orlin JB, Steele-Feldman A (2003) 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\u201302, USA","DOI":"10.2139\/ssrn.349701"},{"key":"281_CR19","first-page":"63","volume-title":"New ideas in optimization","author":"LM Gambardella","year":"1999","unstructured":"Gambardella LM, Taillard E and Agazzi G (1999). MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows. In: Corne, D, Dorigo, M, and Glover, F (eds) New ideas in optimization, pp 63\u201376. McGraw-Hill, UK"},{"key":"281_CR20","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 and Potvin J-Y (2002). Metaheuristics for the capacitated VRP. In: Toth, P and Vigo, D (eds) The vehicle routing problem, pp 129\u2013154. SIAM, Philadelphia"},{"key":"281_CR21","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1007\/978-1-4613-1361-8_39","volume-title":"Meta-heuristics: theory & applications","author":"H Ghaziri","year":"1996","unstructured":"Ghaziri H (1996). Supervision in the self-organizing feature map: application to the vehicle routing problem. In: Osman, IH and Kelly, JP (eds) Meta-heuristics: theory & applications, pp 651\u2013660. Kluwer, Boston"},{"key":"281_CR22","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/978-1-4615-5755-5_2","volume-title":"Fleet management and logistics","author":"BL Golden","year":"1998","unstructured":"Golden BL, Wasil EA, Kelly JP and Chao IM (1998). Metaheuristics in vehicle routing. In: Crainic, TG and Laporte, G (eds) Fleet management and logistics, pp 33\u201356. Kluwer, Boston"},{"key":"281_CR23","unstructured":"Gomes LCT, Von Zuben FJA (2002) Vehicle Routing Based on Self-Organization with and without Fuzzy Inference. In: Proc. of the IEEE International Conference on Fuzzy Systems, vol. 2, pp 1310\u20131315"},{"key":"281_CR24","volume-title":"Genetic algorithms in search, optimization and machine learning","author":"DE Goldberg","year":"1994","unstructured":"Goldberg DE (1994). Genetic algorithms in search, optimization and machine learning. Addison-Wesley, Reading, MA"},{"key":"281_CR25","first-page":"215","volume-title":"Local search in combinatorial optimization","author":"DS Johnson","year":"1997","unstructured":"Johnson DS and McGeoch LA (1997). The traveling salesman problem: a case study in local optimization. In: Aarts, EHL and Lenstra, JK (eds) Local search in combinatorial optimization, pp 215\u2013310. Wiley, London,"},{"key":"281_CR26","first-page":"369","volume-title":"Traveling salesman problem and its variations","author":"DS Johnson","year":"2002","unstructured":"Johnson DS, McGeoch LA (2002) Experimental analysis of heuristics for the STSP. In: Gutin G, Punnen A (eds) Traveling salesman problem and its variations. Kluwer, Dordrecht, pp 369\u2013443"},{"key":"281_CR27","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"},{"issue":"5","key":"281_CR28","doi-asserted-by":"crossref","first-page":"474","DOI":"10.1109\/TEVC.2005.850260","volume":"9","author":"N Krasnogor","year":"2005","unstructured":"Krasnogor N (2005). A tutorial for competent memetic algorithms: model, taxonomy and design issues. IEEE Trans Evol Comput 9(5): 474\u2013488","journal-title":"IEEE Trans Evol Comput"},{"issue":"9","key":"281_CR29","doi-asserted-by":"crossref","first-page":"2743","DOI":"10.1016\/j.cor.2005.10.010","volume":"34","author":"J Kyt\u00f6joki","year":"2007","unstructured":"Kyt\u00f6joki J, Nuortio T, Br\u00e4ysy O and Gendreau M (2007). An efficient variable neighborhood search heuristic for very large scale vehicle routing problems. Comput Oper Res 34(9): 2743\u20132757","journal-title":"Comput Oper Res"},{"key":"281_CR30","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1111\/j.1475-3995.2000.tb00200.x","volume":"7","author":"G Laporte","year":"2000","unstructured":"Laporte G, Gendreau M, Potvin JY and Semet F (2000). Classical and modern heuristics for the vehicle routing problem. Int Trans Oper Res 7: 285\u2013300","journal-title":"Int Trans Oper Res"},{"key":"281_CR31","doi-asserted-by":"crossref","first-page":"1165","DOI":"10.1016\/j.cor.2003.10.002","volume":"32","author":"F Li","year":"2005","unstructured":"Li F, Golden B and Wasil E (2005). Very large-scale vehicle routing: new test problems, algorithms, and results. Comput Oper Res 32: 1165\u20131179","journal-title":"Comput Oper Res"},{"key":"281_CR32","doi-asserted-by":"crossref","unstructured":"Matsuyama Y (1991) Self-organization via competition, cooperation and categorization applied to extended vehicle routing problems. In: Proc. of the International Joint Conference on Neural Networks. Seatle, WA, pp 385\u2013390","DOI":"10.1109\/IJCNN.1991.155208"},{"issue":"4","key":"281_CR33","first-page":"297","volume":"13","author":"P Merz","year":"2001","unstructured":"Merz P and Freisleben B (2001). Memetic algorithms for the traveling salesman problem. Complex Syst 13(4): 297\u2013345","journal-title":"Complex Syst"},{"key":"281_CR34","first-page":"321","volume-title":"Handbook of metaheuristics","author":"P Merz","year":"2002","unstructured":"Merz P and Freisleben B (2002). Fitness landscape and memetic algorithm design. In: Glover, F and Kochenberger, G (eds) Handbook of metaheuristics, pp 321\u2013353. Kluwer, Norwell, MA"},{"key":"281_CR35","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 and 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":"281_CR36","unstructured":"Moscato P (1999) Memetic algorithms: a short introduction. In: Corne D, Dorigo M, Glover F (eds) New ideas in optimization. McGraw-Hill, UK"},{"key":"281_CR37","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 and Cotta C (2003). A gentle introduction to memetic algorithms. In: Glover, F and Kochenberger, G (eds) Handbook of metaheuristics, pp 105\u2013144. Kluwer, Boston, MA"},{"key":"281_CR38","doi-asserted-by":"crossref","first-page":"591","DOI":"10.1111\/j.1475-3995.1999.tb00175.x","volume":"6","author":"A Modares","year":"1999","unstructured":"Modares A, Somhom S and Enkawa T (1999). A self-organizing neural network approach for multiple traveling salesman and vehicle routing problems. Int Trans Oper Res 6: 591\u2013606","journal-title":"Int Trans Oper Res"},{"key":"281_CR39","doi-asserted-by":"crossref","unstructured":"M\u00fchlenbein H (1991) Evolution in time and space\u2014the parallel genetic algorithm. In: Rawlins G (ed) Foundations of genetic algorithms. Morgan Kaufmann, Los Altos, CA","DOI":"10.1016\/B978-0-08-050684-5.50023-9"},{"issue":"1","key":"281_CR40","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1109\/TSMCB.2006.880136","volume":"37","author":"HD Nguyen","year":"2007","unstructured":"Nguyen HD, Yoshihara I, Yamamori K and Yasunaga M (2007). Implementation of an effective hybrid GA for large-scale traveling salesman problems. IEEE Trans Syst Man Cybern B 37(1): 92\u201399","journal-title":"IEEE Trans Syst Man Cybern B"},{"issue":"1","key":"281_CR41","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1109\/TSMCB.2005.856143","volume":"36","author":"YS Ong","year":"2006","unstructured":"Ong YS, Lim MH, Zhu N and Wong KW (2006). Classification of adaptive memetic algorithms: a comparative study. IEEE Trans Syst Man Cybern B 36(1): 141\u2013152","journal-title":"IEEE Trans Syst Man Cybern B"},{"key":"281_CR42","unstructured":"Or I (1976) Traveling salesman-type combinatorial problems and their relation to the logistics of blood banking. Ph.D. thesis, Northwestern University, Evanston, USA"},{"key":"281_CR43","doi-asserted-by":"crossref","first-page":"1985","DOI":"10.1016\/S0305-0548(03)00158-8","volume":"31","author":"C Prins","year":"2004","unstructured":"Prins C (2004). A simple and effective evolutionary algorithm for the vehicle routing problem. Comput Oper Res 31: 1985\u20132002","journal-title":"Comput Oper Res"},{"key":"281_CR44","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational geometry: an introduction","author":"FP Preparata","year":"1985","unstructured":"Preparata FP and Shamos MI (1985). Computational geometry: an introduction. Springer, New York"},{"key":"281_CR45","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1023\/A:1011319115230","volume":"7","author":"RL Rardin","year":"2001","unstructured":"Rardin RL and Uzsoy R (2001). Experimental evaluation of heuristic optimization algorithms: a tutorial. J Heuristics 7: 261\u2013304","journal-title":"J Heuristics"},{"key":"281_CR46","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1016\/S0305-0548(03)00014-5","volume":"31","author":"M Reimann","year":"2004","unstructured":"Reimann M, Doerner K and Hartl RF (2004). D-ants: savings based ants divide and conquer the vehicle routing problem. Comput Oper Res 31: 563\u2013591","journal-title":"Comput Oper Res"},{"key":"281_CR47","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":"281_CR48","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y Rochat","year":"1995","unstructured":"Rochat Y and Taillard ED (1995). Probabilistic diversification and intensification in local search for vehicle routing. J Heuristics 1: 147\u2013167","journal-title":"J Heuristics"},{"key":"281_CR49","unstructured":"Schumann M, Retzko R (1995) Self-organizing maps for vehicle routing problems minimizing an explicit cost function. In: Proc. of the International Conference on Artificial Neural Networks, Paris, pp 401\u2013406"},{"issue":"6","key":"281_CR50","doi-asserted-by":"crossref","first-page":"390","DOI":"10.1108\/09600030510611639","volume":"35","author":"M Schwardt","year":"2005","unstructured":"Schwardt M and Dethloff J (2005). Solving a continuous location-routing problem by use of a self-organizing map. Int J Phys Distrib Logistics Manage 35(6): 390\u2013408","journal-title":"Int J Phys Distrib Logistics Manage"},{"key":"281_CR51","doi-asserted-by":"crossref","first-page":"254","DOI":"10.1287\/opre.35.2.254","volume":"35","author":"MM Solomon","year":"1987","unstructured":"Solomon MM (1987). Algorithms for the vehicle routing and scheduling problems with time window constrains. Oper Res 35: 254\u2013264","journal-title":"Oper Res"},{"issue":"6","key":"281_CR52","doi-asserted-by":"crossref","first-page":"1542","DOI":"10.1109\/72.548187","volume":"7","author":"K Smith","year":"1996","unstructured":"Smith K (1996). An argument for abandoning the traveling salesman problem as a neural network benchmark. IEEE Trans Neural Networks 7(6): 1542\u20131544","journal-title":"IEEE Trans Neural Networks"},{"key":"281_CR53","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0377-2217(00)00268-X","volume":"135","author":"ED Taillard","year":"2001","unstructured":"Taillard ED, Gambardella ML, Gendreau M and Potvin JY (2001). Adaptive memory programming: a unified view of metaheuristics. Eur J Oper Res 135: 1\u201316","journal-title":"Eur J Oper Res"},{"key":"281_CR54","first-page":"29","volume-title":"The vehicle routing problem","author":"P Toth","year":"2001","unstructured":"Toth P and Vigo D (2001). Branch-and-bound algorithms for the capacitated VRP. In: Toth, P and Vigo, D (eds) The vehicle routing problem, pp 29\u201352. SIAM, Philadelphia"},{"key":"281_CR55","doi-asserted-by":"crossref","first-page":"333","DOI":"10.1287\/ijoc.15.4.333.24890","volume":"15","author":"P Toth","year":"2003","unstructured":"Toth P and Vigo D (2003). The granular tabu search and its application to the vehicle routing problem. INFORMS J Comput 15: 333\u2013348","journal-title":"INFORMS J Comput"},{"key":"281_CR56","doi-asserted-by":"crossref","unstructured":"Vakhutinsky AI, Golden BL (1994) Solving vehicle routing problems using elastic net. In: IEEE International Conference on Neural Network, pp 4535\u20134540","DOI":"10.1109\/ICNN.1994.375004"}],"container-title":["Soft Computing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-008-0281-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00500-008-0281-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00500-008-0281-4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,28]],"date-time":"2019-05-28T21:39:53Z","timestamp":1559079593000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00500-008-0281-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,2,13]]},"references-count":56,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2008,9]]}},"alternative-id":["281"],"URL":"https:\/\/doi.org\/10.1007\/s00500-008-0281-4","relation":{},"ISSN":["1432-7643","1433-7479"],"issn-type":[{"value":"1432-7643","type":"print"},{"value":"1433-7479","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,2,13]]}}}