Simulation Experiment Exploration of Genetic Algorithm’s Convergence over the Relationship Advantage Problem

Yabo Luo

Mathematical Problems in Engineering, 2016, vol. 2016, 1-10

Abstract:

Concentrating on the convergence analysis of Genetic Algorithm (GA), this study originally distinguishes two types of advantage sources: value advantage and relationship advantage. Accordingly, the quantitative feature, complete quantization feature, and the partial quantization feature in the fitness evaluation are proposed. Seven simulation experiments show that these two types of advantages have different convergence properties. For value advantage problems, GA has a good convergence. However, for a relationship advantage problem, only from the practical point of view, it is possible to get a feasible and even satisfactory solution through large-scale searching, but, in theory, however, the searching process is not convergent. Therefore, GA is not reliable to solve relationship advantage problems, to which most engineering problems involving combinatorial optimization belong. This study systematically shows convergence properties of “relationship advantage” through simulation experiments, which will be a new area for the further study on GA.

Date: 2016
References: Add references at CitEc
Citations:

Downloads: (external link)
http://downloads.hindawi.com/journals/MPE/2016/4527402.pdf (application/pdf)
http://downloads.hindawi.com/journals/MPE/2016/4527402.xml (text/xml)

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:hin:jnlmpe:4527402

DOI: 10.1155/2016/4527402

Access Statistics for this article

More articles in Mathematical Problems in Engineering from Hindawi
Bibliographic data for series maintained by Mohamed Abdelhakeem ().