{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T18:49:10Z","timestamp":1725475750059},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540678465"},{"type":"electronic","value":"9783540449089"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/10721187_21","type":"book-chapter","created":{"date-parts":[[2006,12,29]],"date-time":"2006-12-29T17:56:59Z","timestamp":1167415019000},"page":"277-291","source":"Crossref","is-referenced-by-count":2,"title":["A Shepherd and a Sheepdog to Guide Evolutionary Computation?"],"prefix":"10.1007","author":[{"given":"Denis","family":"Robilliard","sequence":"first","affiliation":[]},{"given":"Cyril","family":"Fonlupt","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"21_CR1","unstructured":"Jones, T.: Evolutionary Algorithms, Fitness, Landscapes and Search. PhD thesis, University of Sante-Fe, Santa-Fe, New Mexico, USA (1995)"},{"key":"21_CR2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-1997-9","volume-title":"A Connectionist Machine for Genetic Hillclimbing","author":"D.H. Ackley","year":"1987","unstructured":"Ackley, D.H.: A Connectionist Machine for Genetic Hillclimbing. Kluwer Academic Publishers, Dordrecht (1987)"},{"issue":"3","key":"21_CR3","doi-asserted-by":"crossref","first-page":"190","DOI":"10.1287\/ijoc.1.3.190","volume":"1","author":"F. Glover","year":"1989","unstructured":"Glover, F.: Tabu search - part I. ORSA Journal of Computing\u00a01(3), 190\u2013206 (1989)","journal-title":"ORSA Journal of Computing"},{"key":"21_CR4","unstructured":"Baluja, S.: Population based incremental learning: A method for integrating genetic search based function optimization and competitive learning. Technical Report CMU-CS-94-163, Carnegie Mellon University, USA (1994)"},{"key":"21_CR5","unstructured":"Baluja, S.: An empirical comparison of seven iterative and evolutionary fun-ction optimization heurustics. Technical Report CMU-CS-95-163, Carnegie Mellon University (1995)"},{"key":"21_CR6","doi-asserted-by":"crossref","unstructured":"Sebag, M., Ducoulombier, A.: Extending population-based incremental learning to continuous search spaces. In: [22], pp. 418\u2013427 (1998)","DOI":"10.1007\/BFb0056884"},{"key":"21_CR7","unstructured":"Sebag, M., Schoenauer, M.: A society of hill-climbers. In: [23] (1997)"},{"key":"21_CR8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-1998-33101","volume":"33","author":"M. Sebag","year":"1998","unstructured":"Sebag, M., Schoenauer, M., Peyral, M.: Revisiting the memory of evolution. Fundamenta Informaticae\u00a033, 1\u201338 (1998)","journal-title":"Fundamenta Informaticae"},{"issue":"26","key":"21_CR9","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1109\/3477.484436","volume":"1","author":"M. Dorigo","year":"1996","unstructured":"Dorigo, M., Maniezzo, V., Colorni, A.: The ant system: Optimization by a colony of cooperating agents. IEEE Transactions on Systems, Mans, and Cybernetics\u00a01(26), 29\u201341 (1996)","journal-title":"IEEE Transactions on Systems, Mans, and Cybernetics"},{"issue":"1","key":"21_CR10","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1109\/4235.585892","volume":"1","author":"M. Dorigo","year":"1997","unstructured":"Dorigo, M., Gambardella, L.: A cooperative learning approach to the traveling salesman problem. IEEE Transactions on Evolutionary Computation\u00a01(1), 53\u201366 (1997)","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"21_CR11","doi-asserted-by":"crossref","unstructured":"Branke, J.: Creating robust solutions by means of evolutionary algorithms. In: [22], pp. 119\u2013128 (1998)","DOI":"10.1007\/BFb0056855"},{"key":"21_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/BFb0056848","volume-title":"Parallel Problem Solving from Nature - PPSN V","author":"C. Fonlupt","year":"1998","unstructured":"Fonlupt, C., Robilliard, D., Preux, P.: A bit-wise epistasis measure for binary search spaces. In: Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.) PPSN 1998. LNCS, vol.\u00a01498, pp. 47\u201356. Springer, Heidelberg (1998)"},{"key":"21_CR13","unstructured":"Lawler, E.C., Lenstra, J.K., Rinnooy Kan, A.H.G. (eds.): The traveling Salesman Problem: A Guided Tour of Combinatorial Optimization. John Wiley and Sons, Chichester (1990) ISBN: 0-471-90413-9"},{"key":"21_CR14","doi-asserted-by":"crossref","unstructured":"Tao, G., Michalewicz, Z.: Inver-over operator for the TSP. In: [22], pp. 803\u2013812 (1998)","DOI":"10.1007\/BFb0056922"},{"key":"21_CR15","doi-asserted-by":"crossref","unstructured":"Walters, T.: Repair and brood selection in the traveling salesman problem. In: [22], pp. 813\u2013822 (1998)","DOI":"10.1007\/BFb0056923"},{"key":"21_CR16","unstructured":"Dorigo, M., Gambardella, L.: Ant colonies for the traveling salesman problem. Technical Report TR\/IRIDIA\/1996-3, IRIDIA. Universit Libre de Bruxelles, Belgium (1996)"},{"key":"21_CR17","unstructured":"Nagata, Y., Kobayashi, S.: Edge assembly crossover: A high-power genetic algorithm for the traveling salesman problem. In: [24], pp. 450\u2013457 (1997)"},{"key":"21_CR18","doi-asserted-by":"crossref","unstructured":"Watson, J., Ross, C., Eisele, V., Denton, J., Bins, J., Guerra, C., Whitley, D., Howe, A.: The traveling salesrep problem, edge assembly crossover, and 2-opt. In: [22], pp. 823\u2013832 (1998)","DOI":"10.1007\/BFb0056924"},{"issue":"2","key":"21_CR19","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0167-6377(94)90065-5","volume":"16","author":"K.D. Boese","year":"1994","unstructured":"Boese, K.D., Kahng, A.B., Muddu, S.: A new adaptive multi-start technique for combinatorial global optimizations. Operations Research Letters\u00a016(2), 101\u2013113 (1994)","journal-title":"Operations Research Letters"},{"key":"21_CR20","unstructured":"Boese, K.D.: Cost versus distance in the traveling salesman problem. Technical report, UCLA Computer Science Dept, Los Angeles, California, USA (1994)"},{"key":"21_CR21","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 \u2014 a traveling salesman problem library. ORSA J. Comput.\u00a03, 376\u2013384 (1991)","journal-title":"ORSA J. Comput."},{"key":"21_CR22","series-title":"Lecture Notes in Computer Science","volume-title":"Parallel Problem Solving from Nature - PPSN V","year":"1998","unstructured":"Eiben, A.E., B\u00e4ck, T., Schoenauer, M., Schwefel, H.-P. (eds.): PPSN 1998. LNCS, vol.\u00a01498. Springer, Heidelberg (1998)"},{"key":"21_CR23","unstructured":"International Conference on Evolutionary Computation, Anchorage, USA (1997)"},{"key":"21_CR24","unstructured":"Proceedings of the 7th International Conference on Genetic Algorithms, East Lansing, Michigan, USA. Morgan Kaufmann (July 1997)"}],"container-title":["Lecture Notes in Computer Science","Artificial Evolution"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/10721187_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,19]],"date-time":"2020-04-19T15:18:24Z","timestamp":1587309504000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/10721187_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540678465","9783540449089"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/10721187_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2000]]}}}