Please use this identifier to cite or link to this item:
http://bura.brunel.ac.uk/handle/2438/5888
Title: | Primal-dual genetic algorithms for royal road functions |
Authors: | Yang, S |
Keywords: | Genetic algorithm;Crossover;Dominant;Search;Parallelism;Optimization |
Issue Date: | 2002 |
Publisher: | IFAC |
Citation: | 15th IFAC World Congress, Barcelona, Spain, I: Fuzzy, Neural and Genetic Systems: 373 - 378, 2002-07-21 - 2002-07-26 |
Abstract: | Based on Holland's simple genetic algorithm (SGA) three have been many variations developed. Inspired by the phenomenon of diploid genotype and deminance mechanisms broadly existing in nature, we have proposed a primal-dual genetic algorithm (PDGA), see (Yang 2002). Our preliminary experiments based on the Royal Road functions have shown that PDGA outperforms SGA for different performance measures. In this paper, we present some further experiment results, especially onthe dynamic performance of PDGA over SGA, and give out our explanations and analyses about ehy PDGA outperforms SGA based on these results. Through the primal-dual mapping between a pair of chromosomes, PDGA's performance of exploration in the search space, especially during the early generations, is improved and thus its total searching efficiency is improved. |
Description: | Copyright @ 2002 IFAC |
URI: | http://bura.brunel.ac.uk/handle/2438/5888 |
Appears in Collections: | Publications Computer Science Dept of Computer Science Research Papers |
Files in This Item:
File | Description | Size | Format | |
---|---|---|---|---|
Fulltext.pdf | 280.12 kB | Adobe PDF | View/Open |
Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.