On the fitness of high order schema of a linear-weighted coded genetic algorithm

Hongqiang Mo, Zhong Li, Jin Bae Park, Young Hoon Joo, Xiangyang Li

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

According to Schema Theorem, the larger the fitness value of a schema is, the higher the chance of the sub-space corresponding to the schema being chosen for searching is. Therefore, the coding of a genetic algorithm should be designed to produces short building blocks at as more fixed positions of the strings as possible. In this paper, an upper and lower bounds of the fitness values of order-n building blocks are given in terms of the maximal fitness values of order-1 building blocks. It is shown that, if a linear-weighted coding supplies order-1 building blocks at most of the loci of the strings, then there is sure to be remarkable fitness differences among high order schemata. In such case, the trajectory of the fitness function contains peaks, and diversity loss is likely to occur in the local search within these peaks.

Original languageEnglish
Title of host publicationWorld Scientific Proceedings Series on Computer Engineering and Information Science 1; Computational Intelligence in Decision and Control - Proceedings of the 8th International FLINS Conference
PublisherWorld Scientific Publishing Co. Pte Ltd
Pages713-718
Number of pages6
ISBN (Print)981279946X, 9789812799463
Publication statusPublished - 2008 Jan 1
EventComputational Intelligence in Decision and Control - 8th International FLINS Conference - Madrid, Spain
Duration: 2008 Sep 212008 Sep 24

Publication series

NameWorld Scientific Proceedings Series on Computer Engineering and Information Science 1; Computational Intelligence in Decision and Control - Proceedings of the 8th International FLINS Conference

Other

OtherComputational Intelligence in Decision and Control - 8th International FLINS Conference
CountrySpain
CityMadrid
Period08/9/2108/9/24

Fingerprint

Genetic algorithms
Trajectories
Genetic algorithm
Fitness

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence
  • Information Systems and Management
  • Control and Systems Engineering

Cite this

Mo, H., Li, Z., Park, J. B., Joo, Y. H., & Li, X. (2008). On the fitness of high order schema of a linear-weighted coded genetic algorithm. In World Scientific Proceedings Series on Computer Engineering and Information Science 1; Computational Intelligence in Decision and Control - Proceedings of the 8th International FLINS Conference (pp. 713-718). (World Scientific Proceedings Series on Computer Engineering and Information Science 1; Computational Intelligence in Decision and Control - Proceedings of the 8th International FLINS Conference). World Scientific Publishing Co. Pte Ltd.
Mo, Hongqiang ; Li, Zhong ; Park, Jin Bae ; Joo, Young Hoon ; Li, Xiangyang. / On the fitness of high order schema of a linear-weighted coded genetic algorithm. World Scientific Proceedings Series on Computer Engineering and Information Science 1; Computational Intelligence in Decision and Control - Proceedings of the 8th International FLINS Conference. World Scientific Publishing Co. Pte Ltd, 2008. pp. 713-718 (World Scientific Proceedings Series on Computer Engineering and Information Science 1; Computational Intelligence in Decision and Control - Proceedings of the 8th International FLINS Conference).
@inproceedings{6fc08b403e374ba1b48f9e8675188b77,
title = "On the fitness of high order schema of a linear-weighted coded genetic algorithm",
abstract = "According to Schema Theorem, the larger the fitness value of a schema is, the higher the chance of the sub-space corresponding to the schema being chosen for searching is. Therefore, the coding of a genetic algorithm should be designed to produces short building blocks at as more fixed positions of the strings as possible. In this paper, an upper and lower bounds of the fitness values of order-n building blocks are given in terms of the maximal fitness values of order-1 building blocks. It is shown that, if a linear-weighted coding supplies order-1 building blocks at most of the loci of the strings, then there is sure to be remarkable fitness differences among high order schemata. In such case, the trajectory of the fitness function contains peaks, and diversity loss is likely to occur in the local search within these peaks.",
author = "Hongqiang Mo and Zhong Li and Park, {Jin Bae} and Joo, {Young Hoon} and Xiangyang Li",
year = "2008",
month = "1",
day = "1",
language = "English",
isbn = "981279946X",
series = "World Scientific Proceedings Series on Computer Engineering and Information Science 1; Computational Intelligence in Decision and Control - Proceedings of the 8th International FLINS Conference",
publisher = "World Scientific Publishing Co. Pte Ltd",
pages = "713--718",
booktitle = "World Scientific Proceedings Series on Computer Engineering and Information Science 1; Computational Intelligence in Decision and Control - Proceedings of the 8th International FLINS Conference",
address = "Singapore",

}

Mo, H, Li, Z, Park, JB, Joo, YH & Li, X 2008, On the fitness of high order schema of a linear-weighted coded genetic algorithm. in World Scientific Proceedings Series on Computer Engineering and Information Science 1; Computational Intelligence in Decision and Control - Proceedings of the 8th International FLINS Conference. World Scientific Proceedings Series on Computer Engineering and Information Science 1; Computational Intelligence in Decision and Control - Proceedings of the 8th International FLINS Conference, World Scientific Publishing Co. Pte Ltd, pp. 713-718, Computational Intelligence in Decision and Control - 8th International FLINS Conference, Madrid, Spain, 08/9/21.

On the fitness of high order schema of a linear-weighted coded genetic algorithm. / Mo, Hongqiang; Li, Zhong; Park, Jin Bae; Joo, Young Hoon; Li, Xiangyang.

World Scientific Proceedings Series on Computer Engineering and Information Science 1; Computational Intelligence in Decision and Control - Proceedings of the 8th International FLINS Conference. World Scientific Publishing Co. Pte Ltd, 2008. p. 713-718 (World Scientific Proceedings Series on Computer Engineering and Information Science 1; Computational Intelligence in Decision and Control - Proceedings of the 8th International FLINS Conference).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

TY - GEN

T1 - On the fitness of high order schema of a linear-weighted coded genetic algorithm

AU - Mo, Hongqiang

AU - Li, Zhong

AU - Park, Jin Bae

AU - Joo, Young Hoon

AU - Li, Xiangyang

PY - 2008/1/1

Y1 - 2008/1/1

N2 - According to Schema Theorem, the larger the fitness value of a schema is, the higher the chance of the sub-space corresponding to the schema being chosen for searching is. Therefore, the coding of a genetic algorithm should be designed to produces short building blocks at as more fixed positions of the strings as possible. In this paper, an upper and lower bounds of the fitness values of order-n building blocks are given in terms of the maximal fitness values of order-1 building blocks. It is shown that, if a linear-weighted coding supplies order-1 building blocks at most of the loci of the strings, then there is sure to be remarkable fitness differences among high order schemata. In such case, the trajectory of the fitness function contains peaks, and diversity loss is likely to occur in the local search within these peaks.

AB - According to Schema Theorem, the larger the fitness value of a schema is, the higher the chance of the sub-space corresponding to the schema being chosen for searching is. Therefore, the coding of a genetic algorithm should be designed to produces short building blocks at as more fixed positions of the strings as possible. In this paper, an upper and lower bounds of the fitness values of order-n building blocks are given in terms of the maximal fitness values of order-1 building blocks. It is shown that, if a linear-weighted coding supplies order-1 building blocks at most of the loci of the strings, then there is sure to be remarkable fitness differences among high order schemata. In such case, the trajectory of the fitness function contains peaks, and diversity loss is likely to occur in the local search within these peaks.

UR - http://www.scopus.com/inward/record.url?scp=58149195463&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=58149195463&partnerID=8YFLogxK

M3 - Conference contribution

SN - 981279946X

SN - 9789812799463

T3 - World Scientific Proceedings Series on Computer Engineering and Information Science 1; Computational Intelligence in Decision and Control - Proceedings of the 8th International FLINS Conference

SP - 713

EP - 718

BT - World Scientific Proceedings Series on Computer Engineering and Information Science 1; Computational Intelligence in Decision and Control - Proceedings of the 8th International FLINS Conference

PB - World Scientific Publishing Co. Pte Ltd

ER -

Mo H, Li Z, Park JB, Joo YH, Li X. On the fitness of high order schema of a linear-weighted coded genetic algorithm. In World Scientific Proceedings Series on Computer Engineering and Information Science 1; Computational Intelligence in Decision and Control - Proceedings of the 8th International FLINS Conference. World Scientific Publishing Co. Pte Ltd. 2008. p. 713-718. (World Scientific Proceedings Series on Computer Engineering and Information Science 1; Computational Intelligence in Decision and Control - Proceedings of the 8th International FLINS Conference).