Abstract
In order to realize the coordinated control of multi-objective system in dynamic environment, this paper proposes an adaptive multi-swarm dynamic multi-objective particle swarm optimization arithmetic based on sparse distance and e domination method. The arithmetic adopts an improved e domination strategy to update the external archive, adjust the e value in real time, and ensure the fast distribution of particle swarm in the early stage and accurate search in the later stage. Global optimal solution is selected based on the sparse distance of external archive to ensure the distribution of non-inferior solution. Through the test of distribution and convergence, it is proved that the selection of learning samples based on sparse distance helps to keep the distribution of non-inferior solution and the improved e control external file maintenance method not only improves the distribution, but also increases the external archive scale with the increase of iterations, so that the non-inferior solution can better cover the Pareto optimal frontier.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
