Abstract
To solve the multi-modal multi-objective optimization problems which may have two or more Pareto-optimal solutions with the same fitness value, a new multi-objective particle swarm optimizer with a dynamic neighborhood balancing mechanism (DNB-MOPSO) is proposed in this paper. First, an adaptive parameter adjustment strategy is developed to balance the local and global search, which takes the difference among niches into consideration. Second, according to evolutionary states, a mutation operator is alternatively utilized to construct new solutions for escaping from the local optima. Then, combined with current niching methods, the dynamic neighborhood reform strategy of non-overlapping regions is properly implemented, which can enhance the exploration and keep the population diversity in the decision space. To validate the effectiveness of the proposed algorithm, DNB-MOPSO is compared with the other five popular multi-objective optimization algorithms. It is also applied to solve a real-world problem. The experimental results show the superiority of the proposed algorithm, especially in locating more optimal solutions in the decision space while obtaining the well-distributed Pareto fronts.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have