Multistage non homogeneous Markov chain modeling of the non homogeneous genetic algorithm and convergence results
André G. C. Pereira and
Viviane S. M. Campos
Communications in Statistics - Theory and Methods, 2016, vol. 45, issue 6, 1794-1804
Abstract:
Genetic algorithms (GAs), in the homogeneous as well as the non homogeneous version, have been widely used to solve combinatorial global optimization problems. Despite the successes that the non homogeneous GA (NHGA) encounters in practical applications, the theoretical results which guarantee the convergence of such algorithms are cited just in a few papers. There are, at least, three different ways of modeling GA as a Markov chain in order to study its convergence. In each approach, the transition matrices depend not only on the state space of the Markov chain but also on the way the genetic operators are defined. In this article, the extension to the non homogeneous case of the crossover operator which was based on neighborhoods is proposed, convergence results are presented, and numerical simulations in order to illustrate a comparative performance of the algorithms are developed.
Date: 2016
References: Add references at CitEc
Citations:
Downloads: (external link)
http://hdl.handle.net/10.1080/03610926.2014.997358 (text/html)
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:taf:lstaxx:v:45:y:2016:i:6:p:1794-1804
Ordering information: This journal article can be ordered from
http://www.tandfonline.com/pricing/journal/lsta20
DOI: 10.1080/03610926.2014.997358
Access Statistics for this article
Communications in Statistics - Theory and Methods is currently edited by Debbie Iscoe
More articles in Communications in Statistics - Theory and Methods from Taylor & Francis Journals
Bibliographic data for series maintained by Chris Longhurst ().