An opposition-based butterfly optimization algorithm with adaptive elite mutation in solving complex high-dimensional optimization problems

DOI10.1016/j.matcom.2022.08.020OpenAlexW4294945996WikidataQ114149799 ScholiaQ114149799MaRDI QIDQ2095669

Jingsen Liu, Yu Li, Xiaomei Yu

Publication date: 17 November 2022

Published in: Mathematics and Computers in Simulation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.matcom.2022.08.020

zbMATH Keywords

engineering problemsbutterfly optimization algorithmCEC2014complex high-dimensional problemselite mutation strategyopposition-based learning mechanism

Mathematics Subject Classification ID

Numerical analysis (65-XX) Operations research, mathematical programming (90-XX)

Related Items (1)

Convergence analysis of flow direction algorithm in continuous search space and its improvement

Uses Software

• CMA-ES
• ABC
• CEC 13
• WOA
• GWO

Cites Work

• A literature survey of benchmark functions for global optimisation problems
• Marcinkiewicz-Zygmund inequalities for polynomials in Bergman and Hardy spaces
• Queuing search algorithm: a novel metaheuristic algorithm for solving engineering optimization problems
• GSA: A gravitational search algorithm
• A new meta-heuristic algorithm for continuous engineering optimization: harmony search theory and practice
• Unified analysis of variance by ranks
• Flower Pollination Algorithm for Global Optimization
• An improved butterfly optimization algorithm with chaos
• Unnamed Item

This page was built for publication: An opposition-based butterfly optimization algorithm with adaptive elite mutation in solving complex high-dimensional optimization problems