Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorYang, S-
dc.identifier.citation15th IFAC World Congress, Barcelona, Spain, I: Fuzzy, Neural and Genetic Systems: 373 - 378, 2002-07-21 - 2002-07-26en_US
dc.descriptionCopyright @ 2002 IFACen_US
dc.description.abstractBased 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.en_US
dc.subjectGenetic algorithmen_US
dc.titlePrimal-dual genetic algorithms for royal road functionsen_US
dc.typeConference Paperen_US
pubs.organisational-data/Brunel/Brunel (Active)-
pubs.organisational-data/Brunel/Brunel (Active)/School of Info. Systems, Comp & Maths-
pubs.organisational-data/Brunel/Research Centres (RG)-
pubs.organisational-data/Brunel/Research Centres (RG)/CIKM-
pubs.organisational-data/Brunel/School of Information Systems, Computing and Mathematics (RG)-
pubs.organisational-data/Brunel/School of Information Systems, Computing and Mathematics (RG)/CIKM-
Appears in Collections:Publications
Computer Science
Dept of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
Fulltext.pdf280.12 kBAdobe PDFView/Open

Items in BURA are protected by copyright, with all rights reserved, unless otherwise indicated.