Journal of Computing and Natural Science


A Survey on Multi Objective Optimization Challenges in Swarm Intelligence



Journal of Computing and Natural Science

Received On : 20 March 2021

Revised On : 08 May 2021

Accepted On : 28 June 2021

Published On : 05 October 2021

Volume 01, Issue 04

Pages : 121-129


Abstract


Various challenges in real life are multi-objective and conflicting (i.e., alter concurrent optimization). This implies that a single objective is optimized based on another’s cost. The Multi-Objective Optimization (MOO) issues are challenging but potentially realistic, and due to their wide-range application, optimization challenges have widely been analyzed by research with distinct scholarly bases. Resultantly, this has yielded distinct approaches for mitigating these challenges. There is a wide-range literature concerning the approaches used to handle MOO challenges. It is important to keep in mind that each technique has its pros and limitations, and there is no optimum alternative for cure searchers in a typical scenario. The MOO challenges can be identified in various segments e.g., path optimization, airplane design, automobile design and finance, among others. This contribution presents a survey of prevailing MOO challenges and swarm intelligence approaches to mitigate these challenges. The main purpose of this contribution is to present a basis of understanding on MOO challenges.


Keywords


Multi-Objective Optimization (MOO), Particle Swarm Optimization (PSO), Pareto Optimal (PO), Traveling Salesperson (TSP), Ant Colony Optimization (ACO).


  1. H. Gao, L. Jézéquel, E. Cabrol, and B. Vitry, “Multi-objective robust optimization of chassis system with polynomial chaos expansion method,” Eng. Optim., vol. 53, no. 9, pp. 1483–1503, 2021.
  2. Z. S. Delhoum, “Contribution to multi-level multi-objective linear optimization,” J. Inf. Optimiz. Sci., vol. 42, no. 6, pp. 1383–1395, 2021.
  3. F. Lievens, P. R. Sackett, and W. De Corte, “Weighting admission scores to balance predictiveness-diversity: The Pareto-optimization approach,” Med. Educ., no. medu.14606, 2021.
  4. A. C. Gomes, R. F. Sampaio, G. C. Barroso, and R. P. S. Leao, “Optimum Pareto method for simultaneous placement of manual and remote controlled switch based on MILP model,” in 2021 14th IEEE International Conference on Industry Applications (INDUSCON), 2021.
  5. S. Mittal, D. K. Saxena, K. Deb, and E. D. Goodman, “A learning-based Innovized Progress operator for faster convergence in Evolutionary Multi-objective optimization,” ACM Trans. Evol. Learn. Optim., vol. 2, no. 1, pp. 1–29, 2022.
  6. G. Li, Y. Liu, G. Zhao, and Y. Zeng, “Reliability-based robust design optimization in consideration of manufacturing tolerance by multi-objective evolutionary optimization with repair algorithm,” Int. J. Comput. Methods, vol. 18, no. 05, p. 2150005, 2021.
  7. I. Setiawan, “Maqashid shariah’s criticism of the Pareto optimum theory,” MUQTASID J. Ekon. dan Perbank. Syariah, vol. 11, no. 1, pp. 14–28, 2020.
  8. Z. He, K. Zhou, H. Shu, X. Chen, and X. Lyu, “Multi-objective algorithm based on tissue P system for solving tri-objective optimization problems,” Evol. Intell., 2021.
  9. A. A. Mousa and I. M. El_Desoky, “Stability of Pareto optimal allocation of land reclamation by multistage decision-based multipheromone ant colony optimization,” Swarm Evol. Comput., vol. 13, pp. 13–21, 2013.
  10. S. Yin and H. Li, “GSAPSO-MQC:medical image encryption based on genetic simulated annealing particle swarm optimization and modified quantum chaos system,” Evol. Intell., vol. 14, no. 4, pp. 1817–1829, 2021.
  11. M. Mesquita-Cunha, J. R. Figueira, and A. P. Barbosa-Póvoa, “New ε-constraint methods for multi-objective integer linear programming: a Pareto front representation approach,” arXiv [math.OC], 2021.
  12. A. A. Queen and D. J. Auxillia, “Simplified discrete binary PSO tuned multivariable PID controller for binary distillation column plant,” in 2013 International Conference on Circuits, Power and Computing Technologies (ICCPCT), 2013.
  13. B. Aygun, B. Gunel Kilic, N. Arici, A. Cosar, and B. Tuncsiper, “Application of binary PSO for public cloud resources allocation system of video on demand (VoD) services,” Appl. Soft Comput., vol. 99, no. 106870, p. 106870, 2021.
  14. E. Rachdi, Y. E. Merabet, Z. Akhtar, and R. Messoussi, “Directional neighborhood topologies based multi-scale quinary pattern for texture classification,” IEEE Access, vol. 8, pp. 212233–212246, 2020.
  15. A. E. Gamorez, C. G. Nianga, and S. Canoy Jr, “Topologies induced by neighborhoods of a graph under some binary operations,” Eur. J. Pure Appl. Math., vol. 12, no. 3, pp. 749–755, 2019.
  16. C. Orlando and A. Ricciardello, “Analytic solution of the continuous particle swarm optimization problem,” Optim. Lett., vol. 15, no. 6, pp. 2005–2015, 2021.
  17. F. Nugroho, M. Faisal, and F. Hunaini, “Autonomous groups particles swarms optimisation (AGPSO) to optimise the fuzzy membership function in the automatic watering plant case study,” J. Phys. Conf. Ser., vol. 1908, no. 1, p. 012022, 2021.
  18. A. K. Hassan, M. Moinuddin, U. M. Al-Saggaf, and M. S. Shaikh, “On the kernel optimization of radial basis function using Nelder mead simplex,” Arab. J. Sci. Eng., vol. 43, no. 6, pp. 2805–2816, 2018.
  19. Y. Zhang et al., “Preliminary research on abnormal brain detection by wavelet-energy and quantum- behaved PSO,” Technol. Health Care, vol. 24 Suppl 2, no. s2, pp. S641-9, 2016.
  20. J. J. Durillo, J. García-Nieto, A. J. Nebro, C. A. C. Coello, F. Luna, and E. Alba, “Multi-objective particle swarm optimizers: An experimental comparison,” in Lecture Notes in Computer Science, Berlin, Heidelberg: Springer Berlin Heidelberg, 2009, pp. 495–509.
  21. T. Zheng, J. Wang, and Y. Cai, “Parallel hybrid particle swarm algorithm for workshop scheduling based on Spark,” Algorithms, vol. 14, no. 9, p. 262, 2021.
  22. J. B. C. Chagas and M. Wagner, “Efficiently solving the thief orienteering problem with a max–min ant colony optimization approach,” Optim. Lett., 2021.
  23. X. Wu, Z. C. Wang, T. H. Wu, and X. G. Bao, “Solving the Family Traveling Salesperson Problem in the Adleman-Lipton model based on DNA computing,” IEEE Trans. Nanobioscience, vol. PP, pp. 1–1, 2021.
  24. M. Serra and P. Venini, “On some applications of ant colony optimization metaheuristic to plane truss optimization,” Struct. Multidiscipl. Optim., vol. 32, no. 6, pp. 499–506, 2006.

Acknowledgements


The authors would like to thank to the reviewers for nice comments on the manuscript.


Funding


No funding was received to assist with the preparation of this manuscript.


Ethics declarations


Conflict of interest

The authors have no conflicts of interest to declare that are relevant to the content of this article.


Availability of data and materials


No data available for above study.


Author information


Contributions

All authors have equal contribution in the paper and all authors have read and agreed to the published version of the manuscript.


Corresponding author


Rights and permissions


Open Access This article is licensed under a Creative Commons Attribution NoDerivs is a more restrictive license. It allows you to redistribute the material commercially or non-commercially but the user cannot make any changes whatsoever to the original, i.e. no derivatives of the original work. To view a copy of this license, visit https://creativecommons.org/licenses/by-nc-nd/4.0/


Cite this article


Rich Caruana and Yin Lou, “A Survey on Multi Objective Optimization Challenges in Swarm Intelligence”, Journal of Computing and Natural Science, vol.1, no.4, pp. 121-129, October 2021. doi: 10.53759/181X/JCNS202101018.


Copyright


© 2021 Rich Caruana and Yin Lou. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.