ACM Home Page
Please provide us with feedback. Feedback
Limitations of the fitness-proportional negative slope coefficient as a difficulty measure
Full text PdfPdf (575 KB)
Source
Genetic And Evolutionary Computation Conference archive
Proceedings of the 11th Annual conference on Genetic and evolutionary computation table of contents
Montreal, Québec, Canada
POSTER SESSION: Track 9: genetic algorithms table of contents
Pages 1877-1878  
Year of Publication: 2009
ISBN:978-1-60558-325-9
Authors
Leonardo Vanneschi  University of Milano-Bicocca, Milan, Italy
Andrea Valsecchi  University of Milano-Bicocca, Milan, Italy
Riccardo Poli  University of Essex , Wivenhoe Park, Colchester, CO4, United Kingdom
Sponsors
SIGEVO: ACM Special Interest Group on Genetic and Evolutionary Computation
ACM: Association for Computing Machinery
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 4,   Downloads (12 Months): 16,   Citation Count: 0
Additional Information:

abstract   references   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1569901.1570212
What is a DOI?

ABSTRACT

Fitness-Proportional Negative Slope Coefficient is a fitness landscapes measure that has recently been introduced as a potential indicator of problem hardness for optimisation. It is inspired to an older measure, the Negative Slope Coefficient, and it has been theoretically modelled. Preliminary experiments have suggested that it may be a good predictor of problem hardness. However, this measure has not undergone any convincing and comprehensive empirical testing. Our objective is to fill this gap. So, we perform empirical tests using a large set of invertible functions of unitation. We find that while this measure may correctly predict the degree of evolvability of a landscape, this does not necessarily correlate with the difficulty of problems. Some landscapes may show, for example, limited evolvability and yet be easy to solve because either solutions are already present in the initial population or the computational resources provided exceed evolvability obstacles. Or it may be impossible to solve them irrespective of their evolvability simply because they are far too vast for the computational resources provided. These situations are hardly captured by the Fitness-Proportional Negative Slope Coefficient.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
 
3
L. Vanneschi. Theory and Practice for Efficient Genetic Programming. Ph.D. thesis, Faculty of Science, University of Lausanne, Switzerland, 2004. Downlodable version at: http://personal.disco.unimib.it/Vanneschi.
 
4
S. Verel. Étude et Exploitation des Réseaux de Neutralité dans les Paysages Adaptatifs pour l'Optimisation Difficile. PhD thesis, University of Nice -- Sophia Antipolis, France, 2005. In French Language.

Collaborative Colleagues:
Leonardo Vanneschi: colleagues
Andrea Valsecchi: colleagues
Riccardo Poli: colleagues