A decomposition framework based on memorized binary search for large-scale optimization problems

DOI10.1016/J.INS.2024.121063MaRDI QIDQ6576948zbMATH OpenFDO

Authors Qingwei Liang, Jeng-Shyang Pan, Shu-Chuan Chu, Lingping Kong, Wei Li

Publication date 23 July 2024

Published in Information Sciences (Search for Journal in Brave)

zbMATH Keywords

divide-and-conquercooperative co-evolutionlarge-scale optimization problemdifferential grouping

Mathematics Subject Classification ID

Large-scale problems in mathematical programming (90C06)

Recommendations

• Large scale evolutionary optimization using cooperative coevolution
• Incremental cooperative coevolution for large-scale global optimization
• scientific article; zbMATH DE number 5846648
• Enhancing the scalability of metaheuristics by cooperative coevolution
• A differential evolution algorithm with cooperative coevolutionary selection operation for high-dimensional optimization

Cites work

• Large scale evolutionary optimization using cooperative coevolution
• VMODE: a hybrid metaheuristic for the solution of large scale optimization problems

This page was built for publication: A decomposition framework based on memorized binary search for large-scale optimization problems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6576948)