Case injected genetic algorithms for traveling salesman problems

Information sciences

Volumn 122, Issue 2, 2000, Pages 201-225

  Louis, Sushil J ^a   Li, Gong ^a  

^a University of Nevada   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

DATABASE SYSTEMS; GENETIC ALGORITHMS; LEARNING SYSTEMS; PROBLEM SOLVING;

CASE INJECTED GENETIC ALGORITHMS;

TRAVELING SALESMAN PROBLEM;

EID: 0033899259     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0020-0255(99)00124-3     Document Type: Article

References (27)

1. Ackley D.A. A Connectionist Machine for Genetic Hillclimbing. 1987;Kluwer Academic Publishers, Dordrecht.
2. L. Davis, Job shop scheduling with genetic algorithms, in: Proceedings of the Second International Conference on Genetic Algorithms, Lawerence Eribaum Associates, Mahwah, NJ, 1985.
3. L.J. Eshelman, The chc adaptive search algorithm: How to have safe search when engaging in nontraditional genetic recombination, in: G.J.E. Rawlins (Ed.), Foundations of Genetic Algorithms, vol. 1, Morgan Kauffman, Los Altos, CA, 1991, pp. 265-285.
4. A. Goel, B. Chandresekaran, Case-based design: a taks analysis, in: C. Tong, D. Sriram (Eds.), Artifical Intelligence in Engineering Design, vol. 2, Academic Press, New York, 1992, pp. 165-184.
5. D. Goldberg, R. Lingle, Alleles, loci and the travelling saleman problem, in: Proceedings of the Second International Conference on Genetic Algorithms, Lawerence Eribaum Associates, Mahwah, NJ, 1985.
6. Goldberg D.E. Genetic Algorithms in Serach, Optimization, and Machine Learning. 1989;Addison-Wesley, Reading, MA.
7. J. Grefenstette, R. Gopal, R. Rosamaita, D. Gucht, Genetic algorithms for the traveling salesman problem, in: Proceedings of the Second International Conference on Genetic Algorithm,. Lawerence Eribaum Associates, Mahwah, NJ, 1985.
8. Grefenstette J., Ramsey C., Shultz A. Learning sequential decision rules using simulation models and competition. Machine Learning. 5:1990;355-381.
9. Holland J. Adaptation in Natural and Artifical Systems. 1975;The University of Michigan Press, Ann Arbour.
10. M. Huhns, R. Acosta, Argo: an analogical reasoning system for solving design problems, in: C. Tong, D. Sriram (Eds.), Artifical Intelligence in Engineering Design, vol. 2, Academic Press, New York, 1992, pp. 105-144.
11. Janikow C.Z. A knowledge-intensive genetic algorithm for supervised learned. Machine Learning. 13:1993;189-228.
12. Kirkpatrick S., Gelatt C.D., Vechi M.P. Optimization by simulated annealing. Science. 220(4598):1983;671-680.
13. Koza J.R. Genetic Programmning. 1993;MIT Press, Cambridge, MA.
14. Lin S., Kernighan B. An effective heuristic algorithm for the travelling-salesan problem. Operations Research. 21(2):1973;498-516.
15. S.J. Louis, Genetic Algorithms as a compuational tool for design, Ph.D. thesis, Indiana University, Bloomington, IN, 1993.
16. S.J. Louis, J. Johnson, Solving similar problems using genetic algorithms and case-based memory, in: Proceedings of the Seventh International Conference on Genetic Algorithms, Morgan Kauffman, San Mateo, CA, 1997, pp. 283-290.
17. Louis S.J., McGraw G., Wycokoff R. Case-based reasoning assisted explantion of genetic algorithm results. Journal of Experimental and Theoretical Artifical Intelligence. 5:1993;21-37.
18. Martin O., Otto S., Felten E. Large-step markov chains for the traveling salesman problem. Complex Systems. 5(3):1991;299-326.
19. J. Mostow, M. Barley, T. Weinrich, Authomated reuse of desing plans in bogart, in: C. Tong, D. Sriram (Eds.), Artifical Intelligence in Engineering Design, vol 2, Academic Press, New York, 1992, pp. 57-104.
20. Padberg M., Rinaldi R. Optimization of a 532-city symmetric travelling salesman problem by branch and cut. Operations Research Letters. 6(1):1987;1-7.
21. C. Ramsey, J. Grefensttete, Case-based initialization of genetic algorithms, in: S. Forrest (Ed.), Proceedings of the Fifth International Conference on Genenetic Algorithms, Morgan Kauffman, San Mateo, CA, 1993, pp. 84-91.
22. G. Reinelt, TSPLIB. University of Heidelberg, http://www.iwr.uni-heidelberg.de/iwr/comopt/soft/TSPLIB95/TSPLIB.html, 1996.
23. Riesbeck C.K., Schank R.C. Inside Case-Based Reasoning. 1989;Lawerence Erlbaum, Cambridge, MA.
24. M. Schoenauer, S. Xanthakis, Constrained ga optimization, in: Proceedings of the Fifth International Conference on Genetic Algorithms, Morgan Kauffman, San Mateo, CA, 1993, pp. 573-580.
25. D. Smith, Bin packing with adaptive search. in: Proceedings of the Second International Conference on Genetic Algorithms, Lawerence Eribaum Associates, Mahwah, NJ, 1985.
26. J. Suh, D. Van Gucht, Incorporating heuristic information into genetic search, in: Proceedings of the Second International Conference on Genetic Algorithms, Lawerence Eribaumm Associates, Mahwah, NJ, 1985.
27. K. Sycara, D. Navinchandra, Retrieval strategies in case-based design system, in: C. Tong, D. Sriram (Eds.), Artifical Intelligence in Engineering Design, vol. 2, Academic Press, New York, 1992, pp. 145-164.