MODELLING THE DYNAMICS OF AN ADJUSTMENT OF A SEARCH SPACE SIZE IN A GENETIC ALGORITHM

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), 2008, vol. 19, issue 07, 1047-1062

Abstract: One way to improve a search strategy in a Genetic Algorithm (GA) is to reduce the search space towards the feasible region where the global optimum is located. The paper describes the effect of an adjustment of a search space size of GA on the macroscopic statistical properties of population such as the average fitness and the variance fitness of population. The set of equations of motion was derived for the one-max problem that expressed the macroscopic statistical properties of population after an adjustment of a search space size in terms of those prior to the operation.

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

Downloads: (external link)
http://www.worldscientific.com/doi/abs/10.1142/S0129183108012716
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:19:y:2008:i:07:n:s0129183108012716

Ordering information: This journal article can be ordered from

DOI: 10.1142/S0129183108012716

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 ().