A new simplified MOPSO based on Swarm Elitism and Swarm Memory: MO-ETPSO (2402.12856v1)
Abstract: This paper presents an algorithm based on Particle Swarm Optimization (PSO), adapted for multi-objective optimization problems: the Elitist PSO (MO-ETPSO). The proposed algorithm integrates core strategies from the well-established NSGA-II approach, such as the Crowding Distance Algorithm, while leveraging the advantages of Swarm Intelligence in terms of individual and social cognition. A novel aspect of the algorithm is the introduction of a swarm memory and swarm elitism, which may turn the adoption of NSGA-II strategies in PSO. These features enhance the algorithm's ability to retain and utilize high-quality solutions throughout optimization. Furthermore, all operators within the algorithm are intentionally designed for simplicity, ensuring ease of replication and implementation in various settings. Preliminary comparisons with the NSGA-II algorithm for the Green Vehicle Routing Problem, both in terms of solutions found and convergence, have yielded promising results in favor of MO-ETPSO.
- J. Martins and A. Lambe, “Multidisciplinary design optimization: A survey of architectures,” AIAA J., vol. 51, pp. 2049–2075, 2013.
- R. C. Fitas, “Optimal design of composite structures using the particle swarm method and hybridizations,” Repository Universidade do Porto, 2022.
- N. Gunantara, “A review of multi-objective optimization: Methods and its applications,” Cogent Eng., vol. 5, p. 1502242, 2018.
- Y. Sun, Y. Gao, and X. Shi, “Chaotic multi-objective particle swarm optimization algorithm incorporating clone immunity,” Mathematics, vol. 7, p. 146, 2019.
- M. Dorigo, “Ant colony optimization—new optimization techniques in engineering,” Ant Colony Optim., pp. 101–117, 1991.
- J. Kennedy and R. Eberhart, “Particle swarm optimization,” in Proceedings of the ICNN’95—International Conference on Neural Networks, vol. 4, Perth, WA, Australia, 1995, pp. 1942–1948.
- S. Sharma and V. Kumar, “A comprehensive review on multi-objective optimization techniques: Past, present and future,” Arch. Comput. Methods Eng., vol. 29, pp. 5605–5633, 2022.
- K. Deb, A. Pratap, S. Agarwal, and T. Meyarivan, “A fast and elitist multiobjective genetic algorithm: Nsga-ii,” IEEE transactions on evolutionary computation, vol. 6, no. 2, pp. 182–197, 2002.
- C. C. Coello and M. S. Lechuga, “Mopso: A proposal for multiple objective particle swarm optimization,” in Proceedings of the 2002 Congress on Evolutionary Computation. CEC’02 (Cat. No. 02TH8600), vol. 2. IEEE, 2002, pp. 1051–1056.
- M. R. Sierra and C. A. Coello Coello, “Improving pso-based multi-objective optimization using crowding, mutation and∈\in∈-dominance,” in International conference on evolutionary multi-criterion optimization. Springer, 2005, pp. 505–519.
- A. C. Godinez, L. E. M. Espinosa, and E. M. Montes, “An experimental comparison of multiobjective algorithms: Nsga-ii and omopso,” in 2010 IEEE Electronics, Robotics and Automotive Mechanics Conference. IEEE, 2010, pp. 28–33.
- R. Fitas, G. das Neves Carneiro, and C. C. António, “An elitist multi-objective particle swarm optimization algorithm for composite structures design,” Composite Structures, vol. 300, p. 116158, 2022.
- F. J. Solis and R. J. B. Wets, “Minimization by random search techniques,” Mathematics of Operations Research, vol. 6, no. 1, pp. 19–30, 1981.
- D. Wolpert and W. Macready, “No free lunch theorems for optimization,” IEEE Trans. Evol. Comput., vol. 1, pp. 67–82, 1997.