Abstract
In this chapter we present an approach for solving the Traveling Sales man Problem using Estimation of Distribution Algorithms (EDAs). This approach is based on using discrete and continuous EDAs to find the best possible solution. We also present a method in which domain knowledge (based on local search) is combined with EDAs to find better solutions. We show experimental results obtained on several standard examples for discrete and continuous EDAs both alone and combined with a heuristic local search.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Bäck, 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.
Bengoetxea, E., Larrañaga, 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.
Bentley, J. L. (1992). Fast algorithm for geometric travelling salesman problem. ORSA J. Computing, 4:125–128.
Box, G. E. P. and Muller, M. E. (1958). A note on the generation of random normal deviates. Ann. Math. Static., 29:610–611.
Chow, C. and Liu, C. (1968). Approximating discrete probability distributions with dependence trees. IEEE Transactions on Information Theory, 14:462467.
Christofides, N. (1976). Worst-case analysis of a new heuristic for the traveling salesman problem. Technical Report 388, Carnegie Mellon University
Clarke, G. and Wright, J. W. (1964). Scheduling of vehicles from a central depot to a number of delivery points. Operations Research, 12:568–581.
Croes, G. A. (1992). A method for solving travelling salesman problems. Oper-ations Research, 6:791–812.
Davis, L. (1985). Applying adaptive algorithms to epistatic domains. In Proceedings of the International Joint Conference on Artificial Intelligence, pages 162–164.
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.
Etxeberria, R. and Larrañaga, P. (1999). Global optimization with Bayesian networks. In II Symposium on Artificial Intelligence. CIMAF99. Special Session on Distributions and Evolutionary Optimization, pages 8 322–339.
Fogel, D. B. (1992). An analysis of evolutionary programming. In Proc. of the First Annual Conf. on Evolutionary Computation, pages 43–51.
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–621.
Glover, F. (1986). Future paths for integer programming and links to Artificial Intelligence. Computers é4 Ops. Res., 5:533–549.
Glover, F. and Laguna, M. (1993). Tabu search. In Modern Heuristic Techniques for Combinatorial Problems, pages 70–150. Blackwell Scientific Publications, Oxford.
Grefenstette, J. J. (1987). Incorporing problem specific knowledge into genetic algorithm. In Davis, L., editor, Schedule Optimization Using Genetic Algorithms, pages 42–60. Morgan Kaufmann.
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.
Holland, J. H. (1975). Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor.
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.
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.
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–310. John Wiley and Sons, London.
Kirkpatrick, S., Gellat, C. D., and Vecchi, M. P. (1983). Optimization by simulated annealing. Science, 220:671–680.
Larrañaga, 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–170.
Lin, S. (1965). Computer solutions of the travelling salesman problem. Bell Syst. Tech. J., 44:2245–2269.
Lin, S. and Kernighan, B. W. (1973). An effective heuristic algorithm for the travelling salesman problem. Operation Res., 21:498–516.
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–228. Elsevier.
Matthews, R. A. J. (1993). The use of genetic algorithms in cryptanalysis. Cryptologia, XVII(2):187–201.
Moscato, P. (1999). Memetic algorithms: A short introduction. In Corne, D., Glover, F., and Dorigo, M., editors, New ideas in optimization, pages 219–234. Mc Graw Hill.
Mühlenbein, H. (1998). The equation for response to selection and its use for prediction. Evolutionary Computation, 5:303–346.
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.
Rechenberg, I. (1973). Optimierung Technischer Systeme Nach Prinzipien der Biologischen Information. Fromman Verlag, Stuttgart.
Reeves, C. R. (1993). Modern Heuristic Techniques for Combinatorial Problems. Blackwell Scientific Publications, Oxford.
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–44.
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–107. Lawrence Erlbaum.
Syswerda, G. (1991). Schedule optimization using genetic algorithms. In Davis, L., editor, Handbook of Genetic Algorithms, pages 332–349. Van Nostrand Reinhold.
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–140. Morgan Kaufmann Publishers.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Robles, V., de Miguel, P., Larrañaga, P. (2002). Solving the Traveling Salesman Problem with EDAs. In: Larrañaga, P., Lozano, J.A. (eds) Estimation of Distribution Algorithms. Genetic Algorithms and Evolutionary Computation, vol 2. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-1539-5_10
Download citation
DOI: https://doi.org/10.1007/978-1-4615-1539-5_10
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-5604-2
Online ISBN: 978-1-4615-1539-5
eBook Packages: Springer Book Archive