THE PERFORMANCE OF GENETIC ALGORITHM WITH ADJUSTMENT OF A SEARCH SPACE

Adil Amirjanov ()
Additional contact information
Adil Amirjanov: Department of Computer Science, Near East University, Nicosia, Northern Cyprus, via Mersin-10, Turkey

International Journal of Modern Physics C (IJMPC), 2009, vol. 20, issue 04, 565-583

Abstract: This paper investigates the effect of a linear adjustment of a search space size in genetic algorithm (GA) on the macroscopic statistical properties of population (such as the average fitness and the variance fitness of population). The equations of motion were derived for one-max problem that expressed the macroscopic statistical properties of population after the adjustment of a search space size. Analysis of a performance of GA that includes a computational cost and a quality of the optimal solution was made for linear and power laws of search space adjustment.

Keywords: Genetic algorithms; dynamic optimization; statistical mechanics techniques; 11.25.Hf; 123.1K (search for similar items in EconPapers)
Date: 2009
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0129183109013807
Access to full text is restricted to subscribers

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:wsi:ijmpcx:v:20:y:2009:i:04:n:s0129183109013807

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0129183109013807

Access Statistics for this article

International Journal of Modern Physics C (IJMPC) is currently edited by H. J. Herrmann

More articles in International Journal of Modern Physics C (IJMPC) from World Scientific Publishing Co. Pte. Ltd.
Bibliographic data for series maintained by Tai Tone Lim ().