TY - GEN
T1 - Triple and quadruple comparison-based interactive differential evolution and differential evolution
AU - Pei, Yan
AU - Takagi, Hideyuki
PY - 2013/4/15
Y1 - 2013/4/15
N2 - We propose a triple comparison and a quadruple comparison based mechanism for enhancing differential evolution (DE), especially for interactive DE (IDE) where the method can be used to reduce IDE user fatigue. Besides the target vector and trial vector from normal DE, opposition vectors generated by opposition-based learning are used to determine offspring, and the best vector from among these three or four vectors becomes offspring for the next generation. We evaluate the proposed methods by comparing them with conventional IDE and conventional opposition-based IDE using a simulated IDE modeled using a four dimensional Gaussian mixture model. We also evaluate them in DE using 24 benchmark functions. The experiments show that our proposed methods can enhance IDE and DE search efficiently according to several evaluation indices. These include the converged fitness values after the same number of generations, converged fitness values after the same number of fitness calculations, fitness calculation cost, convergence success rates and acceleration rates.
AB - We propose a triple comparison and a quadruple comparison based mechanism for enhancing differential evolution (DE), especially for interactive DE (IDE) where the method can be used to reduce IDE user fatigue. Besides the target vector and trial vector from normal DE, opposition vectors generated by opposition-based learning are used to determine offspring, and the best vector from among these three or four vectors becomes offspring for the next generation. We evaluate the proposed methods by comparing them with conventional IDE and conventional opposition-based IDE using a simulated IDE modeled using a four dimensional Gaussian mixture model. We also evaluate them in DE using 24 benchmark functions. The experiments show that our proposed methods can enhance IDE and DE search efficiently according to several evaluation indices. These include the converged fitness values after the same number of generations, converged fitness values after the same number of fitness calculations, fitness calculation cost, convergence success rates and acceleration rates.
UR - http://www.scopus.com/inward/record.url?scp=84876008275&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84876008275&partnerID=8YFLogxK
U2 - 10.1145/2460239.2460255
DO - 10.1145/2460239.2460255
M3 - Conference contribution
AN - SCOPUS:84876008275
SN - 9781450319904
T3 - FOGA 2013 - Proceedings of the 12th ACM Workshop on Foundations of Genetic Algorithms
SP - 173
EP - 182
BT - FOGA 2013 - Proceedings of the 12th ACM Workshop on Foundations of Genetic Algorithms
T2 - 12th ACM Workshop on Foundations of Genetic Algorithms, FOGA 2013
Y2 - 16 January 2013 through 20 January 2013
ER -