next up previous
Next: About this document ... Up: A Sequential Similarity Metric Previous: Acknowledgments

Bibliography

Ackley, 1987
Ackley, D. A. (1987).
A Connectionist Machine for Genetic Hillclimbing.
Kluwer Academic Publishers.

Eshelman, 1991
Eshelman, L. J. (1991).
The CHC adaptive search algorithm: How to have safe search when engaging in nontraditional genetic recombination.
In Rawlins, G. J. E., editor, Foundations of Genetic Algorithms-1, pages 265-283. Morgan Kauffman.

Goel and Chandresekaran, 1992
Goel, A. and Chandresekaran, B. (1992).
Case-based design: A task analysis.
In Tong, C. and Sriram, D., editors, Artificial Intelligence in Engineering Design, Vol II, pages 165-184. Academic Press, Inc.

Goldberg, 1989
Goldberg, D. E. (1989).
Genetic Algorithms in Search, Optimization, and Machine Learning.
Addison-Wesley.

Grefenstette et al., 1990
Grefenstette, J., Ramsey, C., and Shultz, A. (1990).
Learning sequential decision rules using simulation models and competition.
Machine Learning, 5:355-381.

Grefensttete and Ramsey, 1992
Grefensttete, J. and Ramsey, C. (1992).
An approach to anytime learning.
In Proceedings of the Ninth International Conference on Machine Learning, pages 189-195, San Mateo, California. Morgan Kauffman.

Holland, 1975
Holland, J. (1975).
Adaptation In Natural and Artificial Systems.
The University of Michigan Press, Ann Arbour.

Huhns and Acosta, 1992
Huhns, M. and Acosta, R. (1992).
Argo: An analogical reasoning system for solving design problems.
In Tong, C. and Sriram, D., editors, Artificial Intelligence in Engineering Design, Vol II, pages 105-144. Academic Press, Inc.

Janikow, 1993
Janikow, C. Z. (1993).
A knowledge-intensive genetic algorithm for supervised learning.
Machine Learning, 13:189-228.

Koza, 1993
Koza, J. R. (1993).
Genetic Programming.
MIT Press.

Levenshtein, 1966
Levenshtein, V. I. (1966).
Binary codes capable of correcting deletions insertions and reversals.
Soviet Physics-Doklandy, 10(8):707-710.

Louis, 1993
Louis, S. J. (1993).
Genetic Algorithms as a Viable Computational Tool for Design.
PhD thesis, Department of Computer Science, Indiana University.
Bloomington, IN.

Louis and Johnson, 1997
Louis, S. J. and Johnson, J. (1997).
Solving similar problems using genetic algorithms and case-based memory.
In Proceedings of the Seventh International Conference on Genetic Algorithms, pages 283-290. Morgan Kauffman, San Mateo, CA.

Louis et al., 1993
Louis, S. J., McGraw, G., and Wyckoff, R. (1993).
Case-based reasoning assisted explanation of genetic algorithm results.
Journal of Experimental and Theoretical Artificial Intelligence, 5:21-37.

Louis et al., 1992
Louis, S. J., McGraw, G., and Wyckoff, R. (April, 1992).
Automating explanation of genetic algorithm results (two paradigms collide).
In Proceedings of the Fifth Florida Artificial Intelligence Research Symposium, pages 201-205. FLAIRS, FL.

Mostow et al., 1992
Mostow, J., Barley, M., and Weinrich, T. (1992).
Automated reuse of design plans in bogart.
In Tong, C. and Sriram, D., editors, Artificial Intelligence in Engineering Design, Vol II, pages 57-104. Academic Press, Inc.

Ramsey and Grefensttete, 1993
Ramsey, C. and Grefensttete, J. (1993).
Case-based initialization of genetic algorithms.
In Forrest, S., editor, Proceedings of the Fifth International Conference on Genetic Algorithms, pages 84-91, San Mateo, California. Morgan Kauffman.

Reinelt, 1996
Reinelt, G. (1996).
Tsplib.

Riesbeck and Schank, 1989
Riesbeck, C. K. and Schank, R. C. (1989).
Inside Case-Based Reasoning.
Lawrence Erlbaum Associates, Cambridge, MA.

Schoenauer and Xanthakis, 1993
Schoenauer, M. and Xanthakis, S. (1993).
Constrained ga optimization.
In Proceedings of the Fifth International Conference on Genetic Algorithms, pages 573-580. Morgan Kauffman, San Mateo, CA.

Sheppard and Salzburg, 1995
Sheppard, J. W. and Salzburg, S. L. (1995).
Combining genetic algorithms with memory based reasoning.
In Forrest, S., editor, Proceedings of the Sixth International Conference on Genetic Algorithms, pages 452-459, San Mateo, California. Morgan Kauffman.

Smith, 1985
Smith, D. (1985).
Bin packing with adaptive search.
In Proceedings of an International Conference on Genetic Algorithms, pages 202-206. Morgan Kauffman.

Sycara and Navinchandra, 1992
Sycara, K. and Navinchandra, D. (1992).
Retrieval strategies in case-based design system.
In Tong, C. and Sriram, D., editors, Artificial Intelligence in Engineering Design, Vol II, pages 145-164. Academic Press, Inc.


  
Figure: CIGAR vs. RIGA (p0=76 cities, $\sigma = 6$). Top: Tour length. Middle: Convergence time. Bottom: Solution similarity distribution
\begin{figure}
\centerline{
\psfig{figure=colorfigs/tsp76_gen_sigma6.ps,height...
...sfig{figure=colorfigs/tsp76_sim_sig6.ps,height=2.5in,width=2.5in}
}
\end{figure}


  
Figure: CIGAR vs. RIGA (p0=76 cities, $\sigma = 14$). Top: Tour length. Middle: Convergence time. Bottom: Solution similarity distribution
\begin{figure}
\centerline{
\psfig{figure=colorfigs/tsp76_gen_sigma14.ps,height...
...g{figure=colorfigs/tsp76_sim_sigma14.ps,height=2.5in,width=2.5in}
}
\end{figure}



Sushil Louis
1999-04-06