Population size, building blocks, fitness landscape and genetic algorithm search efficiency in combinatorial optimization: An empirical study
In this chapter we analyse empirically genetic algorithm search efficiency on several combinatorial optimisation problems in relation to building blocks and fitness landscape. The test set includes five problems of different types and difficulty levels all with an equal chromosome length of 34 bits. Four problems were quite easy for genetic algorithm search while one, a folding problem, turned out to be a very
Related BooksYou May Also Like
View All
By: Muhammad Omar Sohail Bhutta
By: CATHARINE FISHEL
By: Mohammad Dadashzadeh
By: HOLLY ROSS, KATRIN VERCLAS, ALISON LEVINE
By: Daniel J. Duffy
0 Comments