TY - GEN
T1 - How hard should we run?
T2 - 13th Annual Genetic and Evolutionary Computation Conference, GECCO'11
AU - Lee, Yun Geun
AU - McKay, Bob
PY - 2011
Y1 - 2011
N2 - All evolutionary algorithms trade off exploration and exploitation in optimisation problems; dynamic problems are no exception. We investigate this trade-off, over a range of algorithm settings, on dynamic variants of three well-known optimisation problems (One Max, Royal Road and knapsack), using Yang's XOR method to vary the scale and rate of change. Extremely exploitative algorithm settings performed best for a surprisingly wide range of problems; even where they were not the most effective, they still performed competitively, and even in those cases, the best performers were still far more exploitative than most would anticipate.
AB - All evolutionary algorithms trade off exploration and exploitation in optimisation problems; dynamic problems are no exception. We investigate this trade-off, over a range of algorithm settings, on dynamic variants of three well-known optimisation problems (One Max, Royal Road and knapsack), using Yang's XOR method to vary the scale and rate of change. Extremely exploitative algorithm settings performed best for a surprisingly wide range of problems; even where they were not the most effective, they still performed competitively, and even in those cases, the best performers were still far more exploitative than most would anticipate.
KW - Dynamic optimisation problem
KW - Evolutionary dynamic optimisation
UR - http://www.scopus.com/inward/record.url?scp=84860406962&partnerID=8YFLogxK
U2 - 10.1145/2001576.2001736
DO - 10.1145/2001576.2001736
M3 - Conference contribution
SN - 9781450305570
T3 - Genetic and Evolutionary Computation Conference, GECCO'11
SP - 1187
EP - 1194
BT - Genetic and Evolutionary Computation Conference, GECCO'11
Y2 - 12 July 2011 through 16 July 2011
ER -