Abstract
In the article presents a new evolutionary algorithms, this algorithm is based on reference points. This algorithm according to a archive find the non-dominated solution, and make this solution from large to small order according to crowding distance and let the space is divided to several small space equidistant, in each the subspace to obtain its centroid as the reference point. The method used in this paper are not predefined reference point but in the course of evolution according to the current state of dynamic reference point particles to guide the evolution, finally using five effectiveness test functions prove algorithm.
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 callMore From: IOP Conference Series: Materials Science and Engineering
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.
