Entropy diversity in multi-objective particle swarm optimization
Summary: Multi-objective particle swarm optimization (MOPSO) is a search algorithm based on social behavior. Most of the existing multi-objective particle swarm optimization schemes are based on Pareto optimality and aim to obtain a representative non-dominated Pareto front for a given problem. Several approaches have been proposed to study the convergence and performance of the algorithm, particularly by accessing the final results. In the present paper, a different approach is proposed, by using Shannon entropy to analyze the MOPSO dynamics along the algorithm execution. The results indicate that Shannon entropy can be used as an indicator of diversity and convergence for MOPSO problems.
- Multiobjective particle swarm optimization based on Pareto entropy
- On convergence analysis of multi-objective particle swarm optimization algorithm
- On convergence of the multi-objective particle swarm optimizers
- A novel strategy of Pareto-optimal solution searching in multi-objective particle swarm optimization (MOPSO)
- Study on multi-objective particle swarm optimization algorithm
- Testing of a spreading mechanism to promote diversity in multi-objective particle swarm optimization
- Multiobjective particle swarm optimization based on Pareto entropy
- DIVERSITY-BASED INFORMATION EXCHANGE AMONG MULTIPLE SWARMS IN PARTICLE SWARM OPTIMIZATION
- Recent Results and Open Problems in Evolutionary Multiobjective Optimization
This page was built for publication: Entropy diversity in multi-objective particle swarm optimization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q280756)