Roger Wainwright - Faculty & Adjuncts

Roger Wainwright, PhD

Roger Wainwright, PhD
A.R. and Marylouise Tandy Professor of Computer Science
A.R. and Marylouise Tandy Professor of Computer Science
College of Engineering & Natural Sciences
Computer Science
918-631-3143 Rayzor Hall Room 2115

Education

PhD – Iowa State University MS – Iowa State University BS – Iowa State University

Bio

B.S. Mathematics and Computer Science (double major), Iowa State University, 1969

M.S. Computer Science, Iowa State University, 1971

Ph.D. Computer Science, Iowa State University, 1974

TU Faculty since 1974.

Tandy Professor and Chairman of the Tandy School of Computer Science

Research Interests

Combinatorial Optimization
Evolutionary Computer
Genetic Algorithms

Teaching Interests

Data Structures
Discrete Mathematics
Analysis of Algorithms
Programming Language Theory
Evolutionary Computation

Publications

Journal Articles

Conference Proceedings

  • P.A. Simionescu, G.V. Dozier, R.L. Wainwright, “A Two-Population Evolutionary Algorithm for
    Constrained Optimization problems”, IEEE World Congress on Computational Intelligence,
    Vancouver, BC, Canada, July 2006.

  • Andrew Hand, Jagruthi Godugu, Kaveh Ashenayi, Theodore W. Manikas, Roger L. Wainwright,
    “Benchmarking Robot Path Planning”, ANNIE 2005, November, 2005.

  • Alkhalifah, Yaser, and Wainwright, Roger L., “A Genetic Algorithm Applied to Graph Problems Involving Subsets of Vertices”, Proceedings of the 2004 IEEE Congress on Evolutionary Computation, pp. 303-308, June 20-23, 2004, Portland Oregon, USA.

  • Kamran Sedighi, Kaveh Ashenayi, Theodore Manikas, Roger L. Wainwright, and Tai, Heng-Ming, “Autonomous Local Path-Planning for a Mobile Robot Using a Genetic Algorithm”, Proceedings of the 2004 IEEE Congress on Evolutionary Computation, pp. 1338-1345, June 20-23, 2004, Portland, Oregon, USA.

  • Galiasso P., and Wainwright R. “A Hybrid Genetic Algorithm for the Point to Multipoint Routing Problem With Single Split Paths”. Proceedings of the 2001 ACM Symposium on Applied Computing, ACM, 2001, pp. 327–332.
  • Enochs B., and Wainwright R. Forging Optimal Solutions to the Edge-Coloring Problem. Proceedings of the Genetic and Evolutionary Computation Conference, GECCO-2001, 2001, pp. 313-9.
  • Scheduling of Multi-Product Fungible Liquid Pipelines Using Genetic Algorithms”. Proceedings of the 1999 ACM Symposium on Applied Computing, ACM, 1999, pp. 280–285.
  • A Genetic Algorithm for the Point to Multipoint Routing Problem With Varying Number of Requests. Proceedings of the 1998 IEEE International Conference on Evolutionary Computation (ICEC’98), 1998, pp. 171-6.
  • Ajenblit D., and Wainwright R. Applying Genetic Algorithms to the U-Shaped Assembly Line Balancing Problem. Proceedings of the 1998 IEEE International Conference on Evolutionary Computation (ICEC’98), 1998, pp. 96-101.
  • Cook C., Schoenfeld D., and Wainwright R. “Finding Rural Postman Tours”. Proceedings of the 1998 ACM Symposium on Applied Computing, ACM, 1998, pp. 318–326.
  • A Hybrid Algorithm for the Point to Multipoint Routing Problem. Proceedings of the 1997 ACM Symposium on Applied Computing (SAC’97), 1997, pp. 263–268.
  • A Genetic Algorithm for the Minimum Broadcast Time Problem Using a Global Precedence Vector”. Proceedings of the 1996 ACM Symposium on Applied Computing, ACM, 1996, pp. 258–262.
  • Haynes T., Gamble R., Knight L., and Wainwright R. “Entailment for Specification Refinement”. Proceedings of the 1st Annual Conference on Genetic Programming, MIT Press, 1996, pp. 90–97.
  • Hoelting C., Schoenefeld D., and Wainwright R. “Finding Investigator Tours in Telecommunication Networks Using Genetic Algorithms”. Proceedings of the 1996 ACM Symposium on Applied Computing, ACM, 1996, pp. 82–87.
  • Corcoran A., and Wainwright R. “Reducing Disruption of Superior Building Blocks in Genetic Algorithms”. Proceedings of the 1996 ACM Symposium on Applied Computing, ACM, 1996, pp. 269–276.
  • Solving Facility Layout Problems Using Genetic Programming”. Proceedings of the 1st Annual Conference on Genetic Programming, MIT Press, 1996, pp. 182–190.
  • Solving the Subset Interconnection Design Problem Using Genetic Algorithms”. Proceedings of the 1996 ACM Symposium on Applied Computing, ACM, 1996, pp. 299–304.
  • Haynes T., and Wainwright R. “A Simulation of Adaptive Agents in a Hostile Environment”. Proceedings of the 1995 ACM Symposium on Applied Computing, ACM, 1995, pp. 318–323.
  • “Applying Genetic Algorithms to Outlier Detection”. Proceedings of the 6th International Conference on Genetic Algorithms (ICGA’95), Pittsburgh, PA, USA, July 15-19, 1995, 1995, pp. 546–550.
  • Crawford K., and Wainwright R. “Applying Genetic Algorithms to Outlier Detection”. Proceedings of the 6th International Conference on Genetic Algorithms (ICGA’95), Pittsburgh, PA, USA, July 15-19, 1995, 1995, pp. 546–550.
  • Approximation Techniques for Variations of the P-Median Problem”. Proceedings of the 1995 ACM Symposium on Applied Computing, ACM, 1995, pp. 293–299.
  • Crawford K., Vasicek D., and Wainwright R. “Detecting Multiple Outliers in Regression Data Using Genetic Algorithms”. Proceedings of the 1995 ACM Symposium on Applied Computing, ACM, 1995, pp. 351–356.
  • Determinant Factorization and Cycle Basis: Encoding Schemes in Genetic Algorithms for the Representation of Spanning Trees in Incomplete Graphs. Proceedings of the 1995 ACM/SIGAPP Symposium on Applied Computing, 1995.
  • Determinant Factorization and Cycle Basis: Encoding Schemes for the Representation of Spanning Trees on Incomplete Graphs. Proceedings of the 1995 ACM/SIGAPP Symposium on Applied Computing, 1995, pp. 305–312.
  • Determinant Factorization: A New Encoding Scheme for Spanning TreesApplied to the Probabilistic Minimum Spanning Tree Problem. Proceedings of the Sixth International Conference on Genetic Algorithms (ICGA’95), 1995, pp. 470–477.
  • Evolving Cooperation Strategies. First International Conference on Multiagent Systems (ICMAS-95), 1995, p. 450.
  • Solving the Three-Star Tree Isomorphism Problem Using Genetic Algorithms”. Proceedings of the 1995 ACM Symposium on Applied Computing, ACM, 1995, pp. 337–344.
  • “Strongly Typed Genetic Programming in Evolving Cooperation Strategies”. Proceedings of the 6th International Conference on Genetic Algorithms, Pittsburgh, PA, USA, July 15-19, 1995, 1995, pp. 271–278.
  • Corcoran A., and Wainwright R. “A Parallel Island Model Genetic Algorithm for the Multiprocessor Scheduling Problem”. Proceedings of the 1994 ACM Symposium on Applied Computing, ACM, 1994, pp. 483–487.
  • Designing Telecommunications Networks Using Genetic Algorithms and Probabilistic Minimum Spanning Trees”. Proceedings of the 1994 ACM Symposium on Applied Computing, ACM, 1994, pp. 242–246.
  • Gonzalez C., and Wainwright R. Dynamic Scheduling of Computer Tasks Using Genetic Algorithms. Proceedings of the First IEEE Conference on Evolutionary Computation – IEEE World Congress on Computational Intelligence, 1994, pp. 829–833.
  • Terminal Assignment in a Communications Network Using Genetic Algorithms”. Proceedings of the 22Nd Annual ACM Computer Science Conference on Scaling Up : Meeting the Challenge of Complexity in Real-World Computing Applications: Meeting the Challenge of Complexity in Real-World Computing Applications, ACM, 1994, pp. 74–81.
  • Corcoran A., and Wainwright R. “LibGA: A User-Friendly Workbench for Order-Based Genetic Algorithm Research”. Proceedings of the 1993 ACM/SIGAPP Symposium on Applied Computing: States of the Art and Practice, ACM, 1993, pp. 111–117.
  • Strate S., and Wainwright R. “Load Balancing Techniques for Dynamic Programming Algorithms on Hypercube Multiprocessors”. Proceedings of the 1993 ACM/SIGAPP Symposium on Applied Computing: States of the Art and Practice, ACM, 1993, pp. 562–569.
  • Sekharan D., and Wainwright R. Manipulating Subpopulations in Genetic Algorithms for Solving the K-Way Graph Partitioning Problem. Proceedings of the Seventh Oklahoma Conference on Artificial Intelligence, 1993, pp. 215-2.
  • Sekharan D., and Wainwright R. “Manipulating Subpopulations of Feasible and Infeasible Solutions in Genetic Algorithms”. Proceedings of the 1993 ACM/SIGAPP Symposium on Applied Computing: States of the Art and Practice, ACM, 1993, pp. 118–125.
  • Blanton J., and Wainwright R. “Multiple Vehicle Routing With Time and Capacity Constraints UsingGenetic Algorithms”. Proceedings of the 5th International Conference on Genetic Algorithms,Urbana-Champaign, IL, USA, June 1993, 1993, pp. 452–459.
  • Wu Y., and Wainwright R. Near-Optimal Triangulation of a Point Set Using Genetic Algorithm. Proceedings of the Seventh Oklahoma Conference on Artificial Intelligence, 1993, pp. 122-31.
  • The Design of a Multipoint Line Topology for a Communication Network Using Genetic Algorithms. Proceedings of the Seventh Oklahoma Conference on Artificial Intelligence, 1993, pp. 101-10.
  • Corcoran A., and Wainwright R. The Performance of a Genetic Algorithm on a Chaotic Objective Function. Proceedings of the Seventh Oklahoma Conference on Artificial Intelligence, 1993, pp. 200-6.
  • Wainwright R. “A Genetic Algorithm for Packing in Three Dimensions”. Proceedings of the 1992 ACM/SIGAPP Symposium on Applied Computing: Technological Challenges of the 1990’s, ACM, 1992, pp. 1021–1030.
  • Knight L., and Wainwright R. HYPERGEN – A Distributed Genetic Algorithm on a Hypercube. Proceedings of the 1992 IEEE Scalable High Performance Computing Conference, 1992, pp. 232-5.
  • Mutalik P., Knight L., Blanton J., and Wainwright R. “Solving Combinatorial Optimization Problems Using Parallel Simulated Annealing and Parallel Genetic Algorithms”. Proceedings of the 1992 ACM/SIGAPP Symposium on Applied Computing: Technological Challenges of the 1990’s, ACM, 1992, pp. 1031–1038.
  • Blanton J., and Wainwright R. Vehicle Routing With Time Windows Using Genetic Algorithms. Proceedings of the Sixth Oklahoma Symposium on Artificial Intelligence, 1992, pp. 242-51.
  • Mallampati D., Mutalik P., and Wainwright R. A Parallel Multi-Stage Implementation of Simulated Annealing for the Traveling Salesman Problem. Proceedings of the Sixth IEEE Distributed Memory Computing Conference, 1991, pp. 488-91.
  • Abuali F., and Wainwright R. “Fringe Analysis of Binary Search Trees With Miniml Internal Path Length”. Proceedings of the 19th Annual Conference on Computer Science, ACM, 1991, pp. 61–70.
  • Page R., Sexton M., and Wainwright R. A Functional Program Describing a Simple Reservoir Model and Its Potential for Parallel Processing. Proceedings of the 1990 ACM/IEEE Symposium on Applied Computing, 1990, pp. 85-91.
  • Strate S., and Wainwright R. Parallelization of the Dynamic Programming Algorithm for the Matrix Chain Product on a Hypercube. Proceedings of the 1990 ACM/IEEE Symposium on Applied Computing, 1990, pp. 78-84.
  • Wainwright R. “Parallel Sieve Algorithms on a Hypercube Multiprocessor”. Proceedings of the 17th Conference on ACM Annual Computer Science Conference, ACM, 1989, pp. 232–238.
  • Wainwright R. The Conjugate Gradient Method for Solution of Large Sparse Systems of Linear Equations on Hypercubes Applied to Reservoir Modeling. Proceedings of the 1989 ACM South Central Regional Conference, 1989, pp. 134-41.
  • Wainwright R. A Software Kernel for a Pipeline Model for Solving Sparse Matrix Problems on a Hypercube Multiprocessor Applied to Reservoir Simulation. Proceedings of the Fourth Conference on Hypercube Concurrent Computers and Applications, 1989, pp. 1227-32.
  • Wainwright R. Message Passing Considerations for Hypercube Multiprocessors. Proceedings of the Second Workshop on Applied Computing, 1988, pp. 115-34.
  • Wainwright R. “Quicksort Algorithms With an Early Exit for Sorted Subfiles”. Proceedings of the 15th Annual Conference on Computer Science, ACM, 1987, pp. 183–190.
  • Scott S., Wainwright R., Raghavan R., and Demuth H. Application of Parallel (MIMD) Computers to Reservoir Simulation. Proceedings of the Ninth SPE Symposium on Reservoir Simulation, 1987.
  • Singgih P., Demuth H., Hagan M., and Wainwright R. “Parallel Merge-Sort Algorithms on the HEP”. Proceedings of the 1986 ACM Fourteenth Annual Conference on Computer Science, ACM, 1986, pp. 237–244.
  • Crawford K., and Wainwright R. “Parallel Sorting Algorithms for Insertion Shell and Heapsort on the HEP (Abstract)”. Proceedings of the 1986 ACM Fourteenth Annual Conference on Computer Science, ACM, 1986, p. 481–.

Book Chapters

  • “A Study of Fixed-Length Subset Recombination”. Foundations of Genetic Algorithms, Vol. 4, Morgan Kaufmann, 1996, pp. 365–378.
  • “Type Inheritance in Strongly Typed Genetic Programming””. Advances in Genetic Programming 2, MIT Press, 1996, pp. 359-76.
  • Corcoran A., and Wainwright R. “Using LibGA to Develop Genetic Algorithms for Solving Combinatorial Optimization Problems”. Practical Handbook of Genetic Algorithms, Applications Volume I, CRC Press, 1995, pp. 143-72.
  • Wainwright R. “Sorting Algorithms”. The Encyclopedia of Computer Science, and Technology, Vol. 21, Marcel Dekker Publishers, 1990, pp. 329-75.

Courses Taught

  • Comparative Programming Languages
  • Introduction to Programming and Problem- Solving
  • Programming Languages and Structures
  • Discrete Mathematics
  • Operating Systems and Discrete Structures
  • Data Structures
  • Introduction to Computer Science

Professional Affiliations

  • Special interest group on Applied Computing (SIGAPP)
  • Institute of Electrical and Electronics Engineers (IEEE)
  • Association for Computing Machinery (ACM)

Awards & Honors

  • Outstanding Teacher Award
  • Tau Beta Pi Professor of the Month, October, 1991
  • Tau Beta Pi Professor of the Month, September, 1989
  • Phi Eta Sigma
  • Pi Mu Epsilon
  • Tau Beta Pi Professor of the Month, February, 1993
  • 1983 TU OUTSTANDING TEACHER AWARD
  • Mortar Board “Professor of the Month” March 1985
  • 1978 Tau Beta Pi College of ENS TEACHING EXCELLENCE AWARD