Please use this identifier to cite or link to this item:
Full metadata record
DC FieldValueLanguage
dc.contributor.authorYang, S-
dc.identifier.citationTechnical Report (2001/45)en_US
dc.descriptionCopyright @ 2001 University of Leicesteren_US
dc.description.abstractGenetic algorithms (GAs) have been broadly studied by a huge amount of researchers and there are many variations developed based on Holland’s simple genetic algorithm (SGA). Inspired by the idea of diploid genotype and dominance mechanisms that broadly exists in nature, we propose a primal-dual genetic algorithm (PDGA). PDGA operates on a pair of chromosomes that are primal-dual to each other in the sense of Hamming distance in genotype. We compare the performance of PDGA over SGA based on the Royal Road functions, which are specially designed for testing GA's performance. The experiment results show that PDGA outperforms SGA on the Royal Road functions for different performance measures.en_US
dc.description.sponsorshipThis work was supported by the University of Leicester Research Fund 2001 under Grant FP15004, UK.en_US
dc.publisherUniversity of Leicesteren_US
dc.subjectGenetic algorithmen_US
dc.subjectPrimal-dual chromosomesen_US
dc.subjectRoyal road functionsen_US
dc.titleA new genetic algorithm based on primal-dual chromosomes for royal road functionsen_US
dc.typeTechnical Reporten_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.pdf185.16 kBAdobe PDFView/Open

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