Abstract

This paper presents a novel optimized algorithm-interval evolution algorithm, which sufficiently exerts the advantage of the reliability of interval algorithm as well as the global convergence of evolution strategies such as group search. By providing us all global optimizers and the inclusion interval of optimizers, we conclude that the algorithm is equipped well in solving the global nonlinear constrained optimization problem. The experiment demonstrates that the algorithm is effective in its steadiness, reliability, fast convergence rate and high accuracy.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call