{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:27:27Z","timestamp":1725600447354},"publisher-location":"Boston, MA","reference-count":36,"publisher":"Springer US","isbn-type":[{"type":"print","value":"9781461356042"},{"type":"electronic","value":"9781461515395"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2002]]},"DOI":"10.1007\/978-1-4615-1539-5_10","type":"book-chapter","created":{"date-parts":[[2011,8,12]],"date-time":"2011-08-12T04:27:30Z","timestamp":1313123250000},"page":"211-229","source":"Crossref","is-referenced-by-count":28,"title":["Solving the Traveling Salesman Problem with EDAs"],"prefix":"10.1007","author":[{"given":"V.","family":"Robles","sequence":"first","affiliation":[]},{"given":"P.","family":"de Miguel","sequence":"additional","affiliation":[]},{"given":"P.","family":"Larra\u00f1aga","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","volume-title":"University of Dortmund","author":"T B\u00e4ck","year":"1993","unstructured":"B\u00e4ck, T. and Schwefel, G. R. H. (1993). Evolutionary programming and evolution strategies: Similarities and differences. Technical report, University of Dortmund, Deparment of Computer Science, Germany."},{"key":"10_CR2","series-title":"Workshop Notes of CaNew2000: Workshop on Bayesian and Causal Networks: From Inference to Data Mining. Fourteenth European Conference on Artificial Intelligence, ECAI2000. Berlin","volume-title":"Inexact graph matching using learning and simulation of Bayesian networks. An empirical comparison between different approaches with synthetic data.","author":"E Bengoetxea","year":"2000","unstructured":"Bengoetxea, E., Larra\u00f1aga, P., Bloch, I., Perchant, A., and Boeres, C. (2000). Inexact graph matching using learning and simulation of Bayesian networks. An empirical comparison between different approaches with synthetic data. In Workshop Notes of CaNew2000: Workshop on Bayesian and Causal Networks: From Inference to Data Mining. Fourteenth European Conference on Artificial Intelligence, ECAI2000. Berlin."},{"key":"10_CR3","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1287\/ijoc.4.4.387","volume":"4","author":"JL Bentley","year":"1992","unstructured":"Bentley, J. L. (1992). Fast algorithm for geometric travelling salesman problem. ORSA J. Computing, 4:125\u2013128.","journal-title":"ORSA J. Computing"},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"610","DOI":"10.1214\/aoms\/1177706645","volume":"29","author":"GEP Box","year":"1958","unstructured":"Box, G. E. P. and Muller, M. E. (1958). A note on the generation of random normal deviates. Ann. Math. Static., 29:610\u2013611.","journal-title":"Ann. Math. Static."},{"key":"10_CR5","first-page":"14","volume":"462467","author":"C Chow","year":"1968","unstructured":"Chow, C. and Liu, C. (1968). Approximating discrete probability distributions with dependence trees. IEEE Transactions on Information Theory, 14:462467.","journal-title":"IEEE Transactions on Information Theory"},{"key":"10_CR6","volume-title":"Worst-case analysis of a new heuristic for the traveling salesman problem. Technical Report 388, Carnegie Mellon University","author":"N Christofides","year":"1976","unstructured":"Christofides, N. (1976). Worst-case analysis of a new heuristic for the traveling salesman problem. Technical Report 388, Carnegie Mellon University"},{"key":"10_CR7","doi-asserted-by":"publisher","first-page":"568","DOI":"10.1287\/opre.12.4.568","volume":"12","author":"G Clarke","year":"1964","unstructured":"Clarke, G. and Wright, J. W. (1964). Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12:568\u2013581.","journal-title":"Operations Research"},{"key":"10_CR8","first-page":"791","volume-title":"A method for solving travelling salesman problems","author":"GA Croes","year":"1992","unstructured":"Croes, G. A. (1992). A method for solving travelling salesman problems. Oper-ations Research, 6:791\u2013812."},{"key":"10_CR9","series-title":"Proceedings of the International Joint Conference on Artificial Intelligence","first-page":"162","volume-title":"Applying adaptive algorithms to epistatic domains. In","author":"L Davis","year":"1985","unstructured":"Davis, L. (1985). Applying adaptive algorithms to epistatic domains. In Proceedings of the International Joint Conference on Artificial Intelligence, pages 162\u2013164."},{"key":"10_CR10","volume-title":"MIMIC: Finding optima by estimating probability densities. In Mozer, M., Jordan, M., and Petsche, T., editors, Advances in Neural Information Processing Systems, volume 9","author":"JS Bonet De","year":"1997","unstructured":"De Bonet, J. S., Isbell, C. L., and Viola, P. (1997). MIMIC: Finding optima by estimating probability densities. In Mozer, M., Jordan, M., and Petsche, T., editors, Advances in Neural Information Processing Systems, volume 9."},{"key":"10_CR11","first-page":"322","volume":"8","author":"R Etxeberria","year":"1999","unstructured":"Etxeberria, R. and Larra\u00f1aga, P. (1999). Global optimization with Bayesian networks. In II Symposium on Artificial Intelligence. CIMAF99. Special Session on Distributions and Evolutionary Optimization, pages 8 322\u2013339.","journal-title":"II Symposium on Artificial Intelligence. CIMAF99. Special Session on Distributions and Evolutionary Optimization"},{"key":"10_CR12","series-title":"Proc. of the First Annual Conf. on Evolutionary Computation","first-page":"43","volume-title":"An analysis of evolutionary programming. In","author":"DB Fogel","year":"1992","unstructured":"Fogel, D. B. (1992). An analysis of evolutionary programming. In Proc. of the First Annual Conf. on Evolutionary Computation, pages 43\u201351."},{"key":"10_CR13","series-title":"Proc. IEEE Int. Conf. on Evolutionary Computation","first-page":"616","volume-title":"A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems. In","author":"B Freisleben","year":"1996","unstructured":"Freisleben, B. and Merz, P. (1996). A genetic local search algorithm for solving symmetric and asymmetric traveling salesman problems. In Proc. IEEE Int. Conf. on Evolutionary Computation, pages 616\u2013621."},{"key":"10_CR14","doi-asserted-by":"publisher","first-page":"533","DOI":"10.1016\/0305-0548(86)90048-1","volume":"5","author":"F Glover","year":"1986","unstructured":"Glover, F. (1986). Future paths for integer programming and links to Artificial Intelligence. Computers \u00e94 Ops. Res., 5:533\u2013549.","journal-title":"Computers \u00e94 Ops. Res."},{"key":"10_CR15","first-page":"70","volume-title":"Modern Heuristic Techniques for Combinatorial Problems","author":"F Glover","year":"1993","unstructured":"Glover, F. and Laguna, M. (1993). Tabu search. In Modern Heuristic Techniques for Combinatorial Problems, pages 70\u2013150. Blackwell Scientific Publications, Oxford."},{"key":"10_CR16","first-page":"42","volume-title":"Schedule Optimization Using Genetic Algorithms","author":"JJ Grefenstette","year":"1987","unstructured":"Grefenstette, J. J. (1987). Incorporing problem specific knowledge into genetic algorithm. In Davis, L., editor, Schedule Optimization Using Genetic Algorithms, pages 42\u201360. Morgan Kaufmann."},{"key":"10_CR17","series-title":"International Conference On Evolutionary Computation. The Third Parallel Problem Solving From Nature.","volume-title":"Evolution Strategy in action: 10 ES-demonstrations. In","author":"M Herdy","year":"1994","unstructured":"Herdy, M. and Patone, G. (1994). Evolution Strategy in action: 10 ES-demonstrations. In International Conference On Evolutionary Computation. The Third Parallel Problem Solving From Nature."},{"key":"10_CR18","volume-title":"Adaptation in Natural and Artificial Systems","author":"JH Holland","year":"1975","unstructured":"Holland, J. H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor."},{"key":"10_CR19","series-title":"In preparation","volume-title":"Optimization by simulated annealing: An experimental evaluation. Part III","author":"DS Johnson","year":"2001a","unstructured":"Johnson, D. S., Aragon, C. R., McGeoh, L. A., and Schevon, C. (2001a). Optimization by simulated annealing: An experimental evaluation. Part III (the travelling salesman problem). In preparation."},{"key":"10_CR20","volume-title":"Near optimal solutions to very large travelling salesman problems. In preparation","author":"DS Johnson","year":"2001b","unstructured":"Johnson, D. S., Bentley, J. L., McGeoh, L. A., and Rothberg, E. E. (2001b). Near optimal solutions to very large travelling salesman problems. In preparation."},{"key":"10_CR21","first-page":"215","volume-title":"Local Seach in Combinatorial Optimization","author":"DS Johnson","year":"1997","unstructured":"Johnson, D. S. and McGeoch, L. A. (1997). The traveling salesman problem: a case study. In Aarts, E. H. L. and Lenstra, J. K., editors, Local Seach in Combinatorial Optimization, pages 215\u2013310. John Wiley and Sons, London."},{"key":"10_CR22","doi-asserted-by":"publisher","first-page":"671","DOI":"10.1126\/science.220.4598.671","volume":"220","author":"S Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, S., Gellat, C. D., and Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220:671\u2013680.","journal-title":"Science"},{"key":"10_CR23","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1023\/A:1006529012972","volume":"13","author":"P Larra\u00f1aga","year":"1999","unstructured":"Larra\u00f1aga, P., Kuijpers, C. M. H., Murga, R. H., Inza, I., and Dizdarevic, S. (1999). Genetic algorithms for the travelling salesman problem: A review of representations and operators. Artificial Intelligence Review, 13:129\u2013170.","journal-title":"Artificial Intelligence Review"},{"key":"10_CR24","doi-asserted-by":"crossref","first-page":"2245","DOI":"10.1002\/j.1538-7305.1965.tb04146.x","volume":"44","author":"S Lin","year":"1965","unstructured":"Lin, S. (1965). Computer solutions of the travelling salesman problem. Bell Syst. Tech. J., 44:2245\u20132269.","journal-title":"Bell Syst. Tech. J."},{"key":"10_CR25","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1287\/opre.21.2.498","volume":"21","author":"S Lin","year":"1973","unstructured":"Lin, S. and Kernighan, B. W. (1973). An effective heuristic algorithm for the travelling salesman problem. Operation Res., 21:498\u2013516.","journal-title":"Operation Res."},{"key":"10_CR26","volume-title":"Genetic operators, the fitness landscape and the traveling salesman problem. In Manner, R. and Manderick, B., editors, Parallel Problem Solving from Nature, pages 219\u2013228. Elsevier.","author":"K Mathias","year":"1992","unstructured":"Mathias, K. and Whitley, D. (1992). Genetic operators, the fitness landscape and the traveling salesman problem. In Manner, R. and Manderick, B., editors, Parallel Problem Solving from Nature, pages 219\u2013228. Elsevier."},{"issue":"2","key":"10_CR27","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1080\/0161-119391867863","volume":"XVII","author":"RAJ Matthews","year":"1993","unstructured":"Matthews, R. A. J. (1993). The use of genetic algorithms in cryptanalysis. Cryptologia, XVII(2):187\u2013201.","journal-title":"Cryptologia"},{"key":"10_CR28","first-page":"219","volume-title":"New ideas in optimization","author":"P Moscato","year":"1999","unstructured":"Moscato, P. (1999). Memetic algorithms: A short introduction. In Corne, D., Glover, F., and Dorigo, M., editors, New ideas in optimization, pages 219\u2013234. Mc Graw Hill."},{"key":"10_CR29","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1162\/evco.1997.5.3.303","volume":"5","author":"H M\u00fchlenbein","year":"1998","unstructured":"M\u00fchlenbein, H. (1998). The equation for response to selection and its use for prediction. Evolutionary Computation, 5:303\u2013346.","journal-title":"Evolutionary Computation"},{"key":"10_CR30","series-title":"Thesis, Deparment of Industrial Engineering and Management Sciences","volume-title":"Travelling Salesman-Type Combinatorial Problems and their Relation to the Logistics of Regional Blood Banking. Ph.D","author":"I Or","year":"1976","unstructured":"Or, I.(1976).Travelling Salesman-Type Combinatorial Problems and their Relation to the Logistics of Regional Blood Banking. Ph.D. Thesis, Deparment of Industrial Engineering and Management Sciences, Northwestern University, Evanston, IL."},{"key":"10_CR31","volume-title":"Optimierung Technischer Systeme Nach Prinzipien der Biologischen Information","author":"I Rechenberg","year":"1973","unstructured":"Rechenberg, I. (1973). Optimierung Technischer Systeme Nach Prinzipien der Biologischen Information. Fromman Verlag, Stuttgart."},{"key":"10_CR32","volume-title":"Modern Heuristic Techniques for Combinatorial Problems","author":"CR Reeves","year":"1993","unstructured":"Reeves, C. R. (1993). Modern Heuristic Techniques for Combinatorial Problems. Blackwell Scientific Publications, Oxford."},{"issue":"1","key":"10_CR33","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1080\/0161-119391867746","volume":"XVII","author":"R Spillman","year":"1993","unstructured":"Spillman, R., Janssen, M., Nelsonn, B., and Kepner, M. (1993). Use of a genetic algorithm in the cryptanalysis simple substitution ciphers. Cryptologia, XVII(1):31\u201344.","journal-title":"Cryptologia"},{"key":"10_CR34","first-page":"100","volume-title":"Proc. of the Second Int. Conf. on Genetic Algorithms","author":"JY Suh","year":"1987","unstructured":"Suh, J. Y. and van Gucht, D. (1987). Incorporing heuristic information into genetic search. In Grefenstette, J. J., editor, Proc. of the Second Int. Conf. on Genetic Algorithms, pages 100\u2013107. Lawrence Erlbaum."},{"key":"10_CR35","first-page":"332","volume-title":"Handbook of Genetic Algorithms","author":"G Syswerda","year":"1991","unstructured":"Syswerda, G. (1991). Schedule optimization using genetic algorithms. In Davis, L., editor, Handbook of Genetic Algorithms, pages 332\u2013349. Van Nostrand Reinhold."},{"key":"10_CR36","first-page":"133","volume-title":"Proceedings of the International Joint Conference on Artificial Intelligence","author":"D Whitley","year":"1989","unstructured":"Whitley, D., Starkweather, D., and Fuquay, D. (1989). Scheduling problems and travelling salesman: The genetic edge recombination operator. In Schaffer, J., editor, Proceedings of the International Joint Conference on Artificial Intelligence, pages 133\u2013140. Morgan Kaufmann Publishers."}],"container-title":["Genetic Algorithms and Evolutionary Computation","Estimation of Distribution Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-1-4615-1539-5_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,31]],"date-time":"2019-03-31T07:39:09Z","timestamp":1554017949000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-1-4615-1539-5_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002]]},"ISBN":["9781461356042","9781461515395"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-1-4615-1539-5_10","relation":{},"ISSN":["1568-2587"],"issn-type":[{"type":"print","value":"1568-2587"}],"subject":[],"published":{"date-parts":[[2002]]}}}