On the influence of the representation granularity in heuristic forma recombination

Proceedings of the ACM Symposium on Applied Computing

Volumn 1, Issue , 2000, Pages 433-439

  Cotta, Carlos ^a   Troya, José Ma ^a  

^a UNIVERSITY OF MÁLAGA   (Spain)

Author keywords

Genetic algorithms; Heuristic recombination; Scalability

Indexed keywords

COMPUTATION THEORY; GENETIC ALGORITHMS; SCALABILITY;

COMPUTATIONAL COSTS; HEURISTIC RECOMBINATION; RECOMBINATION OPERATORS; TEST MODELING; WORK STUDY;

COST REDUCTION;

EID: 0013387854     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/335603.335886     Document Type: Conference Paper

References (14)

1. Cotta C., Aldana J.F., Nebro A.J., Troya J.M., "Hybridizing Genetic Algorithms with Branch and Bound Techniques for the Resolution of the TSP", Artificial Neural Nets and Genetic Algorithms 2 (pp. 277-280), Pearson D.W., Steele N.C., Albrecht R.F. (eds.), Springer-Verlag, Wien, 1995
2. Cotta C., Troya J.M., "Genetic Forma Recombination in Permutation Flowshop Problems", Evolutionary Computation 6(1):25-44, 1998 (Pubitemid 128692720)
3. Cotta C., Alba E., Troya J.M., "Utilizing Dynastically Optimal Forma Recombination in Hybrid Genetic Algorithms", Parallel Problem Solving From Nature - PPSN V (pp. 305-314), Eiben A.E., Bäck Th., Schoenauer M., Schwefel H.-P. (eds.), Lecture Notes in Computer Science 1498, Springer-Verlag Berlin, 1998
4. Davis L., Handbook of Genetic Algorithms, Van Nostrand Reinhold Computer Library, New York, 1991
5. Goldberg D.E., Genetic Algorithms in Search, Optimization and Machine Learning, Addison-Wesley, Reading MA, 1989
6. Hart W.E., Belew R.K., "Optimizing an arbitrary function is hard for the genetic algorithm", Proceedings of the Fourth International Conference on Genetic Algorithms (pp. 190-195), Belew R.K., Booker L.B. (eds.), Morgan Kaufmann, San Mateo CA, 1991
7. Herdy M., Patone G., "Evolution Strategy in Action: 10 ES-Demonstrations", Technical Report TR-94-05, Technische Universität Berlin, 1994
8. Moscato P., "On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts: Towards Memetic Algorithms", Caltech Concurrent Computation Program, C3P Report 826, 1989
9. Mühlenbein H., "Parallel genetic algorithm, population dynamics and combinatorial optimization", Proceedings of the Third International Conference on Genetic Algorithms (pp. 416-421), Schaffer J.D. (ed.), Morgan Kaufmann, San Mateo CA, 1989
10. Radcliffe N.J., "Equivalence Class Analysis of Genetic Algorithms", Complex Systems 5:183-205, 1991
11. Radcliffe N.J., "Forma Analysis and Random Respectful Recombination", Proceedings of the Fourth International Conference on Genetic Algorithms (pp. 222-229), Belew R.K., Booker L.B. (eds.), Morgan Kaufmann, San Mateo CA, 1991
12. Radcliffe N.J., "The Algebra of Genetic Algorithms", Annals of Mathematics and Artificial Intelligence 10:339-384, 1994
13. Storer R.H., Wu S.D., Vaccari R., "New search spaces for sequencing problems with application to job shop scheduling", Management Science 38:1495-1509, 1992 (Pubitemid 23633245)
14. Wolpert D.H., Macready W.G., "No Free Lunch Theorems for Search", Sante Fe Institute Technical Report SFI-TR-95-02-010, 1995