TY - GEN
T1 - A historical interdependency based differential grouping algorithm for large scale global optimization
AU - Chen, An
AU - Ren, Zhigang
AU - Yang, Yang
AU - Liang, Yongsheng
AU - Pang, Bei
N1 - Publisher Copyright:
© 2018 Association for Computing Machinery.
PY - 2018/7/6
Y1 - 2018/7/6
N2 - Cooperative co-evolution (CC) is a powerful evolutionary computation framework for solving large scale global optimization (LSGO) problems via the strategy of “divide-and-conquer”, but its efficiency highly relies on the decomposition result. Existing decomposition algorithms either cannot obtain correct decomposition results or require a large number of fitness evaluations (FEs). To alleviate these limitations, this paper proposes a new decomposition algorithm named historical interdependency based differential grouping (HIDG). HIDG detects interdependency from the perspective of vectors. By utilizing historical interdependency information, it develops a novel criterion which can directly deduce the interdependencies among some vectors without consuming extra FEs. Coupled with an existing vector-based decomposition framework, HIDG further significantly reduces the total number of FEs for decomposition. Experiments on two sets of LSGO benchmark functions verified the effectiveness and efficiency of HIDG.
AB - Cooperative co-evolution (CC) is a powerful evolutionary computation framework for solving large scale global optimization (LSGO) problems via the strategy of “divide-and-conquer”, but its efficiency highly relies on the decomposition result. Existing decomposition algorithms either cannot obtain correct decomposition results or require a large number of fitness evaluations (FEs). To alleviate these limitations, this paper proposes a new decomposition algorithm named historical interdependency based differential grouping (HIDG). HIDG detects interdependency from the perspective of vectors. By utilizing historical interdependency information, it develops a novel criterion which can directly deduce the interdependencies among some vectors without consuming extra FEs. Coupled with an existing vector-based decomposition framework, HIDG further significantly reduces the total number of FEs for decomposition. Experiments on two sets of LSGO benchmark functions verified the effectiveness and efficiency of HIDG.
KW - Cooperative coevolution
KW - Decomposition algorithm
KW - Historical interdependency
KW - Large scale global optimization
UR - https://www.scopus.com/pages/publications/85051484622
U2 - 10.1145/3205651.3208278
DO - 10.1145/3205651.3208278
M3 - 会议稿件
AN - SCOPUS:85051484622
T3 - GECCO 2018 Companion - Proceedings of the 2018 Genetic and Evolutionary Computation Conference Companion
SP - 1711
EP - 1715
BT - GECCO 2018 Companion - Proceedings of the 2018 Genetic and Evolutionary Computation Conference Companion
PB - Association for Computing Machinery, Inc
T2 - 2018 Genetic and Evolutionary Computation Conference, GECCO 2018
Y2 - 15 July 2018 through 19 July 2018
ER -