Multi-objective optimization is a branch of mathematics used in a large range of applications. It deals with optimization problems involving two or more conflicting objective functions to be optimized. Consequently, there is not a single solution that simultaneously optimizes these objectives, but a set of compromise solutions. These compromise solutions are also called non-dominated, Pareto-optimal, efficient or non-inferior solutions. The best solution of this set is the one closest point to the utopia point. There are several approaches to perform multi-objective optimization. Undoubtedly the future of multi-objective optimization programming is in artificial intelligence applications. One of the artificial intelligence models is the Corona algorithm. It aims to simulate the epidemic behavior of the Corona virus that affects people's health and its treatment. In this paper, the artificial Corona algorithm is introduced and expanded for solving multi-objective programming problems in which other models are not effective. The algorithm operates by iteratively selecting the initial values for decision variables of a multi-objective programming problem. The values of objective functions and constraint(s) are calculated. This proposed approach depends on a linear formula to update the solution. An acceptable efficient solution that has a minimum distance value from the utopia point is selected as the best point. To demonstrate the effectiveness of the proposed approach, some illustrative examples are given. These examples include both linear and nonlinear problems. The results indicate that the proposed approach has a high speed and capability to obtain the best solution when compared with other similar works of literature.
| Published in | American Journal of Artificial Intelligence (Volume 6, Issue 1) |
| DOI | 10.11648/j.ajai.20220601.12 |
| Page(s) | 10-19 |
| Creative Commons |
This is an Open Access article, distributed under the terms of the Creative Commons Attribution 4.0 International License (http://creativecommons.org/licenses/by/4.0/), which permits unrestricted use, distribution and reproduction in any medium or format, provided the original work is properly cited. |
| Copyright |
Copyright © The Author(s), 2022. Published by Science Publishing Group |
Artificial Corona Algorithm, Multi-objective Problems, Best Solution
| [1] | Alia Youssef Gebreel (2021). Artificial Corona-inspired optimization algorithm: Theoretical foundations, analysis, and applications. (Research gate), American Journal of Artificial Intelligence, DOI: 10.11648/j.ajai.20210502.12, 5 (2), PP. 56- 65. |
| [2] | Kaisa M Miettinen (2004). Nonlinear multiobjective optimization. Kluwer Academic Publishers, Fourth Printing. |
| [3] | Alia Youssef Gebreel (2021). Solving the multi-objective convex programming problems to get the best compromise solution. (Research gate), Australian Journal of Basic and Applied Sciences, DOI: 10.22587/ajbas.2021.15.5.3, 15 (5), PP. 17-29. |
| [4] | Ashis Kumar Mishra, Yogomaya Mohapatra, & Anil Kumar Mishra (2013). Multi-objective genetic algorithm: A comprehensive survey. International Journal of Emerging Technology and Advanced Engineering, Website: www.ijetae.com, 3 (2), PP. 81-90. |
| [5] | Ivan P. Stanimirovi´c, Milan Lj. Zlatanovi´c, & Marko D. Petkovi (2011). On the linear weighted sum method for multi-objective optimization, FACTA University (NIS) SER. Math. Inform., 26, PP. 49-63. |
| [6] | Jason Brownlee (2012). Clever algorithms nature-inspired programming recipes, ISBN: 978-1-4467-8506-5. |
| [7] | Giagkiozis, & P. J. Fleming (2015). Methods for multi-objective optimization: An analysis, Information Sciences, Science Direct, 293, PP. 1-16. |
| [8] | Nyoman Gunantara (2018). A review of multi-objective optimization: Methods and its applications, Cogent Engineering, Taylor & Francis, DOI.org/10.1080/23311916. 2018.1502242, (5), PP. 1-16. |
| [9] | Yin-Fu Huang, & Sih-Hao Chen (2020). Solving multi-objective optimization problems using self-adaptive harmony search algorithms. Soft Computing, Springer-Verlag GmbH Germany, DOI.org/10.1007/s00500-019-04175-0, 24, PP. 4081-4107. |
| [10] | P. K. De, & Bharti Yadav (2011). An algorithm for obtaining optimal compromise solution of a multi objective fuzzy linear programming problem. International Journal of Computer Applications, (0975 – 8887), 17 (1), PP. 20-24. |
| [11] | Neha Gupta, Irfan Ali, & Abdul Bari (2013). A compromise solution for multi-objective chance constraint capacitated transportation problem. ProbStat Forum, ISSN 0974-3235, 6, PP. 60-67. |
| [12] | M. Upmanyu, & R. R. Saxena (2015). Obtaining a compromise solution of a multi objective fixed charge problem in a fuzzy environment. International Journal of Pure and Applied Mathematics, DOI: http://dx.doi.org/10.12732/ijpam.v98i2.3, 98 (2), PP. 193-210. |
| [13] | Zhiyuan Wang, & Gade Pandu Rangaiah (2017) Application and analysis of methods for selecting an optimal solution from the Pareto-optimal front obtained by multiobjective optimization. I&EC research, Industrial & Engineering Chemistry Research, DOI: 10.1021/acs.iecr.6b03453, 56, PP. 560−574. |
| [14] | Alia Youssef Gebreel (2016). On a compromise solution for solving multiobjective convex programming problems. (Research gate), International Journal of Scientific & Engineering Research, 7 (6), PP. 403-409. |
| [15] | Alia Youssef Gebreel (2016). An adaptive interactive multi-objective optimization approach based on decision neural network. (Research gate), International Journal of Scientific & Engineering Research, 7 (8), PP. 1178-1185. |
| [16] | Alia Youssef Gebreel (2018). Developing an Intelligent Interactive Approach for Multi-objective Optimization Problems. (Research gate), International Journal of Scientific & Engineering Research, http://www.ijser.or, 9 (12), PP. 1952- 1966. |
| [17] | Murshid Kamal, Syed Aqib Jalil, Syed Mohd Muneeb, & Irfan Ali (2018). A distance based method for solving multiobjective optimization problems. Journal of applied modern statistical methods, DOI: 10.22237/jmasm/ 1532525455, Vol. 7, No. 1, PP: 1-23. |
| [18] | Janett Walters-Williams, & Yan Li (2010). Comparative study of distance functions for nearest neighbors. Advanced Techniques in Computing Sciences and Software Engineering, Springer Science + Business Media B. V. |
| [19] | Stephen Boyd, & Lieven Vandenberghet (2009). Convex optimization. Cambridge University Press, Second edition. |
| [20] | Indresh Kumar Gupta, & Jeetendra Kumar (2015). VEGA and MOGA an approach to multi-objective optimization. International Journal of Advanced Research in Computer Science and Software Engineering, ISSN: 2277 128X, 5 (4), PP. 865-870. |
| [21] | Sebastian Sitarz (2012). Interactive compromise hypersphere method and its applications. RAIRO Operations Research, DOI: 10.1051/ro/2012017, 46, PP. 235–252. |
| [22] | Majid Rafei, Samin Ebrahim Sorkhabi, & Mohammad Reza Mosavi (2014). Multi-objective optimization by means of multi-dimensional MLP neural networks. Neural Network World, DOI: 10.14311/NNW.2014.24.002, (1/14), PP. 31- 56. |
| [23] | Valdimir Sevasty Anov (2013). Hybrid multi- gradient explorer algorithm for global multi-objective optimization. American Institute of Aeronautics and Astronautics, eartius, Inc., 10 (94-99), PP. 1-15. |
| [24] | G. Chiandussi, M. Codegone, S. Ferrero, & F. E. Varesio (2012). Comparison of multi-objective optimization methodologies for engineering applications. Computers and Mathematics with Applications, 63, PP. 912-942. |
| [25] | Mohamed S. A. Osman, Waiel Fathi Abd El-Wahed, Mahmoud Mostafa El-Sherbiny, & Alia Youssef Gebreel (2018). Developing intelligent interactive approach for multi-objective optimization problems. Ph. D. in Operations Research Department, ISSR, Cairo University, Egypt, (Research gate). |
| [26] | Abbas Y. Al-Bayati, & Huda E. Khalid (2012). On multi-objective geometric programming problems with a negative degree of difficulty. Iraqi Journal of Statistical Science, 21, PP. 1-14. |
APA Style
Alia Youssef Gebreel. (2022). Artificial Corona Algorithm to Solve Multi-objective Programming Problems. American Journal of Artificial Intelligence, 6(1), 10-19. https://doi.org/10.11648/j.ajai.20220601.12
ACS Style
Alia Youssef Gebreel. Artificial Corona Algorithm to Solve Multi-objective Programming Problems. Am. J. Artif. Intell. 2022, 6(1), 10-19. doi: 10.11648/j.ajai.20220601.12
Share This Article
Twitter
Linked In
Facebook
Copy
Download@article{10.11648/j.ajai.20220601.12,
author = {Alia Youssef Gebreel},
title = {Artificial Corona Algorithm to Solve Multi-objective Programming Problems},
journal = {American Journal of Artificial Intelligence},
volume = {6},
number = {1},
pages = {10-19},
doi = {10.11648/j.ajai.20220601.12},
url = {https://doi.org/10.11648/j.ajai.20220601.12},
eprint = {https://article.sciencepublishinggroup.com/pdf/10.11648.j.ajai.20220601.12},
abstract = {Multi-objective optimization is a branch of mathematics used in a large range of applications. It deals with optimization problems involving two or more conflicting objective functions to be optimized. Consequently, there is not a single solution that simultaneously optimizes these objectives, but a set of compromise solutions. These compromise solutions are also called non-dominated, Pareto-optimal, efficient or non-inferior solutions. The best solution of this set is the one closest point to the utopia point. There are several approaches to perform multi-objective optimization. Undoubtedly the future of multi-objective optimization programming is in artificial intelligence applications. One of the artificial intelligence models is the Corona algorithm. It aims to simulate the epidemic behavior of the Corona virus that affects people's health and its treatment. In this paper, the artificial Corona algorithm is introduced and expanded for solving multi-objective programming problems in which other models are not effective. The algorithm operates by iteratively selecting the initial values for decision variables of a multi-objective programming problem. The values of objective functions and constraint(s) are calculated. This proposed approach depends on a linear formula to update the solution. An acceptable efficient solution that has a minimum distance value from the utopia point is selected as the best point. To demonstrate the effectiveness of the proposed approach, some illustrative examples are given. These examples include both linear and nonlinear problems. The results indicate that the proposed approach has a high speed and capability to obtain the best solution when compared with other similar works of literature.},
year = {2022}
}
TY - JOUR T1 - Artificial Corona Algorithm to Solve Multi-objective Programming Problems AU - Alia Youssef Gebreel Y1 - 2022/03/31 PY - 2022 N1 - https://doi.org/10.11648/j.ajai.20220601.12 DO - 10.11648/j.ajai.20220601.12 T2 - American Journal of Artificial Intelligence JF - American Journal of Artificial Intelligence JO - American Journal of Artificial Intelligence SP - 10 EP - 19 PB - Science Publishing Group SN - 2639-9733 UR - https://doi.org/10.11648/j.ajai.20220601.12 AB - Multi-objective optimization is a branch of mathematics used in a large range of applications. It deals with optimization problems involving two or more conflicting objective functions to be optimized. Consequently, there is not a single solution that simultaneously optimizes these objectives, but a set of compromise solutions. These compromise solutions are also called non-dominated, Pareto-optimal, efficient or non-inferior solutions. The best solution of this set is the one closest point to the utopia point. There are several approaches to perform multi-objective optimization. Undoubtedly the future of multi-objective optimization programming is in artificial intelligence applications. One of the artificial intelligence models is the Corona algorithm. It aims to simulate the epidemic behavior of the Corona virus that affects people's health and its treatment. In this paper, the artificial Corona algorithm is introduced and expanded for solving multi-objective programming problems in which other models are not effective. The algorithm operates by iteratively selecting the initial values for decision variables of a multi-objective programming problem. The values of objective functions and constraint(s) are calculated. This proposed approach depends on a linear formula to update the solution. An acceptable efficient solution that has a minimum distance value from the utopia point is selected as the best point. To demonstrate the effectiveness of the proposed approach, some illustrative examples are given. These examples include both linear and nonlinear problems. The results indicate that the proposed approach has a high speed and capability to obtain the best solution when compared with other similar works of literature. VL - 6 IS - 1 ER -
Information
Email: