You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact webmaster@ide.mdh.se

On measures of search features

Authors:

Roger Jonsson

Research group:

Artificial Intelligence and Intelligent Systems

Publication Type:

Conference/Workshop Paper

Venue:

Lecture notes in Artificial intelligence 1609

Publisher:

Zbigniew W. Ra´s, Andrzej Skowon

Abstract

This paper describes several measures that can be useful when analyzing features of search in genetic algorithms. Results obtained by different researchers are often hard to compare and it is often difficult to draw general conclusions from them. This means that non-experienced users of genetic algorithms have little help in constructing their own effective solutions for a particular problem. The article contains a suggestion about possible ways of investigating features of search in genetic algorithms. These features are defined together with descriptions how to measure them.

Bibtex

@inproceedings{Jonsson102,
author = {Roger Jonsson},
title = {On measures of search features},
month = {June},
year = {1999},
booktitle = {Lecture notes in Artificial intelligence 1609},
publisher = {Zbigniew W. Ra´s, Andrzej Skowon},
url = {http://www.es.mdu.se/publications/102-}
}