ASERC -a genetic sequencing operator for asymmetric permutation problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1822, Issue , 2000, Pages 201-213

  Wiese, Kay C ^a   Goodwin, Scott D ^b   Nagarajan, Sivakumar ^b  

^a UNIVERSITY OF BRITISH COLUMBIA   (Canada)

^b UNIVERSITY OF REGINA   (Canada)

Author keywords

Combinatorial optimization; Constrained ordering problems; Evolutionary computation; Genetic algorithms; Genetic sequencing operators; Search; Selection strategies

Indexed keywords

COMBINATORIAL OPTIMIZATION; CONSTRAINED OPTIMIZATION; EVOLUTIONARY ALGORITHMS;

COMBINATORIAL OPTIMIZATION PROBLEMS; CONSTRAINED ORDERINGS; CONSTRAINT OPTIMIZATIONS; GENETIC ALGORITHM (GAS); GENETIC SEQUENCING; RECOMBINATION OPERATORS; SEARCH; SELECTION STRATEGIES;

GENETIC ALGORITHMS;

EID: 0344113906     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45486-1_17     Document Type: Conference Paper

References (15)

1. Bäck T., Evolutionary Algorithms in Theory and Practice, NewYork,Oxford University Press, 1995.
2. Bäck T., D.B. Fogel, and Z. Michalewicz, Eds., Handbook of Evolutionary Computation, New York, Oxford University Press and Institute of Physics, 1997.
3. Darrah S., “Bus Routing Problem with Time Windows Using Genetic Algorithms,” CS420 Project Report, University of Regina, Dept. of Computer Science, Regina, Canada, 1999.
4. Davis, L., “Job Shop Scheduling with Genetic Algorithms,” Proceeding of the 1st International Conference on Genetic Algorithms ICGA-85, pp. 136-140, 1985.
5. Davis, L., “Applying Adaptive Algorithms to Epistatic Domains,” in Proceedings International Joint Conference on Artificial Intelligence, IJCAI-85, 1985.
6. Goldberg, D.E. and R. Lingle Jr., “Alleles, Loci, and the Traveling Salesman Problem,” Proceedings of the 1st International Conference on Genetic Algorithms ICGA-85, pp. 154-159, 1985.
7. Maekawa, K. et al, “A Genetic Solution for the Traveling Salesman Problem by Means of a Thermodynamical Selection Rule,” Proceedings of the 1996 International Conference on Evolutionary Computation ICEC-96, pp. 529-534, 1996.
8. Oliver, I.M., D.J. Smith, and J.R.C. Holland, “A Study of Permutation Crossover Operators on the Traveling Salesman Problem,” Proceedings of the 2nd International Conference on Genetic Algorithms ICGA-87, pp. 224-230, 1987.
9. Starkweather, T., S. McDaniel, et al, “A Comparison of Genetic Sequencing Operators,” Proceedings of the 4th International Conference on Genetic Algorithms ICGA-91, pp. 69-76, 1991.
10. Syswerda, G., “Schedule Optimization Using Genetic Algorithms,” Handbook of Genetic Algorithms, L. Davis (editor), Chapter 21, Thomson Computer Press, 1990.
11. Wiese, K. and S.D. Goodwin, “Keep-Best Reproduction: A Selection Strategy for Genetic Algorithms,” Proceedings of the 1998 ACM Symposium on Applied Computing SAC'98, Genetic Algorithms Track, pp. 343-348, 1998.
12. Wiese, K., and S.D. Goodwin, “The Effect of Genetic Operator Probabilities and Selection Strategies on the Performance of a Genetic Algorithm,” Advances in Artificial Intelligence, Lecture Notes in Artificial Intelligence Vol. 1418, Springer Verlag, Germany, pp. 141-153, 1998.
13. Whitley D., “GENITOR: A Different Genetic Algorithm,” Proceedings of the Rocky Mountain Conference on Artificial Intelligence, Denver, Colorado, 1988.
14. Whitley D., T. Starkweather, and D’Ann Fuquay, “Scheduling Problems and Traveling Salesman: The Genetic Edge Recombination Operator,” Proceedings of the 3rd International Conference on Genetic Algorithms ICGA-89, pp. 133-140, 1989.
15. Whitley, D., T. Starkweather, and D. Shaner, “The Traveling Salesman and Sequence Scheduling: Quality Solutions Using Genetic Edge Recombination,” Handbook of Genetic Algorithms, L. Davis (editor), Chapter 22, Thomson Computer Press, 1990.