Abstract
Artificial plant optimization algorithm is proposed to solve constrained optimization problems in this paper. In APOA, a shrinkage coefficient is introduce to ensure that all dimensions of a branch are within lower and upper bounds, and a new function to determine whether the particle is within the feasible region. One dimensional search optimization methods are selected in algorithm to produce a new position which is guaranteed to be in the feasible region for the branch which escapes from the feasible region. The experimental results show that artificial plant optimization algorithm is effective and efficient for constrained optimization problems.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.