To effectively improve the convergence and diversity of the multiobjective particle swarm optimization (MOPSO), we proposed a novel MOPSO based on ranking and cyclic distance (RCDMOPSO) that comprehensively considers the spatial target and congestion information of particles.RCDMOPSO introduced a method namely global proportional ranking (GPR) which differs from nondominated ranking under the Pareto framework, and designed a novel external archive maintenance and the global selection strategies of learning sample by combining GPR with cyclic distance. In this paper, RCDMOPSO together with eight classic and state-of-the-art algorithms were examined on ZDT, UF, and DTLZ series to test functions. The results show that RCDMOPSO is highly competitive in achieving the objectives of both convergence and diversity. RCDMOPSO outperformed other popular algorithms such as MOPSOs and multiobjective genetic algorithms based on comprehensive performance evaluation indicators inverted generational distance and hypervolume, thus supporting that RCDMOPSO is an effective approach to tackle multiobjective optimization problems.
Recently, multiobjective particle swarm optimization (MOPSO) has been widely used in science and engineering, however how to effectively improve the convergence and distribution of the algorithm has always been a hot research topic on multiobjective optimization problems (MOPs). To solve this problem, we propose a multiobjective particle swarm optimization based on the ideal distance (IDMOPSO). In IDMOPSO, the adaptive grid and ideal distance are used to optimize and improve the selection method of global learning samples and the size control strategy of the external archive, and the fine-tuning parameters are introduced to adjust particle flight in the swarm dynamically. Additionally, to prevent the algorithm from falling into a local optimum, the cosine factor is introduced to mutate the position of the particles during the exploitation and exploration process. Finally, IDMOPSO, several other popular MOPSOs and MOEAs were simulated on the benchmarks functions to test the performance of the proposed algorithm using IGD and HV indicators. The experimental results show that IDMOPSO has the better convergence, diversity, and excellent solution ability compared to the other algorithms.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.