Opposition-based chaotic evolution for optimization.

Area of Science:

• Computational intelligence
• Optimization algorithms
• Evolutionary computation

Background:

• Evolutionary computation algorithms face challenges like high computational costs and premature convergence.
• Existing methods struggle to balance exploration and exploitation effectively.

Purpose of the Study:

• To propose an opposition-based chaotic evolution (OBCE) algorithm.
• To enhance population diversity and global search ability in evolutionary computation.
• To address premature convergence and improve optimization performance.

Main Methods:

• Integration of opposition-based learning (OBL) into the chaotic evolution framework.
• Evaluation on single-objective and multi-objective numerical optimization problems.
• Application to a real-world hybrid rocket engine design task.

Main Results:

• OBCE demonstrated faster convergence and superior solution quality compared to baseline algorithms.
• The algorithm effectively increased population diversity and global search capability.
• In multi-objective optimization, OBCE improved Pareto solution diversity.
• Competitive design parameters were found for the rocket engine problem.

Conclusions:

• Opposition-based learning significantly enhances chaotic evolution algorithms.
• OBCE effectively mitigates premature convergence and improves optimization efficiency.
• The proposed algorithm shows broad applicability in real-world engineering design.