Sexual selection for genetic algorithms

Artificial Intelligence Review

Volumn 19, Issue 2, 2003, Pages 123-152

  Goh, Kai Song ^a   Lim, Andrew ^a   Rodrigues, Brian ^b  

^a NATIONAL UNIVERSITY OF SINGAPORE   (Singapore)

^b SINGAPORE MANAGEMENT UNIVERSITY   (Singapore)

Author keywords

Genetic algorithm; Scheduling; Selection

Indexed keywords

HEURISTIC METHODS; OPERATIONS RESEARCH; OPTIMIZATION; PROBLEM SOLVING; SCHEDULING;

JOB SHOP SCHEDULING PROBLEM; OPEN SHOP SCHEDULING PROBLEM; RECOMBINATION STAGES; ROYAL ROAD PROBLEM; SEXUAL SELECTION PRINCIPLES;

GENETIC ALGORITHMS;

EID: 0037384812     PISSN: 02692821     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1022692631328     Document Type: Article

References (25)

1. Aşveren, T. & Molitor, P. (1996). New Crossover Methods for Sequencing Problems. In: Voigt, H.-M., Ebeling, W., Rechenberg, I. & Schwefel, H.-P. (eds.) Parallel Problem Solving from Nature - PPSN IV, 290-299. Berlin, Springer.
2. Back, T. (1994). Selective Pressure in Evolutionary Algorithms: A Characterization of Selection Mechanisms. 1st IEEE Conference on Evolutionary Computing 1:57-62.
3. Back, T. & Hoffmeister, F. (1991). Extended Selection Mechanisms in Genetic Algorithm. In: Belew, R. K. & Brooker, L. B. (eds.) 4th International Conference on Genetic Algorithm, 92-99. San Mateo, CA.
4. Blickle, T. & Thiele, L. (1995). A Comparison of Selection Schemes used in Genetic Algorithms. TIK-Report No. 11 Computer Engineering and Communication Networks Lab, ETH, Zurich, Switzerland.
5. Darwin, C. (1888). The Origin of Species by Means of Natural Selection, or The Preservation of Favoured Races in the Struggle for Life. London: Murray, sixth edition.
6. Falkenauer, E. & Bouffouix, S. (1991). A Genetic Algorithm for Job Shop. Proceedings 1991 IEEE International Conference on Robotics and Automation 1, 824-829. Sacramento, CA, IEEE Computer Society Press, Los Alamitos, CA.
7. Fang, H.-L., Ross, P. & Corne, D. (1993). A Promising Genetic Algorithm Approach to Job-Shop Scheduling, Rescheduling and Open-Shop Scheduling Problems. Proceedings of the Fifth International Conference on Gentic Algorithms, 375-382.
8. Fang, H.-L., Ross, P. & Corne, D. (1994). A Promising Hybrid GA/Heuristic Approach for Open-Shop Scheduling Problems. In: Cohn, A. (ed.) 11th European Conf. on Artificial Intelligence, 590-594. Chichester, John Wiley and Sons, Ltd.
9. Fox, B. R. and McMahon, M. B. (1991). Genetic Operators for Sequencing Problems. Foundation of Genetic Algorithms, 284-300.
10. Goldberg, D. E. (1989). Genetic Algorithms in Search, Optimization & Machine Learning. Addison-Wesley Publishing Company.
11. Hartmann, S. (1998). A competitive genetic algorithm for resource-constrained project scheduling. Naval Research Logistics 45.
12. Holland, J. H. (1975). Adaption in Natural and Artificial Systems. University of Michigan.
13. Khuri, S. & Miryala, S. R. (1999). Genetic Algorithms for Solving Open Shop Scheduling Problems. Portuguese Conference on Artificial Intelligence, 357-368.
14. Kolarov, K. (1995). The Role of Selection in Evolutionary Algorithm. 1995 IEEE International Conference on Evolutionary Computing, 86-91. Perth.
15. Lis, J. & Eiben, A. E. (1996). A Multi-Sexual Genetic Algorithm for Multiobjective Optimization. In: Fukuda, T. & Furuhashi, T. (eds.). Proceedings of the 1996 International Conference on Evolutionary Computation, 59-64. Nagoya, Japan, IEEE.
16. Louis, S. J. & Xu, Z. (1996). Genetic algorithms for Open Shop Scheduling and Re-Scheduling. In: Cohen, M. E. & Hudson, D. L. (eds.) ISCA 11th Int Conf on Computers and their Applications, 99-102.
17. Matsui, K. (1999). New Selection Method to Improve the Population Diversity in Genetic Algorithm. 1999 IEEE International Conference on Systems, Man and Cybernetics 1: 625-630.
18. Mitchell, M., Forrest, S. & Holland, J. H. (1992). The Royal Road for Genetic Algorithms: Fitness landscapes and GA Performance. Toward a Practice of Autonomous Systems: Proceedings of the First European Conference on Artificial Life, 245-254. Cambridge, MA, MIT Press.
19. Mitchell, M., Holland, J. H. & Forrest, S. (1994). When will a Genetic Algorithm Outperform Hill Climbing. In: Cowan, J. D., Tesauro, G. & Alspector, J. (eds.) Advances in Neural Information Processing Systems 6, 51-58. Morgan Kaufmann Publishers, Inc.
20. Muhlenbein, H. & Schlierkamp-Voosen, D. (1993). Analysis of Selection, Mutation and Recombination in Genetic Algorithms. Neural Network World 3: 907-933.
21. Ratford, M., Tuson, A. & Thompson, H. (1997a). Applying Sexual Selection as a Mechanism for Obtaining Multiple Distinct Solutions. Presented at Emerging Technologies '97.
22. Ratford, M., Tuson, A. & Thompson, H. (1997b). The Single Chromosome's Guide To Dating. In: Third International Conference On Artificial Neural Networks And Genetic Algorithms.
23. Ronald, E. (1995). When Selection meets Seduction. The Sixth International Conference on Genetic Algorithms, 167-173. Pittsburg, USA, Morgan Kaufmann.
24. Vaessens, R., Aarts, E. & Lenstra, J. (1994). Job-Shop Scheduling by Local Search. COSOR Memorandum 94-05, Eindhoven University of Technology, Eindhoven, The Netherlands.
25. van Nimwegen, E., Crutchfield, J. P. & Mitchell, M. (1999). Statistical Dynamics of the Royal Road Genetic Algorithm. Theoretical Computer Science 229(1): 41-102.