Evolutionary computation papers

Papers on Evolutionary Computation
by Bryant Julstrom

Papers are listed in reverse chronological order. With most is a link to the corresponding abstract. With some are links to their full text.

2009:

Evolving Heuristically Difficult Instances of Combinatorial Problems. Proceedings of the 2009 Genetic and Evolutionary Computation Conference, Günther Raidl et al., Eds. (GECCO 2009), July 8-12, 2009, Montreal, Quebec, Canada. New York: ACM Press, pp.279-285. Abstract Full text (PDF)
Evolutionary Codings and Operators for the Terminal Assignment Problem. Proceedings of the 2009 Genetic and Evolutionary Computation Conference, Günther Raidl et al., Eds. (GECCO 2009), July 8-12, 2009, Montreal, Quebec, Canada. New York: ACM Press, pp.1805-1806. Abstract Full text (PDF)
A Data-Based Coding of Candidate Strings in the Closest String Problem. Proceedings of the 2009 Genetic and Evolutionary Computation Conference, Günther Raidl et al., Eds. (GECCO 2009), July 8-12, 2009, Montreal, Quebec, Canada. New York: ACM Press, pp.2053-2057. Abstract Full text (PDF)
String- and Permutation-Coded Genetic Algorithms for the Static Weapon-Target Assignment Problem. Proceedings of the 2009 Genetic and Evolutionary Computation Conference , Günther Raidl et al., Eds. (GECCO 2009), July 8-12, 2009, Montreal, Quebec, Canada. New York: ACM Press, pp.2553-2558. Abstract Full text (PDF)

2008:

A Permutation Coding with Heuristics for the Uncapacitated Facility Location Problem. In Recent Advances in Evolutionary Computation for Combinatorial Optimization (Carlos Cotta and Jano van Hemert, Eds.), in the Studies in Computation Intelligence series, Vol.153, pp.295-307. Berlin: Springer, September, 2008. Abstract
An Evolutionary Algorithm for Some Cases of the Single-Source Constrained Plant Location Problem. Proceedings of the 2008 Genetic and Evolutionary Computation Conference, Maarten Keijzer et al., Eds. (GECCO-2008, July 12-16, 2008, Atlanta, GA, USA.) New York: ACM Press, pp.607-608. Abstract Full text
Greedy Heuristics and Evolutionary Algorithms for the Bounded Minimum-Label Spanning Tree Problem. With Arindam Khaled. Proceedings of the 2008 Genetic and Evolutionary Computation Conference, Maarten Keijzer et al., Eds. (GECCO-2008, July 12-16, 2008, Atlanta, GA, USA.) New York: ACM Press, pp.611-612. Abstract Full text
Iterated Mutation in an Evolutionary Algorithm for Sudoku. With Donald O. Hamnes. In Artificial Intelligence and Applications, the proceedings of the IASTED International Conference on Artificial Intelligence and Applications (AIA-2008), February 11-13, 2008, Innsbruck, Austria. ACTA Press, 2008. Abstract

2006:

Starting from Scratch: Growing Longest Common Subsequences with Evolution. With Brenda Hinkemeyer. In Parallel Problem Solving from Nature - PPSN IX, T.P. Runarsson et al., Eds., LNCS 4193. Berlin, Heidelberg: Springer, 2006, pp.930-938. This volume is the proceedings of PPSN IX, September 9-13, 2006, Reykjavik. Abstract
Instance Similarity and the Effectiveness of Case Injection in a Genetic Algorithm for Binary Quadratic Programming. With Jason Amunrud. Proceedings of the 2006 Genetic and Evolutionary Computation Conference, Maarten Keijzer et al., Eds. (GECCO-2006, July 8-12, 2006, Seattle, WA, USA.) New York: ACM Press, V.2, pp.1395-1396. Abstract Full text (PDF)
A Genetic Algorithm for the Longest Common Subsequence Problem. With Brenda Hinkemeyer. Proceedings of the 2006 Genetic and Evolutionary Computation Conference, Maarten Keijzer et al., Eds. (GECCO-2006, July 8-12, 2006, Seattle, WA, USA.) New York: ACM Press, V.1, pp.609-610. Abstract Full text (PDF)
The Quadratic Multiple Knapsack Problem and Three Heuristic Approaches to It. With Amanda Hiley. Proceedings of the 2006 Genetic and Evolutionary Computation Conference, Maarten Keijzer et al., Eds. (GECCO-2006, July 8-12, 2006, Seattle, WA, USA.) New York: ACM Press, V.1, pp.547-552. Abstract Full text (PDF)
An Effective Genetic Algorithm for the Minimum-Label Spanning Tree Problem. With Jeremiah Nummela. Proceedings of the 2006 Genetic and Evolutionary Computation Conference, Maarten Keijzer et al., Eds. (GECCO-2006, July 8-12, 2006, Seattle, WA, USA.) New York> ACM Press, V.1, pp.553-557. Abstract Full text (PDF)
Biased Mutation Operators for Subgraph-Selection Problems. With Günther R. Raidl and Gabriele Koller. IEEE Transactions on Evolutionary Computation, V.10, n.2, pp.145-156. Abstract

2005:

Greedy, Genetic, and Greedy Genetic Algorithms for the Quadratic Knapsack Problem. In Proceedings of the Genetic and Evolutionary Computation Conference, GECCO-2005 (Hans-Georg Beyer et al., Editors), Volume 1, pp.607--614. New York: ACM Press. Abstract Full text (PS)
Evolving Petri Nets to Represent Metabolic Pathways. With Jeremiah Nummela. In Proceedings of the Genetic and Evolutionary Computation Conference, GECCO-2005 (Hans-Georg Beyer et al., Editors), Volume 2, pp.2133-2140. New York: ACM Press. Abstract Full text (PS)
The Blob Code is Competitive with Edge-Sets in Genetic Algorithms for the Minimum Routing Cost Spanning Tree Problem. In Proceedings of the Genetic and Evolutionary Computation Conference, GECCO-2005 (Hans-Georg Beyer et al., Editors), Volume 1, pp.585-590. New York: ACM Press. Abstract Full text (PS)
Call Me E-Mail: Arranging the Keyboard with a Permutation-Coded Genetic Algorithm. With Jeffrey S. Goettl and Alexander W. Brugh. In Applied Computing 2005: Proceedings of the 2005 ACM Symposium on Applied Computing (SAC 2005), (Hisham M. Haddad et al., Editors), Volume 2, pp.947-951. New York: ACM Press. Abstract Full text (PS)

2004:

Codings and Operators in Two Genetic Algorithms for the Leaf-Constrained Minimum Spanning Tree Problem. International Journal of Applied Mathematics and Computer Science, V.14, n.3, pp.385-396. Abstract Full text (PDF)
Encoding Bounded-Diameter Spanning Trees with Permutations and with Random Keys. In Genetic and Evolutionary Computation - GECCO 2004 (Kalyanmoy Deb, et al., Eds.), Part I (LNCS 3102), pp.1272-1281. Berlin: Springer-Verlag. Abstract
Three Evolutionary Codings of Rectilinear Steiner Arborescences. With Athos Antoniades. In Genetic and Evolutionary Computation - GECCO 2004 (Kalyanmoy Deb, et al., Eds.), Part I (LNCS 3102), pp.1282-1291. Berlin: Springer-Verlag. Abstract
How Are We Doing? Predicting Evolutionary Algorithm Performance. With Mark A. Renslow and Brenda Hinkemeyer. In Genetic and Evolutionary Computation - GECCO 2004 (Kalyanmoy Deb, et al., Eds.), Part II (LNCS 3103), pp.82-89. Berlin: Springer-Verlag. Abstract
Hill-Climbers, a Memetic Algorithm, and their Comparison on the Minimum Linear Arrangement Problem. In Workshop Proceedings - Genetic and Evolutionary Computation Conference (Stefano Cagnoni, Ed.). Presented to the workshop on Application of Hybrid Evolutionary Algorithms to Complex Optimization Problems (EvoHybrid-04) at the Genetic and Evolutionary Computation Conference (GECCO 2004), June 26, 2004, Seattle, WA. Abstract
Two Hybrid Evolutionary Algorithms for the Rectilinear Steiner Arborescence Problem. With Athos Antoniades. In Proceedings of the 2004 ACM Symposium on Applied Computing (SAC-2004) (Hisham M. Haddad, et al. editors). March 14-17, 2004, Nicosia, Cyprus. ACM Press, Volume 2, pp.980-984. Abstract Full text (PS)

2003:

Evolutionary Algorithms for Two Problems from the Calculus of Variations. In Genetic and Evolutionary Computation - GECCO 2003 (Eric Cantú-Paz, et al., editors), Part II (LNCS 2724), pp.2402-2403. Berlin: Springer-Verlag. Abstract
A Perturbation-Coded Genetic Algorithm for the Minimum Rectilinear Steiner Arborescence Problem. In 2003 Genetic and Evolutionary Computation Conference - Late-Breaking Papers (James Foster, Ed.), pp.148-152. GECCO-2003 , July 12-16, 2003, Chicago, IL. Abstract
A Hybrid Evolutionary Algorithm for the Rectilinear Steiner Problem. In 2003 Genetic and Evolutionary Computation Conference Workshop Program (Alwyn Barry, Ed.), pp.49-55. Presented to the Workshop on the Application of Evolutionary Algorithms to NP-complete Problems (EvoHybridNP) at the 2003 Genetic and Evolutionary Computation Conference (GECCO-2003), July 12, 2003, Chicago, IL. Abstract Full text (PDF)
A Permutation-Coded Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem. With Günther R. Raidl. In 2003 Genetic and Evolutionary Computation Conference Workshop Program (Alwyn Barry, Ed.), pp.2-7. Presented to the Workshop on Analysis and Design of Representations and Operators (ADoRO-2003) at the 2003 Genetic and Evolutionary Computation Conference (GECCO-2003), July 12, 2003, Chicago, IL. Abstract Full Text (PDF)
Edge-Sets: An Effective Evolutionary Coding of Spanning Trees. With Günther R. Raidl. IEEE Transactions on Evolutionary Computation, V.7, n.3 (June), 2003, pp.225-239. Abstract
A Genetic Algorithm for Restricted Cases of the Rectilinear Steiner Problem with Obstacles. With Rita M. Hare. In Proceedings of the 2003 International Conference on VLSI (VLSI-2003) (H. R. Arabnia and Laurence Tianruo Yang, editors; Youngsong Mun and Allanus H. Tsoi, associate editors). June 23-26, 2003, Las Vegas, NV. CSREA Press, pp.292-297. Abstract
Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem. With Günther R. Raidl. In Proceedings of the 2003 ACM Symposium on Applied Computing (SAC-2003) (Gary Lamont, et al. editors). March 9-12, 2003, Melbourne, FL, USA. ACM Press, pp.747-752. Abstract Full text (PS)
A Spanning-Tree-Based Genetic Algorithm for Some Instances of the Rectilinear Steiner Problem with Obstacles. With Rita M. Hare. In Proceedings of the 2003 ACM Symposium on Applied Computing (SAC-2003) (Gary Lamont, et al. editors). March 9-12, 2003, Melbourne, FL, USA. ACM Press, pp.725-729. Abstract Full text (PS)

2002:

On Weight-Biased Mutation for Graph Problems. With Günther R. Raidl and Gabriele Kodydek. In Parallel Problem Solving from Nature - PPSN VII (Juan Julián Merelo Guervós, Panagiotis Adamidis, Hans-Georg Beyer, José-Luis Fernández-Villacañas, and Hans-Paul Schwefel, Eds.). September, 2002, Granada, Spain. Berlin: Springer-Verlag, LNCS 2439, pp.204-213. Abstract Full text (PDF)
Manipulating Valid Solutions in a Genetic Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem. In 2002 Genetic and Evolutionary Computation Conference Late-Breaking Papers (Erick Cantú-Paz, Ed.), pp.247-254. GECCO-2002, July 9-13, 2002, New York, NY. Abstract
Codings and Search Space Size in Genetic Algorithms for the Leaf-Constrained Minimum Spanning Tree Problem. In 2002 Genetic and Evolutionary Computation Conference Workshop Program (Alwyn Barry, Ed.), pp.180-186. Presented to the workshop on Representations for Genetic and Evolutionary Algorithms (ReGEA-2002) at the Genetic and Evolutionary Computation Conference 2002 (GECCO-2002), July 9, 2002, New York, NY. Abstract; full text (gzipped PostScript)
A Genetic Algorithm and Two Hill-Climbers for the Minimum Routing Cost Spanning Tree Problem. In Proceedings of the International Conference on Artificial Intelligence IC-AI'02 (H. R. Arabnia and Youngsong Mun, Eds.), Volume III. June 24-27, 2002, Las Vegas, NV. CSREA Press, pp.934--940. Abstract
Applying Local Search in a Genetic Algorithm for the 4-Cycle Problem. In Proceedings of the International Conference on Artificial Intelligence IC-AI'02 (H. R. Arabnia and Youngsong Mun, Eds.), Volume III. June 24-27, 2002, Las Vegas, NV. CSREA Press, pp.941--945. Abstract
Two Genetic Algorithms for the Leaf-Constrained Minimum Spanning Tree Problem. In Proceedings of the International Conference on Artificial Intelligence IC-AI'02 (H. R. Arabnia and Youngsong Mun, Eds.), Volume III. June 24-27, 2002, Las Vegas, NV. CSREA Press, pp.853-859. Abstract
A Scalable Genetic Algorithm for the Rectilinear Steiner Problem. In Proceedings of the 2002 Congress on Evolutionary Computation CEC'02, May 12-17, 2002, Honolulu, HI. Piscataway, NJ: IEEE Press, pp.1169-1173. Abstract
Initialization Is Robust in Evolutionary Algorithms That Encode Spanning Trees as Lists of Edges. With Günther Raidl. In Proceedings of the 2002 ACM Symposium on Applied Computing (SAC-2002), March 10-14, 2002, Madrid, pp.547-552. Abstract Full text (PS)

2001:

Comparing a Genetic Algorithm and Hill-Climbing on the Minimum Routing Cost Spanning Tree Problem. In 2001 Genetic and Evolutionary Computation Conference Late-Breaking Papers (Chris Armstrong, Ed.), pp.211-218. GECCO-2001, July 7-11, 2001, San Francisco, CA. Abstract
The Blob Code: A Better String Coding of Spanning Trees for Evolutionary Search. In 2001 Genetic and Evolutionary Computation Conference Workshop Program (Annie S. Wu, Ed.), pp.256-261. Presented to the workshop on Representations and Operators for Network Problems (ROPNET-2001) at the 2001 Genetic and Evolutionary Computation Conference (GECCO-2001), July 7, 2001, San Francisco, CA. Abstract; full text (gzipped PostScript)
Prüfer Numbers: A Poor Representation of Spanning Trees for Evolutionary Search. With Jens Gottlieb, Günther Raidl, and Franz Rothlauf.
In Proceedings of the Genetic and Evolutionary Computation Conference (GECCO-2001) (L. Spector, E. Goodman, A. Wu, W. B. Langdon, H.-M. Voigt, M. Gen, S. Sen, M. Dorigo, S. Pezeshk, M. Garzon, and E. Burke, Eds.). July, 2001, San Francisco, CA. San Francisco: Morgan Kauffman, pp.343-350. Abstract
Working Paper 12/2000, Working Papers in Information Systems (Armin Heinzl, Ed.), University of Bayreuth, Bayreuth, Germany.
Technical Report 2001001, Illinois Genetic Algorithms Laboratory (IlliGAL), University of Illinois at Urbana-Champaign. Abstract and full text (Select 2001 and submit.)
A Web-Based Evolutionary Algorithm Demonstration using the Traveling Salesman Problem. With Richard E. Mowe. Accepted January, 2001, to the 34th Annual Midwest Instruction and Computing Symposium (MICS-2001), April 5-7, 2001, Cedar Falls, IA. Abstract
Encoding Rectilinear Steiner Trees as Lists of Edges. In Proceedings of the 16th ACM Symposium on Applied Computing (SAC-2001) (Gary Lamont, Janice Carroll, Hisham Haddad, Don Morton, George Papadopoulos, Richard Sincovec, and Angelo Yfantis, Eds.). March, 2001, Las Vegas, NV. New York: ACM Press, pp.356-360. Abstract Full text (PS)
Weight-Biased Edge-Crossover in Evolutionary Algorithms for Two Graph Problems. With Günther R. Raidl. In Proceedings of the 16th ACM Symposium on Applied Computing (SAC-2001) (Gary Lamont, Janice Carroll, Hisham Haddad, Don Morton, George Papadopoulos, Richard Sincovec, and Angelo Yfantis, Eds.). March, 2001, Las Vegas, NV. New York: ACM Press, pp.321-326. Abstract Full text (PS)

2000:

Simulating Exponential Normalization with Weighted k-Tournaments. With David H. Robinson. In Proceedings of the 2000 Congress on Evolutionary Computation (CEC 2000), July, 2000; San Diego, CA. Piscataway, NJ: IEEE Press, Volume 1, pp.227-231. Abstract and correction
A Course on Evolutionary Computation at St. Cloud State. With Terry Soule. Workshop on Evolutionary Algorithm Teaching/Education at the 2000 Congress on Evolutionary Computation (CEC 2000), July, 2000; San Diego, CA. Full text and some course materials (HTML)
Comparing Lists of Edges with Two Other Genetic Codings of Rectilinear Steiner Trees. In Late Breaking Papers at the 2000 Genetic and Evolutionary Computation Conference (GECCO-2000), July, 2000; Las Vegas, NV, pp.155-161. Abstract
The Development of Cooperation in Genetic Algorithms for the Iterated Prisoner's Dilemma. In Proceedings of the 33rd Annual Midwest Instruction and Computing Symposium (MICS 2000), April, 2000; St. Paul, MN. (Proceedings on-line.) Abstract Full text (PDF)
A Weighted Coding in a Genetic Algorithm for the Degree-Constrained Minimum Spanning Tree Problem. With Günther R. Raidl. In Applied Computing 2000: Proceedings of the 2000 ACM Symposium on Applied Computing (SAC 2000) (Janice Carroll, Ernesto Damiani, Hisham Haddad, and Dave Oppenheim, Eds.). March, 2000; Como, Italy. New York: ACM Press, Volume 1, pp.440-445. Abstract

1999:

Redundant Genetic Encodings May Not Be Harmful. In Proceedings of the 1999 Genetic and Evolutionary Computation Conference (GECCO'99) (Wolfgang Banzhaf, Jason Daida, Agoston E. Eiben, Max H. Garzon, Vasant Honavar, Mark Jakiela, and Robert E. Smith, Eds.). July, 1999; Orlando, FL. San Francisco, CA: Morgan Kaufmann Publishers, V.1, p.791. Abstract Full text (HTML)
Comparing Darwinian, Baldwinian, and Lamarckian Search In a Genetic Algorithm for the 4-Cycle Problem. In Late Breaking Papers at the 1999 Genetic and Evolutionary Computation Conference (GECCO'99) (Scott Brave and Annie S. Wu. Eds.). July, 1999; Orlando, FL, pp.134-138. Abstract Full text (PostScript)
It's All the Same to Me: Revisiting Rank-Based Probabilities and Tournaments. In Proceedings of the 1999 Congress on Evolutionary Computation (CEC'99). July, 1999; Washington, DC. Piscataway, NJ: IEEE Press, V.2, pp.1501-1505. Abstract
Coding TSP Tours as Permutations via an Insertion Heuristic. In Applied Computing 1999: Proceedings of the 1999 ACM Symposium on Applied Computing (SAC'99) (Janice Carroll, Hisham Haddad, Dave Oppenheim, Barrett Bryant, and Gary B. Lamont, Eds.). February 28 - March 2, 1999; San Antonio, TX. New York: ACM Press, pp.297-301. Abstract Full text (PS)

1998:

Insertion Decoding Algorithms and Initial Tours in a Weight-Coded GA for TSP. In Genetic Programming 1998: Proceedings of the Third Annual Conference (GP'98) (John R. Koza, Wolfgang Banzhaf, Kumar Chellapilla, Kalyanmoy Deb, Marco Dorigo, David E. Fogel, Hitoshi Iba, and Rick Riolo, Eds.). July, 1998; Madison, WI. San Francisco, CA: Morgan Kaufmann, pp.528-534. Abstract
Generalized Instant Insanity: A GA-Difficult Problem. With Robert Walsh. In Late-Breaking Papers at the Genetic Programming 1998 Conference (GP'98) (John R. Koza, Ed.). University of Wisconsin, Madison, WI, July 22-25, 1998. Stanford, CA: Stanford University Bookstore, pp.229-232. Abstract
The Maximum Weight Parameter in a Weight-Coded GA for TSP. In Late-Breaking Papers at the Genetic Programming 1998 Conference (GP'98) (John R. Koza, Ed.). University of Wisconsin, Madison, WI, July 22-25, 1998. Stanford, CA: Stanford University Bookstore, pp.101-105. Abstract
Genetic Rearrangement of VQ Codewords for Minimum Distortion under Transmission Errors. With Xiaowei Zheng and Weidong Cheng. In Proceedings of the 1998 International Conference on Imaging Science (CISST'98). July, 1998; Las Vegas, NV. CSREA Press, pp.183-188. Abstract
A Course on Genetic Algorithms for Seniors and Graduate Students. In Proceedings of the 31st Annual Small College Computing Symposium (SCCS'98). North Dakota State University, Fargo, ND, April 16-18, 1998, pp.210-216. Abstract
Comparing Decoding Algorithms in a Weight-Coded GA for TSP. In Applied Computing 1998: Proceedings of the 1998 ACM Symposium on Applied Computing (SAC'98) (Janice Carroll, Gary B. Lamont, Dave Oppenheim, K. M. George, and Barrett Bryant, Eds.). February 27 - March 1, 1998; Atlanta, GA. New York: ACM Press, pp.313-317. Abstract Full text (PS)
A Weight-Coded Genetic Algorithm for the Minimum Weight Triangulation Problem. With Kerry Capp. In Applied Computing 1998: Proceedings of the 1998 ACM Symposium on Applied Computing (SAC'98) (Janice Carroll, Gary B. Lamont, Dave Oppenheim, K. M. George, and Barrett Bryant, Eds.). February 27 - March 1, 1998; Atlanta, GA. New York: ACM Press, pp.327-331. Abstract Full text (PS)

1997:

Strings of Weights as Chromosomes in Genetic Algorithms for Combinatorial Problems. In Proceedings of the Third Nordic Workshop on Genetic Algorithms and their Applications (3NWGA) (Jarmo T. Alander, Ed.). August 20-22, 1997; Helsinki, Finland, pp.33-48. Abstract
Effects of Contest Length and Noise on Reciprocal Altruism, Cooperation, and Payoffs in the Iterated Prisoner's Dilemma. In Proceedings of the Seventh International Conference on Genetic Algorithms (ICGA'97) (Thomas Bäck,Ed.). San Francisco, CA: Morgan Kaufmann, 1997, pp.386-392. Abstract Full text (PS)
Strings of Weights as Chromosomes in Genetic Algorithms for the Traveling Salesman Problem. In Late-Breaking Papers at the Genetic Programming 1997 Conference (GP'97) (John R. Koza, Ed.). Stanford University, July, 1997; Stanford, CA. Abstract
Design of Vector Quantization Codebooks Using a Genetic Algorithm. With Xiaowei Zheng and Weidong Cheng. In Proceedings of 1997 IEEE International Conference on Evolutionary Computation (ICEC'97). Piscataway, NJ: IEEE Press, pp.525-529. Abstract
Adaptive Operator Probabilities in a Genetic Algorithm that Applies Three Operators. In Applied Computing 1997: Proceedings of the 1997 ACM Symposium on Applied Computing (SAC'97) (Barrett Bryant, Janice Carroll, Dave Oppenheim, Jim Hightower, and K. M. George, Eds.). New York: ACM Press, 1997, pp.233-238. Abstract Full text (PS)

1996:

An Inquiry into the Behavior of Adaptive Operator Probabilities in Steady-State Genetic Algorithms. In Proceedings of the Second Nordic Workshop on Genetic Algorithms and their Applications (2NWGA) (Jarmo T. Alander, Ed.). Vaasa, Finland, August 21-23, 1996, pp.3-13. Abstract Full text (HTML)
A Simple Estimate of Population Size in Genetic Algorithms for the Traveling Salesman Problem. In Proceedings of the Second Nordic Workshop on Genetic Algorithms and their Applications (2NWGA) (Jarmo T. Alander, Ed.). Vaasa, Finland, August 21-23, 1996, pp.15-26. Abstract Full text (HTML)
Contest Length, Noise, and Reciprocal Altruism in the Population of a Genetic Algorithm for the Iterated Prisoner's Dilemma. In Late-Breaking Papers at the Genetic Programming 1996 Conference (GP'96) (John R. Koza, Ed.). Stanford University, July 28-31, 1996, Stanford, CA: Stanford University Bookstore, pp.88-93. Abstract
A Genetic Algorithm That Illustrates Its Progress on the Traveling Salesman Problem. With Richard E. Mowe. In Proceedings of the 29th Annual Small College Computing Symposium (SCCS'96). April 18-20, 1996, St. Cloud, MN, pp330-337. Abstract
A Genetic Algorithm Demonstration using VT-100 Graphics and the Rectilinear Steiner Problem. In Proceedings of the 29th Annual Small College Computing Symposium (SCCS'96). April 18-20, 1996, St. Cloud, MN, pp.1-9. Abstract
Evolutionary Discovery of DFA Size and Structure. In Applied Computing 1996: Official Program of the 1996 ACM Symposium on Applied Computing (SAC'96) (K.M.George, Janice H. Carrol, Dave Oppenheim, and Jim Hightower, Eds.). New York: ACM Press, 1996, pp.263-268. Abstract Full text (PS)
Representing Rectilinear Steiner Trees in Genetic Algorithms. In Applied Computing 1996: Official Program of the 1996 ACM Symposium on Applied Computing (SAC'96) (K.M.George, Janice H. Carrol, Dave Oppenheim, and Jim Hightower, Eds.). New York: ACM Press, 1996, pp.245-250. Abstract Full text (PS)

1995:

What Have You Done for Me Lately? Adapting Operator Probabilities in a Steady-State Genetic Algorithm. In Genetic Algorithms: Proceedings of the Sixth International Conference (ICGA'95) (Larry J. Eshelman, Ed.). San Mateo, CA: Morgan Kaufmann Publishers, pp.81-87. Abstract
Very Greedy Crossover in a Genetic Algorithm for the Traveling Salesman Problem. In Applied Computing 1995: Proceedings of the 1995 ACM Symposium on Applied Computing (SAC'95) (K. M. George, Janice H. Carroll, Ed Deaton, Dave Oppenheim, and Jim Hightower, Eds.). February 26-28, 1995, Nashville, Tennessee. New York: ACM Press, pp.324-328. Abstract Full text (PS)

1994:

Seeding the Population: Improved Performance in a Genetic Algorithm for the Rectilinear Steiner Problem. In Applied Computing 1994: Proceedings of the 1994 ACM Symposium on Applied Computing (SAC'94) (Ed Deaton, Dave Oppenheim, Joseph Urban, and Hal Berghel, Eds.). March 6-8, 1994, Phoenix, Arizona. New York: ACM Press, pp.222-226. Abstract Full text (PS)

1993:

A Genetic Algorithm for the Rectilinear Steiner Problem. In Genetic Algorithms: Proceedings of the Fifth International Conference (ICGA'93) (Stephanie Forrest, Ed.). July 17-22, 1993, Champaign, Illinois. San Mateo, CA: Morgan Kaufmann Publishers, pp.474-480. Abstract