Luis Miguel Antonio
ABSTRACT
Particle swarm optimization (PSO) algorithms have been widely used to solve a variety of optimization problems. Their success has motivated researchers to extend the use of these techniques to the multi-objective optimization field. However, most of these extensions have been used to solve multi-objective optimization problems (MOPs) with no more than three objective functions. Here, we propose a novel multi-objective PSO (MOPSO) algorithm characterized by the use of a recent approach that transforms a MOP into a linear assignment problem (LAP), with the aim of being able to solve many-objective optimization problems. Our proposed approach, called LAP based PSO (LAPSO), adopts the Munkres assignment algorithm to solve the generated LAPs and has no need of an external archive. LAPSO is compared with respect to three MOPSOs which are representative of the state-of-the-art in the area: the Optimized Multi-Objective Particle Swarm Optimizer (OMOPSO) the Speed-constrained Multiobjective Particle Swarm Optimizer (SMPSO) and a variant of the latter that uses the hypervolume indicator for its leader selection scheme (SMPSOhv). Our results indicate that LAPSO is able to outperform the MOPSOs with respect to which it was compared in most of the test problems adopted, specially when solving instances with more than three objectives.
- M. R. Bonyadi and Z. Michalewicz. Spso 2011: Analysis of stability; local convergence; and rotation sensitivity. In Proceedings of the 2014 Conference on Genetic and Evolutionary Computation, GECCO '14, pages 9--16, New York, NY, USA, 2014. ACM. Google Scholar
Digital Library
- F. Bourgeois and J.-C. Lassalle. An Extension of the Munkres Algorithm for the Assignment Problem to Rectangular Matrices. Commun. ACM, 14(12):802--804, December 1971. Google ScholarDigital Library
- M. Clerc. Particle Swarm Optimization. ISTE (International Scientific and Technical Encyclopedia), USA, 2006.Google Scholar
- M. Clerc and J. Kennedy. The particle swarm - explosion, stability, and convergence in a multidimensional complex space. IEEE Transactions on Evolutionary Computation, 6(1):58--73, Feb 2002. Google ScholarDigital Library
- C. A. Coello Coello, D. A. Van Veldhuizen, and G. B. Lamont. Evolutionary Algorithms for Solving Multi-Objective Problems. Kluwer Academic Publishers, New York, May 2002. ISBN 0--3064--6762--3.Google ScholarDigital Library
- K. Deb, L. Thiele, M. Laumanns, and E. Zitzler. Scalable Test Problems for Evolutionary Multiobjective Optimization. In A. Abraham, L. Jain, and R. Goldberg, editors, Evolutionary Multiobjective Optimization. Theoretical Advances and Applications, pages 105--145. Springer Berlin Heidelberg, USA, 2005.Google ScholarCross Ref
- J. Durillo, A. Nebro, C. Coello Coello, J. Garcia-Nieto, F. Luna, and E. Alba. A Study of Multiobjective Metaheuristics When Solving Parameter Scalable Problems. IEEE Transactions on Evolutionary Computation, 14(4):618--635, August 2010. Google ScholarDigital Library
- K. T. Fang and Y. Wang. Number-Theoretic Methods in Statistics. Chapman & Hall/CRC Monographs on Statistics & Applied Probability. Taylor & Francis, 1994.Google ScholarCross Ref
- D. Gale and L. S. Shapley. College Admissions and the Stability of Marriage. The American Mathematical Monthly, 69(1):9--15, 1962.Google ScholarCross Ref
- J. M. Hammersley. Monte-Carlo methods for solving multivariable problems. Annals of the New York Academy of Sciences, 86(3):844--874, 1960.Google ScholarCross Ref
- H. Ishibuchi, N. Tsukamoto, and Y. Nojima. Evolutionary many-objective optimization: A short review. In 2008 Congress on Evolutionary Computation (CEC'2008), pages 2424--2431, Hong Kong, June 2008. IEEE Service Center.Google ScholarCross Ref
- M. Janga Reddy and D. Nagesh Kumar. An efficient multi-objective optimization algorithm based on swarm intelligence for engineering design. Engineering Optimization, 39(1):49--68, 2007.Google ScholarCross Ref
- J. Kennedy. Small worlds and mega-minds: effects of neighborhood topology on particle swarm performance. In Proceedings of the 1999 IEEE Congress on Evolutionary Computation, volume 3, 1999.Google ScholarCross Ref
- J. Kennedy and R. Eberhart. Particle swarm optimization. In IEEE International Conference on Neural Networks, volume 4, pages 1942--1948, Nov 1995.Google ScholarCross Ref
- I. Kokolo, K. Hajime, and K. Shigenobu. Failure of Pareto-based MOEAs: Does Non-dominated Really Mean Near to Optimal? In Proceedings of the Congress on Evolutionary Computation 2001 (CEC'2001), volume 2, pages 957--962, Piscataway, New Jersey, May 2001. IEEE Service Center.Google Scholar
- N. Korobov. The approximate computation of multiple integrals. Doklady Akademii Nauk SSSR, 124:1207--1210, 1959.Google Scholar
- H. W. Kuhn. The Hungarian Method for the Assignment Problem. Naval Research Logistics Quarterly, 2(1--2):83--97, Mar. 1955.Google Scholar
- K. S. Lim, S. Buyamin, A. Ahmad, and Z. Ibrahim. An improved leader guidance in multi objective particle swarm optimization. In Modelling Symposium (AMS), 2012 Sixth Asia, pages 34--39, May 2012. Google ScholarDigital Library
- J. A. Molinet Berenguer and Carlos A. Coello Coello. Evolutionary Many-Objective Optimization Based on Kuhn-Munkres' Algorithm. In A. Gaspar-Cunha, C. H. Antunes, and C. Coello Coello, editors, Evolutionary Multi-Criterion Optimization, 8th International Conference, EMO 2015, pages 3--17. Springer. Lecture Notes in Computer Science Vol. 9019, Guimar\ aes, Portugal, March 29 - April 1 2015.Google Scholar
- J. Moore, R. Chapman, and G. Dozier. Multiobjective particle swarm optimization. In Proceedings of the 38th Annual on Southeast Regional Conference, ACM-SE 38, pages 56--57, New York, NY, USA, 2000. ACM. Google ScholarDigital Library
- J. Munkres. Algorithms for the Assignment and Transportation Problems. Journal of the Society for Industrial and Applied Mathematics, 5(1):32--38, Mar. 1957.Google ScholarCross Ref
- A. J. Nebro, J. J. Durillo, and C. A. Coello Coello. Analysis of Leader Selection Strategies in a Multi-Objective Particle Swarm Optimizer. In 2013 IEEE Congress on Evolutionary Computation (CEC'2013), pages 3153--3160, Cancún, México, 20--23 June 2013. IEEE Press. ISBN 978--1--4799-0454--9.Google ScholarCross Ref
- A. J. Nebro, J. J. Durillo, J. Garcia-Nieto, C. A. Coello Coello, F. Luna, and E. Alba. SMPSO: A New PSO-based Metaheuristic for Multi-objective Optimization. In 2009 IEEE Symposium on Computational Intelligence in Multi-Criteria Decision-Making (MCDM'2009), pages 66--73, Nashville, TN, USA, March 30 - April 2 2009. IEEE Press. ISBN 978--1--4244--2764--2.Google Scholar
- N. Padhye, J. Branke, and S. Mostaghim. Empirical Comparison of MOPSO Methods - Guide Selection and Diversity Preservation -. In 2009 IEEE Congress on Evolutionary Computation (CEC'2009), pages 2516--2523, Trondheim, Norway, May 2009. IEEE Press. Google ScholarDigital Library
- D. H. Phan and J. Suzuki. R2-IBEA: R2 Indicator Based Evolutionary Algorithm for Multiobjective Optimization. In IEEE Congress on Evolutionary Computation (CEC'2013), pages 1836--1845, 2013.Google ScholarCross Ref
- R. C. Purshouse and P. J. Fleming. On the Evolutionary Optimization of Many Conflicting Objectives. IEEE Transactions on Evolutionary Algorithms, 11(6):770--784, December 2007. Google ScholarDigital Library
- M. Reyes Sierra and C. A. Coello Coello. Improving PSO-Based Multi-objective Optimization Using Crowding, Mutation and ε-Dominance. In C. A. Coello Coello, A. Hernández Aguirre, and E. Zitzler, editors, Evolutionary Multi-Criterion Optimization. Third International Conference, EMO 2005, pages 505--519, Guanajuato, México, March 2005. Springer. Lecture Notes in Computer Science Vol. 3410. Google ScholarDigital Library
- M. Reyes-Sierra and C. A. Coello Coello. Multi-Objective Particle Swarm Optimizers: A Survey of the State-of-the-Art. International Journal of Computational Intelligence Research, 2(3):287--308, 2006.Google Scholar
- R. Santana, M. Pontes, and C. Bastos-Filho. A multiple objective particle swarm optimization approach using crowding distance and roulette wheel. In Intelligent Systems Design and Applications, 2009. ISDA '09. Ninth International Conference on, pages 237--242, Nov 2009. Google ScholarDigital Library
- H. Scheffé. Experiments with mixtures. Journal of the Royal Statistical Society. Series B (Methodological), 20(2):344--360, 1958.Google ScholarCross Ref
- Y.-Y. Tan, Y.-C. Jiao, H. Li, and X.-K. Wang. MOEA/DGoogle Scholar
- uniform design: A new version of MOEA/D for optimization problems with many objectives. Computers & Operations Research, 40(6):1648--1660, June 2013. Google ScholarDigital Library
- P. K. Tripathi, S. Bandyopadhyay, and S. K. Pal. An Adaptive Multi-Objective Particle Swarm Optimization algorithm with Constraint Handling. In B. K. Panigrahi, Y. Shi, and M.-H. Lim, editors, Handbook of Swarm Intelligence. Concepts, Principles and Applications, pages 221--239. Springer-Verlag, Berlin, Germany, 2011.Google ScholarCross Ref
- Y. Wang and K. T. Fang. Number-Theoretic Method in Applied statistics (II). Chinese Annals of Mathematics. Serie B, 11:859--914, 1990.Google Scholar
- M. Zambrano-Bigiarini, M. Clerc, and R. Rojas. Standard particle swarm optimisation 2011 at cec-2013: A baseline for future pso improvements. In Evolutionary Computation (CEC), 2013 IEEE Congress on, pages 2337--2344, June 2013.Google ScholarCross Ref
- Q. Zhang and H. Li. MOEA/D: A Multiobjective Evolutionary Algorithm Based on Decomposition. IEEE Transactions on Evolutionary Computation, 11(6):712--731, December 2007. Google ScholarDigital Library
- E. Zitzler, D. Brockhoff, and L. Thiele. The Hypervolume Indicator Revisited: On the Design of Pareto-compliant Indicator Via Weighted Integration. In S. Obayashi, K. Deb, C. Poloni, T. Hiroyasu, and T. Murata, editors, Evolutionary Multi-Criterion Optimization, 4th International Conference, EMO 2007, pages 862--876, Matshushima, Japan, March 2007. Springer. Lecture Notes in Computer Science Vol. 4403. Google ScholarDigital Library
Index Terms
- Particle Swarm Optimization Based on Linear Assignment Problem Transformations
Recommendations
A Modified Quantum-Behaved Particle Swarm Optimization
ICCS '07: Proceedings of the 7th international conference on Computational Science, Part I: ICCS 2007Based on the previously introduced Quantum-behaved Particle Swarm Optimization (QPSO), a revised QPSO with Gaussian disturbance on the mean best position of the swarm is proposed. The reason for the introduction of this novel method is that the ...
Self-Adaptive Particle Swarm Optimization
Simulated Evolution and LearningAbstractParticle swarm optimization (PSO) has been used to solve a wide variety of optimization problems. The basic PSO algorithm contains a number of control parameters, including the inertia weight, w, and the acceleration coefficients, c1 and c2. The ...
Geometric Particle Swarm Optimization for Multi-objective Optimization Using Decomposition
GECCO '16: Proceedings of the Genetic and Evolutionary Computation Conference 2016Multi-objective evolutionary algorithms (MOEAs) based on decomposition are aggregation-based algorithms which transform a multi-objective optimization problem (MOP) into several single-objective subproblems. Being effective, efficient, and easy to ...
Comments