• English
    • norsk
  • English 
    • English
    • norsk
  • Login
View Item 
  •   All institutions
  • Norges teknisk-naturvitenskapelige universitet
  • Fakultet for informasjonsteknologi og elektroteknikk (IE)
  • Institutt for datateknologi og informatikk
  • View Item
  •   All institutions
  • Norges teknisk-naturvitenskapelige universitet
  • Fakultet for informasjonsteknologi og elektroteknikk (IE)
  • Institutt for datateknologi og informatikk
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Diversity Guided Adaptive Evolutionary Algorithm

Thafvelin, Nicolay N; Asplin, Julius Buset
Master thesis
Thumbnail
View/Open
13937_FULLTEXT.pdf (3.249Mb)
13937_COVER.pdf (270.1Kb)
Permanent link
http://hdl.handle.net/11250/2353451
Issue date
2015
Share
Metadata
Show full item record
Collections
  • Institutt for datateknologi og informatikk [2226]
Abstract
Parameter tuning in Evolutionary Algorithms (EA) generally result in suboptimal choices of values because of the complex dependencies between the parameters. Furthermore, different scenarios during a run of the EA often have different optimal parameter values.

This thesis aims to better the understanding of how information about previously successful applications of genetic operators can be used to improve the quality of the search by using derandomised self-adaptive parameter control; We utilise the genetic differences between an offspring its parent to adapt a mutation vector. It also explores two different selection strategies that maintains diversity in the population, and the general effect that diversity has on the exploration and exploitation of the solution space.

The adaptive mutation scheme proposed in this thesis has shown to improve the speed of the EA significantly while still being able to solve a wide range of mathematical functions as well as practical problems.

Supplemented with a simple scheme that maintains diversity it becomes a more robust implementation well suited for multiple types of problems; especially for problems with computationally expensive fitness tests.
Publisher
NTNU

Contact Us

Search NORA
Powered by DSpace software

Service from BIBSYS
 

 

Browse this CollectionIssue DateAuthorsTitlesSubjectsDocument TypesJournalsBrowse all ArchivesArchives & CollectionsIssue DateAuthorsTitlesSubjectsDocument TypesJournals

My Account

Login

Statistics

Google Analytics StatisticsView Usage Statistics

Contact Us

Search NORA
Powered by DSpace software

Service from BIBSYS