A Study of Genetic Algorithms solving a combinatorial Puzzle
Please always quote using this URN: urn:nbn:de:0297-zib-3445
- The suitability of Genetic Algorithms (GAs) to solve a combinatorial problem with only one solution is investigated. The dependence of the performance is studied for GA-hard and GA-soft fitness functions, both with a range of different parameter values and different encodings.
Author: | Thomas Wolf |
---|---|
Document Type: | ZIB-Report |
MSC-Classification: | 05-XX COMBINATORICS (For finite fields, see 11Txx) |
68-XX COMPUTER SCIENCE (For papers involving machine computations and programs in a specific mathematical area, see Section -04 in that area) | |
90-XX OPERATIONS RESEARCH, MATHEMATICAL PROGRAMMING | |
Date of first Publication: | 1998/01/19 |
Series (Serial Number): | ZIB-Report (SC-98-01) |
ZIB-Reportnumber: | SC-98-01 |