{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T01:33:06Z","timestamp":1725499986758},"publisher-location":"Berlin, Heidelberg","reference-count":47,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540753957"},{"type":"electronic","value":"9783540753964"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-75396-4_4","type":"book-chapter","created":{"date-parts":[[2008,1,2]],"date-time":"2008-01-02T13:05:54Z","timestamp":1199279154000},"page":"109-128","source":"Crossref","is-referenced-by-count":0,"title":["Evolution of Inductive Self-organizing Networks"],"prefix":"10.1007","author":[{"given":"Dongwon","family":"Kim","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gwi-Tae","family":"Park","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","volume-title":"The vehicle routing problem. Monographs on discrete mathematics and applications","author":"P Toth","year":"2001","unstructured":"Toth P, Vigo D (2001) The vehicle routing problem. Monographs on discrete mathematics and applications. SIAM, Philadelphia"},{"key":"4_CR2","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1287\/mnsc.6.1.80","volume":"6","author":"G Dantzing","year":"1959","unstructured":"Dantzing G, Ramster R (1959) The truck dispatching problem. Manag Sci 6:80\u201391","journal-title":"Manag Sci"},{"key":"4_CR3","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: Combinatorial optimization. Wiley, New York, pp 315\u2013338"},{"key":"4_CR4","unstructured":"http:\/\/neo.lcc.uma.es\/radi-aeb\/WebVRP\/index.html"},{"key":"4_CR5","doi-asserted-by":"crossref","first-page":"33","DOI":"10.1007\/978-1-4615-5755-5_2","volume-title":"Fleet management and logistics","author":"B Golden","year":"1998","unstructured":"Golden B, Wasil E, Kelly J, Chao IM (1998) The impact of metaheuristics on solving the vehicle routing problem: algorithms, problem sets, and computational results. In: Fleet management and logistics. Kluwer, Boston, pp 33\u201356"},{"key":"4_CR6","doi-asserted-by":"publisher","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. Kluwer Academic, Dordecht, Springer Verlag NY, pp. 279\u2013297"},{"key":"4_CR7","first-page":"428","volume-title":"Proceedings of the third international conference on genetic algorithms \u2013 ICGA89","author":"B Manderick","year":"1989","unstructured":"Manderick B, Spiessens P (1989) Fine-grained parallel genetic algorithm. In: Schaffer J (ed.) Proceedings of the third international conference on genetic algorithms \u2013 ICGA89, Morgan-Kaufmann, Los Altos, CA, pp 428\u2013433"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"443","DOI":"10.1109\/TEVC.2002.800880","volume":"6","author":"E Alba","year":"2002","unstructured":"Alba E, Tomassini M (2002) Parallelism and evolutionary algorithms. IEEE Trans Evol Comput 6:443\u2013462","journal-title":"IEEE Trans Evol Comput"},{"key":"4_CR9","first-page":"236","volume-title":"Parallel problem solving from nature (PPSN IV). Volume 1141 of lecture notes in computer science","author":"J Sarma","year":"1996","unstructured":"Sarma J, Jong KD (1996) An analysis of the effect of the neighborhood size and shape on local selection algorithms. In: Voigt H, Ebeling W, Rechenberg I, Schwefel H (eds.) Parallel problem solving from nature (PPSN IV). Volume 1141 of lecture notes in computer science. Springer, Berlin Heidelberg New York, pp 236\u2013244"},{"key":"4_CR10","first-page":"422","volume-title":"Proceedings of the third international conference on genetic algorithms \u2013 ICGA89","author":"M Gorges-Schleuter","year":"1989","unstructured":"Gorges-Schleuter M (1989) ASPARAGOS an asynchronous parallel genetic optimisation strategy. In: Schaffer JD (ed.) Proceedings of the third international conference on genetic algorithms \u2013 ICGA89. Morgan Kaufmann, Los Altos, CA, pp 422\u2013427"},{"key":"4_CR11","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1109\/TEVC.2005.843751","volume":"9","author":"E Alba","year":"2005","unstructured":"Alba E, Dorronsoro B (2005) The exploration\/exploitation tradeoff in dynamic cellular evolutionary algorithms. IEEE Trans Evol Comput 9:126\u2013142","journal-title":"IEEE Trans Evol Comput"},{"key":"4_CR12","first-page":"955","volume-title":"Proceedings of the genetic and evolutionary computation conference, GECCO03","author":"M Giacobini","year":"2003","unstructured":"Giacobini M, Alba E, Tomassini M (2003) Selection intensity in asynchronous cellular evolutionary algorithms. In: E. Cant\u00fa-Paz et al. (ed.) Proceedings of the genetic and evolutionary computation conference, GECCO03. Springer, Berlin Heidelberg New York, pp 955\u2013966"},{"key":"4_CR13","first-page":"1138","volume-title":"Proceedings of the genetic and evolutionary computation conference, GECCO04. LNCS 3102","author":"M Giacobini","year":"2004","unstructured":"Giacobini M, Alba E, Tettamanzi A, Tomassini M (2004) Modeling selection intensity for toroidal cellular evolutionary algorithms. In: Deb K (ed.) Proceedings of the genetic and evolutionary computation conference, GECCO04. LNCS 3102, Seattle, Washington. Springer, Berlin Heidelberg New York, pp 1138\u20131149"},{"key":"4_CR14","first-page":"11","volume-title":"Evolutionary computation in combinatorial optimization \u2013 EvoCOP 2004. volume 3004 of LNCS","author":"E Alba","year":"2004","unstructured":"Alba E, Dorronsoro B (2004) Solving the vehicle routing problem by using cellular genetic algorithms. In: Gottlieb J, Raidl GR (eds.) Evolutionary computation in combinatorial optimization \u2013 EvoCOP 2004. volume 3004 of LNCS, Coimbra, Portugal. Springer, Berlin Heidelberg New York, pp 11\u201320"},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"1276","DOI":"10.1287\/mnsc.40.10.1276","volume":"40","author":"M Gendreau","year":"1994","unstructured":"Gendreau M, Hertz A, Laporte G (1994) A tabu search heuristic for the vehicle routing problem. Manag Sci 40:1276\u20131290","journal-title":"Manag Sci"},{"key":"4_CR16","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 (2003). The granular tabu search and its application to the vehicle routing problem. INFORMS J Comput 15:333\u2013346","journal-title":"INFORMS J Comput"},{"key":"4_CR17","first-page":"646","volume-title":"Proceedings of the international genetic and evolutionary computation conference \u2013 GECCO03. LNCS 2723","author":"J Berger","year":"2003","unstructured":"Berger J, Barkaoui M (2003). A hybrid genetic algorithm for the capacitated vehicle routing problem. In: Cant\u00fa-Paz E (ed.) Proceedings of the international genetic and evolutionary computation conference \u2013 GECCO03. LNCS 2723, Illinois, Chicago, USA. Springer-Verlag, Berlin, pp 646\u2013656"},{"key":"4_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 (2004) A simple and effective evolutionary algorithm for the vehicle routing problem, Computers and Operations Research 31:1985\u20132002","journal-title":"Computers and Operations Research"},{"key":"4_CR19","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1002\/net.3230110211","volume":"11","author":"J Lenstra","year":"1981","unstructured":"Lenstra J, Kan AR (1981) Complexity of vehicle routing and scheduling problems. Networks 11:221\u2013227","journal-title":"Networks"},{"key":"4_CR20","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/s10107-002-0323-0","volume":"94","author":"T Ralphs","year":"2003","unstructured":"Ralphs T, Kopman L, Pulleyblank W Jr, LT (2003) On the capacitated vehicle routing problem. Math Prog Ser B 94:343\u2013359","journal-title":"Math Prog Ser B"},{"key":"4_CR21","first-page":"658","volume-title":"Proceedings of the fifth international conference on genetic algorithms","author":"D Whitley","year":"1993","unstructured":"Whitley D (1993) Cellular genetic algorithms. In: Forrest S (ed.) Proceedings of the fifth international conference on genetic algorithms. Morgan Kaufmann, Los Altos, CA, p 658"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Alba E, Giacobini M, Tomassini M, Romero S Comparing synchronous and asynchronous cellular genetic algorithms. In: JJ Merelo et al. (ed.) Parallel problem solving from nature \u2013 PPSN VII. Volume 2439 of lecture notes in computer science, Granada, Spain. Springer-Verlag, Heidelberg, pp 601\u2013610","DOI":"10.1007\/3-540-45712-7_58"},{"key":"4_CR23","volume-title":"Experiments in the use of neighbourhood search techniques for vehicle routing","author":"T Duncan","year":"1995","unstructured":"Duncan T (1995) Experiments in the use of neighbourhood search techniques for vehicle routing. Technical report AIAI-TR-176, Artificial Intelligence Applications Institute, University of Edinburgh, Edinburgh"},{"key":"4_CR24","first-page":"133","volume-title":"Proceedings of the third international conference on genetic algorithms \u2013 ICGA89","author":"D Whitley","year":"1989","unstructured":"Whitley D, Starkweather T, Fuquay D (1989) Scheduling problems and traveling salesman: the genetic edge recombination operator. In: Schaffer J (ed.) Proceedings of the third international conference on genetic algorithms \u2013 ICGA89. Morgan-Kaufmann, Los Altos, CA, pp 133\u2013140"},{"key":"4_CR25","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/BF00202901","volume":"60","author":"D Fogel","year":"1988","unstructured":"Fogel D (1988) An evolutionary approach to the traveling salesman problem. Biol Cybernetics 60:139\u2013144","journal-title":"Biol Cybernetics"},{"key":"4_CR26","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1007\/BF00203625","volume":"64","author":"W Banzhaf","year":"1990","unstructured":"Banzhaf W (1990) The molecular traveling salesman. Biol Cybernetics 64:7\u201314","journal-title":"Biol Cybernetics"},{"key":"4_CR27","volume-title":"Adaptation in natural and artificial systems","author":"J Holland","year":"1975","unstructured":"Holland J (1975) Adaptation in natural and artificial systems. University of Michigan Press, Ann Arbor, MI"},{"key":"4_CR28","doi-asserted-by":"publisher","first-page":"147","DOI":"10.1007\/BF02430370","volume":"1","author":"Y Rochat","year":"1995","unstructured":"Rochat Y, Taillard E (1995) Probabilistic diversification and intensification in local search for vehicle routing. J Heuristics 1:147\u2013167","journal-title":"J Heuristics"},{"key":"4_CR29","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1287\/opre.6.6.791","volume":"6","author":"G Croes","year":"1958","unstructured":"Croes G (1958) A method for solving traveling salesman problems. Oper Res 6:791\u2013812","journal-title":"Oper Res"},{"key":"4_CR30","doi-asserted-by":"publisher","first-page":"421","DOI":"10.1007\/BF02023004","volume":"41","author":"I Osman","year":"1993","unstructured":"Osman I (1993) Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problems. Ann Oper Res 41:421\u2013451","journal-title":"Ann Oper Res"},{"key":"4_CR31","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1109\/4235.735431","volume":"2","author":"K Chellapilla","year":"1998","unstructured":"Chellapilla K (1998) Combining mutation operators in evolutionary programming. IEEE Trans Evol Comput 2:91\u201396","journal-title":"IEEE Trans Evol Comput"},{"key":"4_CR32","volume-title":"Computational results with a branch and cut code for the capacitated vehicle routing problem","author":"P Augerat","year":"1995","unstructured":"Augerat P, Belenguer J, Benavent E, Corbern A, Naddef D, Rinaldi G (1995) Computational results with a branch and cut code for the capacitated vehicle routing problem. Research Report 949-M, Universite Joseph Fourier, Grenoble, France"},{"key":"4_CR33","volume-title":"An analysis of the behavior of heuristics for the vehicle routing problem for a selection of problems with vehicle related, customer-related, and time-related constraints","author":"A Breedam Van","year":"1994","unstructured":"Van Breedam A (1994) An analysis of the behavior of heuristics for the vehicle routing problem for a selection of problems with vehicle related, customer-related, and time-related constraints. PhD thesis, University of Antwerp \u2013 RUCA, Belgium"},{"key":"4_CR34","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1057\/jors.1969.75","volume":"20","author":"N Christofides","year":"1969","unstructured":"Christofides N, Eilon S (1969) An algorithm for the vehicle dispatching problem. Oper Res Quart 20:309\u2013318","journal-title":"Oper Res Quart"},{"key":"4_CR35","doi-asserted-by":"publisher","first-page":"626","DOI":"10.1287\/opre.42.4.626","volume":"42\u201344","author":"M Fisher","year":"1994","unstructured":"Fisher M (1994) Optimal solution of vehicle routing problems using minimum k-trees. Oper Res 42\u201344:626\u2013642","journal-title":"Oper Res"},{"key":"4_CR36","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1002\/net.3230230804","volume":"23","author":"E Taillard","year":"1993","unstructured":"Taillard E (1993) Parallel iterative search methods for vehicle-routing problems. Networks 23:661\u2013673","journal-title":"Networks"},{"key":"4_CR37","doi-asserted-by":"crossref","unstructured":"Reinelt G (1991) TSPLIB: A travelling salesman problem library. ORSA J Comput 3:376\u2013384 URL: http:\/\/www.iwr.uni--heidelberg.de\/groups\/comopt\/software\/TSPLIB95\/","DOI":"10.1287\/ijoc.3.4.376"},{"key":"4_CR38","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s10107-003-0481-8","volume":"100","author":"J Lysgaard","year":"2004","unstructured":"Lysgaard J, Letchford A, Eglese R (2004) A new branch-and-cut algorithm for capacitated vehicle routing problems. Math Program 100:423\u2013445","journal-title":"Math Program"},{"key":"4_CR39","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1016\/S0305-0548(99)00101-X","volume":"28","author":"A Breedam Van","year":"2001","unstructured":"Van Breedam A (2001) Comparing descent heuristics and metaheuristics for the vehicle routing problem. Comput Oper Res 28:289\u2013315","journal-title":"Comput Oper Res"},{"key":"4_CR40","doi-asserted-by":"publisher","first-page":"348","DOI":"10.1016\/S0377-2217(01)00150-3","volume":"137","author":"A Breedam Van","year":"2002","unstructured":"Van Breedam A (2002) A parametric analysis of heuristics for the vehicle routing problem with side-constraints. Eur J Oper Res 137:348\u2013370","journal-title":"Eur J Oper Res"},{"key":"4_CR41","first-page":"1","volume-title":"Integer programming and combinatorial optimization (IPCO). Volume 3064 of LNCS, New York, USA.","author":"R Fukasawa","year":"2004","unstructured":"Fukasawa R et al (2004) Robust branch-and-cut-and-price for the capacitated vehicle routing problem. In: Integer programming and combinatorial optimization (IPCO). Volume 3064 of LNCS, New York, USA. Springer-Verlag, Berlin, pp 1\u201315"},{"key":"4_CR42","volume-title":"A tabu search heuristic for the vehicle routing problem","author":"M Gendreau","year":"1991","unstructured":"Gendreau M, Hertz A, Laporte G (1991) A tabu search heuristic for the vehicle routing problem. Technical Report CRT-777, Centre de Recherche sur les Transports \u2013 Universit de Montral, Montral, Canada"},{"key":"4_CR43","doi-asserted-by":"publisher","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. Comps & Ops Res 32:1593\u20131614","journal-title":"Comps & Ops Res"},{"key":"4_CR44","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, 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":"4_CR45","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1023\/A:1021157406318","volume":"115","author":"C Tarantilis","year":"2002","unstructured":"Tarantilis C, Kiranoudis C (2002). Boneroute: an adaptive memory-based method for effective fleet management. Ann Oper Res 115:227\u2013241","journal-title":"Ann Oper Res"},{"key":"4_CR46","first-page":"63","volume-title":"New ideas in optimization","author":"L Gambardella","year":"1999","unstructured":"Gambardella L, Taillard E, Agazzi G (1999) MACS-VRPTW: a multiple ant colony system for vehicle routing problems with time windows. In: New ideas in optimization. McGraw-Hill, New York, pp 63\u201376"},{"key":"4_CR47","unstructured":"http:\/\/branchandcut.org\/VRP\/data\/"}],"container-title":["Studies in Computational Intelligence","Engineering Evolutionary Intelligent Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-75396-4_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:00:15Z","timestamp":1619521215000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-75396-4_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540753957","9783540753964"],"references-count":47,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-75396-4_4","relation":{},"ISSN":["1860-949X"],"issn-type":[{"type":"print","value":"1860-949X"}],"subject":[],"published":{"date-parts":[[2008]]}}}