Nature-inspired non-convex global optimization

Ecological
Cycle Optimizer

A metaheuristic optimizer that models ecological energy flow and material cycling to coordinate exploration and exploitation during global search.

Boyu Ma1,2,*, Jiaxiao Shi1,2,*, Yiming Ji1, and Zhengpu Wang1
1 State Key Laboratory of Robotics and Systems, Harbin Institute of Technology, China.
2 School of Mechanical and Aerospace Engineering, Nanyang Technological University, Singapore.
* Equal contribution.

explore
exploit
Illustration of the ecological cycle inspiration behind ECO

© 2026 ECO Project

Built for open research · By Jiaxiao Shi

01 / Overview

ECO is a nature-inspired metaheuristic algorithm for complex nonlinear and non-convex global optimization. It models the population as an ecological system, where ecological interactions provide complementary search behaviours instead of relying on a single update rule.

Ecological inspiration

In an ecosystem, producers, consumers, decomposers, and the inorganic environment are connected by energy flow and material cycling. Producers supply organic matter, consumers transfer energy through predation, and decomposers return biological remains to the nutrient pool. ECO translates this coupled cycle into an iterative optimization process.

ECO ecosystem schematic showing producers, consumers, decomposers, and nutrient cycling
Fig. 1. Ecological relationships used as the inspiration for ECO.

From ecology to optimization

Each candidate solution is treated as an organism, and its fitness is inversely related to its energy. Better solutions are retained through survival of the fittest, while ecological interactions generate new candidates. In this way, energy flow guides useful information through the population and material cycling renews information that may otherwise become stagnant.

What ECO is designed to study

The paper first determines a stable internal configuration through parameter sensitivity analysis. ECO is then assessed on the CEC-2014, CEC-2017, and CEC-2020 numerical benchmark suites, followed by five constrained engineering design problems from CEC-2020-RW.

© 2026 ECO Project

Built for open research · By Jiaxiao Shi

02 / Method

ECO models population evolution as an ecological cycle. Producers, consumers, and decomposers perform complementary updates, allowing the search to alternate between broad exploration and focused exploitation until the function-evaluation budget is exhausted.

Population initialization

The population is divided into producers, herbivores, carnivores, and omnivores. Their proportions satisfy PPro + PHer + PCar + POmn = 1, and individuals are randomly initialized within the constrained search space.

The first three group sizes are obtained from their prescribed proportions, while the omnivore group occupies the remaining population. This composition provides distinct ecological roles without introducing additional population-size parameters.

Producer strategy

Producers represent the foundation of the ecological system and absorb information recycled by decomposers. Their update strategy retains useful search information and refines promising regions, providing high-quality candidate solutions for the consumer groups.

Consumer strategy

Consumers are divided into herbivores, carnivores, and omnivores. Herbivores are guided by selected producers, carnivores by selected herbivores, and omnivores by a mixture of producers, herbivores, and carnivores.

Prey is selected by roulette-wheel sampling, so lower-fitness individuals are more likely to guide the update while multiple elite candidates remain available. These different predation paths diversify information exchange and reduce reliance on a single search direction.

Consumer-prey dynamics

The predation factor G determines the consumer-prey relationship. Values outside the local predation interval encourage consumers to leave the current target and explore a broader region, whereas values in the local interval promote exploitation around the selected prey.

As the iteration progresses, the random range of G contracts toward one. The mechanism therefore transitions from diverse early exploration to stable local refinement near high-quality solutions.

Consumer-prey relationship governed by the predation factor
Fig. 2. Consumer-prey relationship used in ECO.
Iteration-dependent variation of the ECO predation factor
Fig. 3. Iteration-dependent variation of the predation factor.

Decomposer strategy

After each ecological cycle, decomposers recycle population information through optimal, local-random, and global-random decomposition. Optimal decomposition samples near the current best solution to strengthen exploitation.

Local-random decomposition searches around the current individual with a radius determined by its distance from the best solution, while global-random decomposition uses a random walk to generate distant search directions. Their probabilities are controlled by popt and ploc.

ECO workflow

At every iteration, producers, consumers, and decomposers are updated in sequence. New candidates are evaluated, the best information is retained, and the ecological cycle is repeated until the available function evaluations are exhausted.

Flowchart of the ECO optimization workflow
Fig. 4. Main workflow of the Ecological Cycle Optimizer.

© 2026 ECO Project

Built for open research · By Jiaxiao Shi

03 / Experiments

The experimental study is organized from internal parameter selection to numerical benchmarking and engineering validation. All numerical tests follow the settings of the corresponding benchmark technical reports, and repeated runs are assessed by solution quality and statistical ranking.

Explore the full experimental study

Parameter sensitivity analysis

Population composition and decomposition probabilities are investigated separately on 23 classic optimization functions. The population proportions are restricted to balanced ecological configurations, and the candidate settings are ranked from repeated optimization runs.

The selected default configuration is PPro = 0.2, PHer = 0.3, PCar = 0.3, POmn = 0.2, with popt = 0.6 and ploc = 0.6. It is adopted in the subsequent experiments.

Population proportion sensitivity ranks across 23 benchmark functions
Fig. 5. Population proportion sensitivity analysis.
Decomposition probability sensitivity ranks across 23 benchmark functions
Fig. 6. Decomposition probability sensitivity analysis.

Screening of state-of-the-art algorithms

ECO is first evaluated against a pool of 30 metaheuristic algorithms on CEC-2014 and CEC-2017. Algorithms are ranked on each function by smaller Ave, followed by Min and Std, and their global performance is summarized using the Friedman mean rank.

ECO ranks first in this 30-algorithm screening. The five most competitive alternatives, ARO, CFOA, CSA, WSO, and INFO, are then selected for the more detailed CEC-2020 evaluation.

CEC-2020 statistical comparison

The six algorithms are compared on CEC-2020 at D = 10, 30, 50, and 100. The suite includes shifted, rotated, hybrid, and composition functions, which test robustness on nonseparable and multimodal landscapes.

The box plots show the distribution of final fitness values, while the radar charts report the function-wise ranks. ECO maintains narrow result distributions and the lowest Friedman mean rank across the four dimensions, indicating consistent solution quality as the dimension increases.

Friedman mean ranks of ECO and five competing algorithms across four dimensions
Fig. 7. Friedman mean ranks on the CEC-2020 test suite.
Fitness distributions of ECO and five competing algorithms on CEC-2020 functions
Fig. 8. Fitness-value distributions on representative CEC-2020 functions.
Function-wise ranks of ECO and five competing algorithms across CEC-2020 dimensions
Fig. 9. Function-wise rank profiles across CEC-2020 dimensions.

Convergence behaviour

The convergence curves compare the average best fitness against the number of function evaluations. ECO typically performs broad early exploration, followed by adaptive refinement and stronger late-stage exploitation, which helps it retain competitive convergence on functions with different landscape structures.

Convergence curves of ECO and competing algorithms on CEC-2020 functions
Fig. 10. Convergence comparison on representative CEC-2020 functions.

Qualitative search analysis

The qualitative results visualize objective landscapes, search histories, best and average fitness, solution trajectories, and the exploration--exploitation balance. They illustrate how ECO combines population diversity in the early search with focused refinement near promising regions in later iterations.

Qualitative visualization of ECO search behaviour on representative functions
Fig. 11. Qualitative analysis of ECO search behaviour.

Engineering validation

Five representative constrained design problems from CEC-2020-RW are used to evaluate practical applicability: speed reducer design, tension/compression spring design, welded beam design, three-bar truss design, and gear train design.

These problems include coupled variables, engineering constraints, and different objective landscapes. ECO attains the best overall rank among the evaluated algorithms, complementing the numerical tests with application-oriented validation.

Speed reducer design problem
Fig. 12. Speed reducer design.

RC15: Speed reducer

ECOFDB-AGDEFDB-SFSLRFDB-COAL-SHADENSM-SFS
x13.500000003.500000003.500000003.500000003.500000003.50000000
x20.700000000.700000000.700000000.700000000.700000000.70000000
x317.000000017.000000017.000000017.000000017.000000017.0000000
x47.300000007.300000007.300000007.300000007.300000007.30000000
x57.715319917.715319917.715319917.715319917.715319917.71531991
x63.350540953.350540953.350540953.350540953.350540953.35054095
x75.286654465.286654465.286654465.286654465.286654465.28665446
Min2994.424472994.424472994.424472994.424472994.424472994.42447
Ave2994.424472994.424472994.424472994.424472994.424472994.42447
Std9.2825E-131.0229E-089.2825E-139.2825E-139.2825E-139.2825E-13
Tension compression spring design problem
Fig. 13. Tension/compression spring design.

RC17: Spring design

ECOFDB-AGDEFDB-SFSLRFDB-COAL-SHADENSM-SFS
x10.051692310.051689060.051689010.051720360.051689070.05168904
x20.356796020.356717770.356716430.357471090.356717840.35671715
x311.284378111.288963811.289042611.244945311.288960111.2890006
Min0.012665230.012665230.012665230.012665240.012665230.01266523
Ave0.012665250.012665270.012665330.012665380.012669500.01266525
Std3.8839E-092.2047E-069.4667E-061.0027E-066.5781E-051.8822E-08
Welded beam design problem
Fig. 14. Welded beam design.

RC19: Welded beam design

ECOFDB-AGDEFDB-SFSLRFDB-COAL-SHADENSM-SFS
x10.205729640.205729640.205729640.205729640.205729640.20572964
x23.253120043.253120043.253120043.253120043.253120043.25312004
x39.036623919.036623919.036623919.036623919.036623919.03662391
x40.205729640.205729640.205729640.205729640.205729640.20572964
Min1.695247161.695247161.695247161.695247161.695247161.69524716
Ave1.695247161.695247161.695247161.695247161.695247161.69524716
Std2.2662E-162.2662E-162.2662E-162.2662E-162.2662E-162.2662E-16
Three-bar truss design problem
Fig. 15. Three-bar truss design.

RC20: Three-bar truss

ECOFDB-AGDEFDB-SFSLRFDB-COAL-SHADENSM-SFS
x10.788675130.788675140.788675140.788675070.788675130.78867513
x20.408248300.408248290.408248290.408248480.408248290.40824830
Min263.895843263.895843263.895843263.895843263.895843263.895843
Ave263.895843263.895843263.895843263.895843263.895843263.895843
Std5.8016E-145.8016E-145.8016E-143.1422E-115.8016E-145.8016E-14
Gear train design problem
Fig. 16. Gear train design.

RC31: Gear train design

ECOFDB-AGDEFDB-SFSLRFDB-COAL-SHADENSM-SFS
x149.300040349.491895149.382444248.663879349.369875749.2889111
x219.360591716.098385615.796573618.597356816.052124416.0674738
x315.848136019.386063619.351756916.289383019.201422418.9821250
x442.867378442.630148943.435353943.207786342.542491043.3920358
Min2.7009E-122.7010E-122.7017E-122.7009E-122.7015E-122.7010E-12
Ave2.7009E-121.8669E-113.7588E-101.4927E-112.0184E-111.5408E-11
Std0.0000E+002.1711E-104.7952E-101.0189E-112.4235E-101.0324E-11

Ready to experiment with ECO?

Source code Paper Contact

© 2026 ECO Project

Built for open research · By Jiaxiao Shi

04 / Acknowledgment

This page acknowledges the contributions behind ECO and provides practical ways to support and reuse the project.

Author contributions

Boyu Ma and Jiaxiao Shi contributed equally to this work. Boyu Ma contributed to the conceptualization, methodology, and development of the ECO algorithm.

Jiaxiao Shi contributed to software implementation, experimental design, data analysis, visualization, and manuscript preparation. Yiming Ji contributed to benchmark preparation, result verification, and experimental evaluation.

Zhengpu Wang contributed to supervision, technical review, and guidance on the research direction. All authors reviewed the results and approved the final presentation of the project.

Open research

The source code, benchmark settings, figures, and supporting materials are provided to make ECO easier to inspect and reproduce. We welcome feedback, extensions, and independent comparisons using the same evaluation protocol.

If ECO is useful for your research, please consider giving the ECO-Optimizer repository a star . A star helps other researchers discover the implementation and supports the continued maintenance of the project.

BibTeX

@article{2026eco,
  title   = {Ecological Cycle Optimizer: A novel nature-inspired metaheuristic algorithm for non-convex global optimization},
  author  = {Boyu Ma and Jiaxiao Shi and Yiming Ji and Zhengpu Wang},
  journal = {arXiv preprint arXiv:2508.20458},
  year    = {2026}
}

Contact

For questions about ECO, its implementation, or research collaboration, please contact Boyu Ma or Jiaxiao Shi.