A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2013; you can also visit the original URL.
The file type is application/pdf
.
Empirical Analysis of Locality, Heritability and Heuristic Bias in Evolutionary Algorithms: A Case Study for the Multidimensional Knapsack Problem
2005
Evolutionary Computation
Five different representations and associated variation operators are studied in the context of a steady-state evolutionary algorithm (EA) for the multidimensional knapsack problem. Four of them are indirect decoder-based techniques, and the fifth is a direct encoding including heuristic initialization, repair, and local improvement. The complex decoders and the local improvement and repair strategies make it practically impossible to completely analyze such EAs in a fully theoretical way.
doi:10.1162/106365605774666886
pmid:16297279
fatcat:e6bbkbg47ranzcpfilhu53vo3e