HKUST Library Institutional Repository Banner

HKUST Institutional Repository >
Physics >
PHYS Conference Papers >

Please use this identifier to cite or link to this item:
Title: Accelerated genetic algorithms with Markov Chains
Authors: Wang, Guan
Chen, Chen
Szeto, Kwok-Yip
Keywords: Genetic algorithms
Markov Chains
Optimization Knapsack
Issue Date: 2010
Citation: Nature Inspired Cooperative Strategies for Optimization (NICSO 2010), Studies in Computational Intelligence, v.284, 2010, p. 245-254
Abstract: Based on the mutation matrix formalism and past statistics of genetic algorithm, a Markov Chain transition probability matrix is introduced to provide a guided search for complex problem optimization. The important input for this guided search is the ranking scheme of the chromosomes. It is found that the effect of mutation using the transition matrix yields faster convergence as well as overall higher fitness in the search for optimal solutions for the 0-1 Knapsack problem, when compared with the mutation-only-genetic-algorithm, which include the traditional genetic algorithm as a special case. The accelerated genetic algorithm with Markov Chain provides a theoretical basis for further mathematical analysis of evolutionary computation, specifically in the context of adaptive parameter control.
Rights: The original publication is available at
Appears in Collections:PHYS Conference Papers

Files in This Item:

File Description SizeFormat
WangChenSzetoNICSO2010.pdfpre-published version109KbAdobe PDFView/Open

All items in this Repository are protected by copyright, with all rights reserved.