{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,25]],"date-time":"2026-01-25T04:10:50Z","timestamp":1769314250963,"version":"3.49.0"},"reference-count":70,"publisher":"MDPI AG","issue":"9","license":[{"start":{"date-parts":[[2022,9,19]],"date-time":"2022-09-19T00:00:00Z","timestamp":1663545600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"King Saud University","award":["RSP-2021\/305"],"award-info":[{"award-number":["RSP-2021\/305"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Axioms"],"abstract":"<jats:p>In this paper, a new Modified Meta-Heuristic algorithm is proposed. This method contains some modifications to improve the performance of the simulated-annealing algorithm (SA). Most authors who deal with improving the SA algorithm presented some improvements and modifications to one or more of the five standard features of the SA algorithm. In this paper, we improve the SA algorithm by presenting some suggestions and modifications to all five standard features of the SA algorithm. Through these suggestions and modifications, we obtained a new algorithm that finds the approximate solution to the global minimum of a non-convex function. The new algorithm contains novel parameters, which are updated at each iteration. Therefore, the variety and alternatives in choosing these parameters demonstrated a noticeable impact on the performance of the proposed algorithm. Furthermore, it has multiple formulas by which the candidate solutions are generated. Diversity in these formulas helped the proposed algorithm to escape a local point while finding the global minimizer of a non-convex function. The efficiency of the proposed algorithm is reported through extensive numerical experiments on some well-known test problems. The performance profiles are used to evaluate and compare the performance of our proposed algorithm against the other five meta-heuristic algorithms. The comparison results between the performance of our suggested algorithm and the other five algorithms indicate that the proposed algorithm is competitive with, and in all cases superior to, the five algorithms in terms of the efficiency, reliability, and effectiveness for finding the global minimizers of non-convex functions. This superiority of the new proposed algorithm is due to those five modified standard features.<\/jats:p>","DOI":"10.3390\/axioms11090483","type":"journal-article","created":{"date-parts":[[2022,9,19]],"date-time":"2022-09-19T21:47:27Z","timestamp":1663624047000},"page":"483","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Efficient Modified Meta-Heuristic Technique for Unconstrained Optimization Problems"],"prefix":"10.3390","volume":"11","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5760-0216","authenticated-orcid":false,"given":"Khalid Abdulaziz","family":"Alnowibet","sequence":"first","affiliation":[{"name":"Statistics and Operations Research Department, College of Science, King Saud University, P.O. Box 2455, Riyadh 11451, Saudi Arabia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7103-8872","authenticated-orcid":false,"given":"Ahmad M.","family":"Alshamrani","sequence":"additional","affiliation":[{"name":"Statistics and Operations Research Department, College of Science, King Saud University, P.O. Box 2455, Riyadh 11451, Saudi Arabia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4492-1082","authenticated-orcid":false,"given":"Adel Fahad","family":"Alrasheedi","sequence":"additional","affiliation":[{"name":"Statistics and Operations Research Department, College of Science, King Saud University, P.O. Box 2455, Riyadh 11451, Saudi Arabia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3133-4228","authenticated-orcid":false,"given":"Salem","family":"Mahdi","sequence":"additional","affiliation":[{"name":"Department of Mathematics & Computer Science, Faculty of Science, Alexandria University, Alexandria 21544, Egypt"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9634-6046","authenticated-orcid":false,"given":"Mahmoud","family":"El-Alem","sequence":"additional","affiliation":[{"name":"Department of Mathematics & Computer Science, Faculty of Science, Alexandria University, Alexandria 21544, Egypt"}]},{"given":"Abdallah","family":"Aboutahoun","sequence":"additional","affiliation":[{"name":"Department of Mathematics & Computer Science, Faculty of Science, Alexandria University, Alexandria 21544, Egypt"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5895-2632","authenticated-orcid":false,"given":"Ali Wagdy","family":"Mohamed","sequence":"additional","affiliation":[{"name":"Perations Research Department, Faculty of Graduate Studies for Statistical Research, Cairo University, Giza 12613, Egypt"}]}],"member":"1968","published-online":{"date-parts":[[2022,9,19]]},"reference":[{"key":"ref_1","first-page":"10","article-title":"A Hybrid Flower Pollination Algorithm for Engineering Optimization Problems","volume":"140","author":"Hezam","year":"2016","journal-title":"Int. J. Comput. Appl."},{"key":"ref_2","doi-asserted-by":"crossref","first-page":"5989","DOI":"10.1007\/s00521-020-05375-8","article-title":"A novel binary gaining\u2013sharing knowledge-based optimization algorithm for feature selection","volume":"33","author":"Agrawal","year":"2021","journal-title":"Neural Comput. Appl."},{"key":"ref_3","doi-asserted-by":"crossref","unstructured":"Ayumi, V., Rere, L., Fanany, M.I., and Arymurthy, A.M. (2016). Optimization of Convolutional Neural Network using Microcanonical Annealing Algorithm. arXiv.","DOI":"10.1109\/ICACSIS.2016.7872787"},{"key":"ref_4","doi-asserted-by":"crossref","first-page":"143","DOI":"10.1590\/S1679-78252014000100009","article-title":"Fish swarm optimization algorithm applied to engineering system design","volume":"11","author":"Lobato","year":"2014","journal-title":"Lat. Am. J. Solids Struct."},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"1263","DOI":"10.1016\/j.engappai.2013.02.002","article-title":"Particle swarm optimization for solving engineering problems: A new constraint-handling mechanism","volume":"26","author":"Mazhoud","year":"2013","journal-title":"Eng. Appl. Artif. Intell."},{"key":"ref_6","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/j.ins.2012.01.008","article-title":"Constrained optimization based on modified differential evolution algorithm","volume":"194","author":"Mohamed","year":"2012","journal-title":"Inf. Sci."},{"key":"ref_7","doi-asserted-by":"crossref","first-page":"1501","DOI":"10.1007\/s13042-019-01053-x","article-title":"Gaining-sharing knowledge based algorithm for solving optimization problems: A novel nature-inspired algorithm","volume":"11","author":"Mohamed","year":"2020","journal-title":"Int. J. Mach. Learn. Cybern."},{"key":"ref_8","doi-asserted-by":"crossref","unstructured":"Rere, L., Fanany, M.I., and Arymurthy, A.M. (2016). Metaheuristic Algorithms for Convolution Neural Network. Comput. Intell. Neurosci., 2016.","DOI":"10.1155\/2016\/1537325"},{"key":"ref_9","doi-asserted-by":"crossref","first-page":"1533","DOI":"10.1007\/s11269-016-1238-5","article-title":"Simulated annealing in optimization of energy production in a water supply network","volume":"30","author":"Samora","year":"2016","journal-title":"WAter Resour. Manag."},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Shao, Y. (2021). Dynamics of an Impulsive Stochastic Predator\u2013Prey System with the Beddington\u2013DeAngelis Functional Response. Axioms, 10.","DOI":"10.3390\/axioms10040323"},{"key":"ref_11","doi-asserted-by":"crossref","unstructured":"Vallepuga-Espinosa, J., Cifuentes-Rodr\u00edguez, J., Guti\u00e9rrez-Posada, V., and Ubero-Mart\u00ednez, I. (2022). Thermomechanical Optimization of Three-Dimensional Low Heat Generation Microelectronic Packaging Using the Boundary Element Method. Mathematics, 10.","DOI":"10.3390\/math10111913"},{"key":"ref_12","doi-asserted-by":"crossref","unstructured":"Dennis, J.E., and Schnabel, R.B. (1996). Numerical Methods for Unconstrained Optimization and Nonlinear Equations, Society for Industrial and Applied Mathematics.","DOI":"10.1137\/1.9781611971200"},{"key":"ref_13","first-page":"147","article-title":"An unconstrained optimization test functions collection","volume":"10","author":"Andrei","year":"2008","journal-title":"Adv. Model. Optim"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"527","DOI":"10.1016\/j.ejor.2006.06.034","article-title":"A hybrid simplex search and particle swarm optimization for unconstrained optimization","volume":"181","author":"Fan","year":"2007","journal-title":"Eur. J. Oper. Res."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"891","DOI":"10.1080\/1055678021000030084","article-title":"Hybrid simulated annealing and direct search method for nonlinear unconstrained global optimization","volume":"17","author":"Hedar","year":"2002","journal-title":"Optim. Methods Softw."},{"key":"ref_16","doi-asserted-by":"crossref","first-page":"1273","DOI":"10.1007\/s10845-020-01691-x","article-title":"An innovative hybrid algorithm for bound-unconstrained optimization problems and applications","volume":"33","author":"Parouha","year":"2022","journal-title":"J. Intell. Manuf."},{"key":"ref_17","doi-asserted-by":"crossref","unstructured":"Wu, J.Y. (2013). Solving unconstrained global optimization problems via hybrid swarm intelligence approaches. Math. Probl. Eng., 2013.","DOI":"10.1155\/2013\/256180"},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1145\/937503.937505","article-title":"Metaheuristics in combinatorial optimization: Overview and conceptual comparison","volume":"35","author":"Blum","year":"2003","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"ref_19","unstructured":"Nocedal, J., and Wright, S. (2006). Numerical Optimization, Springer Science & Business Media."},{"key":"ref_20","unstructured":"Aarts, E., and Korst, J. (1989). Simulated Annealing and Boltzmann Machines: A Stochastic Approach to Combinatorial Optimization and Neural Computing, John Wiley & Sons, Inc."},{"key":"ref_21","unstructured":"Hillier, F.S., and Price, C.C. (2001). International Series in Operations Research &amp, Management Science; Springer."},{"key":"ref_22","unstructured":"Laarhoven, P.J.V., and Aarts, E.H. (1987). Simulated Annealing: Theory and Applications, Springer-Science ++ Business Media, B.V."},{"key":"ref_23","first-page":"7","article-title":"Stochastic methods for global optimization","volume":"4","author":"Kan","year":"1984","journal-title":"Am. J. Math. Manag. Sci."},{"key":"ref_24","unstructured":"Ali, M. (1994). Some Modified Stochastic Global Optimization Algorithms with Applications. [Ph.D. Thesis, University of the Witwatersrand]."},{"key":"ref_25","first-page":"296","article-title":"Heuristic and meta-heuristic algorithms and their relevance to the real world: A survey","volume":"2","author":"Desale","year":"2015","journal-title":"Int. J. Comp. Eng. Res. Trends"},{"key":"ref_26","doi-asserted-by":"crossref","unstructured":"Alshamrani, A.M., Alrasheedi, A.F., Alnowibet, K.A., Mahdi, S., and Mohamed, A.W. (2022). A Hybrid Stochastic Deterministic Algorithm for Solving Unconstrained Optimization Problems. Mathematics, 10.","DOI":"10.3390\/math10173032"},{"key":"ref_27","first-page":"2784","article-title":"An Elitist Simulated Annealing Algorithm for Solving Multi Objective Optimization Problems in Internet of Things Design","volume":"7","author":"Chakraborti","year":"2015","journal-title":"Int. J. Adv. Netw. Appl."},{"key":"ref_28","doi-asserted-by":"crossref","unstructured":"Gonzales, G.V., dos Santos, E.D., Emmendorfer, L.R., Isoldi, L.A., Rocha, L.A.O., and Estrada, E.d.S.D. (2015). A Comparative Study of Simulated Annealing with different Cooling Schedules for Geometric Optimization of a Heat Transfer Problem According to Constructal Design. Sci. Plena, 11.","DOI":"10.14808\/sci.plena.2015.081321"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"216","DOI":"10.7763\/IJET.2016.V6.888","article-title":"A Comparison between Genetic Algorithms and Simulated Annealing for Minimizing Transfer Waiting Time in Transit Systems","volume":"8","author":"Poorjafari","year":"2016","journal-title":"Int. J. Eng. Technol."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1145\/29380.29864","article-title":"Minimizing multimodal functions of continuous variables with the simulated annealing algorithm","volume":"13","author":"Corona","year":"1987","journal-title":"ACM Trans. Math. Softw."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"367","DOI":"10.1007\/BF01594945","article-title":"Global optimization and simulated annealing","volume":"50","author":"Dekkers","year":"1991","journal-title":"Math. Program."},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"1087","DOI":"10.1063\/1.1699114","article-title":"Equation of state calculations by fast computer machines","volume":"21","author":"Metropolis","year":"1953","journal-title":"J. Chem. Phys"},{"key":"ref_33","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1126\/science.220.4598.671","article-title":"Optimization by simulated annealing","volume":"220","author":"Kirkpatrick","year":"1983","journal-title":"Science"},{"key":"ref_34","doi-asserted-by":"crossref","first-page":"259","DOI":"10.1016\/0021-9991(84)90095-0","article-title":"A Monte Carlo simulated-annealing algorithm approach to optimization over continuous variables","volume":"56","author":"Vanderbilt","year":"1984","journal-title":"J. Comput. Phys."},{"key":"ref_35","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1080\/00401706.1986.10488128","article-title":"Generalized simulated annealing for function optimization","volume":"28","author":"Bohachevsky","year":"1986","journal-title":"Technometrics"},{"key":"ref_36","doi-asserted-by":"crossref","first-page":"657","DOI":"10.2307\/3214097","article-title":"Simulated annealing methods with general acceptance probabilities","volume":"24","author":"Anily","year":"1987","journal-title":"J. Appl. Probab."},{"key":"ref_37","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1016\/0895-7177(93)90204-C","article-title":"Simulated Annealing: Practice versus Theory","volume":"18","author":"Ingber","year":"1993","journal-title":"Mathl. Comput. Model."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1214\/ss\/1177011077","article-title":"Simulated annealing","volume":"8","author":"Bertsimas","year":"1993","journal-title":"Stat. Sci."},{"key":"ref_39","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1016\/0304-4076(94)90038-8","article-title":"Global optimization of statistical functions with simulated-annealing algorithm","volume":"60","author":"Goffe","year":"1994","journal-title":"J. Econom."},{"key":"ref_40","doi-asserted-by":"crossref","first-page":"395","DOI":"10.1016\/S0378-4371(96)00271-3","article-title":"Generalized Simulated Annealing","volume":"233","author":"Tsallis","year":"1996","journal-title":"Physica A"},{"key":"ref_41","doi-asserted-by":"crossref","first-page":"209","DOI":"10.1145\/264029.264043","article-title":"Enhanced Simulated-Annealing Algorithm for Globally Minimizing Functions of Many Continuous Variables","volume":"23","author":"Siarry","year":"1997","journal-title":"ACM Trans. Math. Softw."},{"key":"ref_42","doi-asserted-by":"crossref","first-page":"8373","DOI":"10.1088\/0305-4470\/31\/41\/011","article-title":"A comparison of simulated-annealing algorithm cooling strategies","volume":"31","author":"Nouraniy","year":"1998","journal-title":"J. Phys. A Math. Gen"},{"key":"ref_43","doi-asserted-by":"crossref","first-page":"1004","DOI":"10.1109\/20.877611","article-title":"A self-learning simulated-annealing for global optimizations of electromagnetic devices","volume":"36","author":"Yang","year":"2000","journal-title":"IEEE Trans. Magn."},{"key":"ref_44","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/S0305-0548(00)00064-2","article-title":"A direct search variant of the simulated-annealing for optimization involving continuous variables","volume":"29","author":"Ali","year":"2002","journal-title":"Comput. Oper. Res."},{"key":"ref_45","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1016\/S0377-2217(02)00761-0","article-title":"A new efficient simulated annealing algorithm for the resource-constrained project scheduling problem and its multiple mode version","volume":"149","author":"Bouleimen","year":"2003","journal-title":"Eur. J. Oper. Res."},{"key":"ref_46","doi-asserted-by":"crossref","first-page":"2661","DOI":"10.1016\/j.cam.2009.11.013","article-title":"A simulated annealing driven multi-start algorithm for bound constrained global optimization","volume":"233","author":"Ali","year":"2010","journal-title":"J. Comput. Appl. Math."},{"key":"ref_47","unstructured":"Wang, G.G., Guo, L., Gandomi, A.H., Alavi, A.H., and Duan, H. Simulated annealing-based krill herd algorithm for global optimization. Proceedings of the Abstract and Applied Analysis."},{"key":"ref_48","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/j.procs.2015.12.114","article-title":"Simulated annealing algorithm for deep learning","volume":"72","author":"Rere","year":"2015","journal-title":"Procedia Comput. Sci."},{"key":"ref_49","doi-asserted-by":"crossref","first-page":"370","DOI":"10.3844\/ajassp.2015.370.381","article-title":"A New Innovative Cooling Law for Simulated Annealing Algorithms","volume":"12","author":"Certa","year":"2015","journal-title":"Am. J. Appl. Sci."},{"key":"ref_50","first-page":"677","article-title":"Application of Hybrid Genetic Algorithm Based on Simulated Annealing in Function Optimization","volume":"9","author":"Xu","year":"2015","journal-title":"World Acad. Sci. Eng. Technol. Int. J. Math. Comput. Phys. Electr. Comput. Eng."},{"key":"ref_51","first-page":"47","article-title":"Simulated Annealing Optimization Bat Algorithm in Service Migration Joining the Gauss Perturbation","volume":"8","author":"Guodong","year":"2015","journal-title":"Int. J. Hybrid Inf. Technol."},{"key":"ref_52","doi-asserted-by":"crossref","unstructured":"Sirisumrannukul, S. (2010). Network reconfiguration for reliability worth enhancement in distribution system by simulated annealing. Simulated Annealing, Theory with Applications, InTech Open.","DOI":"10.5772\/10033"},{"key":"ref_53","doi-asserted-by":"crossref","unstructured":"Fradkin, E. (2013). Field Theories of Condensed Matter Physics, Cambridge University Press.","DOI":"10.1017\/CBO9781139015509"},{"key":"ref_54","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/BF02787825","article-title":"Entropy structure","volume":"96","author":"Downarowicz","year":"2005","journal-title":"J. d\u2019Analyse Math."},{"key":"ref_55","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/S0370-1573(98)00082-9","article-title":"The physics and mathematics of the second law of thermodynamics","volume":"310","author":"Lieb","year":"1999","journal-title":"Phys. Rep."},{"key":"ref_56","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1023\/A:1009595020696","article-title":"Dynamical entropy for Markov operators","volume":"6","author":"Makarov","year":"2000","journal-title":"J. Dyn. Control. Syst."},{"key":"ref_57","doi-asserted-by":"crossref","unstructured":"Debenedetti, P.G. (1996). Metastable Liquids: Concepts and Principles, Princeton University Press.","DOI":"10.1515\/9780691213941"},{"key":"ref_58","unstructured":"Contributors, W. (2018). Metastability."},{"key":"ref_59","doi-asserted-by":"crossref","first-page":"82","DOI":"10.1016\/j.ins.2013.02.041","article-title":"A survey on optimization metaheuristics","volume":"237","author":"Lepagnot","year":"2013","journal-title":"Inf. Sci."},{"key":"ref_60","doi-asserted-by":"crossref","unstructured":"Yang, W.Y., Cao, W., Chung, T.S., and Morris, J. (2005). Applied Numerical Methods Using MATLAB, Wiley.","DOI":"10.1002\/0471705195"},{"key":"ref_61","doi-asserted-by":"crossref","first-page":"63","DOI":"10.1007\/s00158-001-0166-y","article-title":"A genetic algorithm with real-value coding to optimize multimodal continuous functions","volume":"23","author":"Bessaou","year":"2001","journal-title":"Struct. Multidisc Optim."},{"key":"ref_62","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0377-2217(99)00255-6","article-title":"Tabu search applied to global optimization","volume":"123","author":"Chelouah","year":"2000","journal-title":"Eur. J. Oper. Res."},{"key":"ref_63","first-page":"2988","article-title":"Enhancing PSO methods for global optimization","volume":"216","author":"Tsoulos","year":"2010","journal-title":"Appl. Math. Comput."},{"key":"ref_64","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1007\/s10898-016-0485-6","article-title":"Global optimization based on bisection of rectangles, function values at diagonals, and a set of Lipschitz constants","volume":"71","author":"Chiter","year":"2018","journal-title":"J. Glob. Optim."},{"key":"ref_65","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1007\/s10898-004-9972-2","article-title":"A numerical evaluation of several stochastic algorithms on selected continuous global optimization test problems","volume":"31","author":"Ali","year":"2005","journal-title":"J. Glob. Optim."},{"key":"ref_66","doi-asserted-by":"crossref","first-page":"336","DOI":"10.3390\/a8020336","article-title":"MAKHA-A New Hybrid Swarm Intelligence Global Optimization Algorithm","volume":"8","author":"Khalil","year":"2015","journal-title":"Algorithms"},{"key":"ref_67","doi-asserted-by":"crossref","unstructured":"Barbosa, H.J., Bernardino, H.S., and Barreto, A.M. (2010, January 18\u201323). Using performance profiles to analyze the results of the 2006 CEC constrained optimization competition. Proceedings of the IEEE Congress on Evolutionary Computation, Barcelona, Spain.","DOI":"10.1109\/CEC.2010.5586105"},{"key":"ref_68","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/s101070100263","article-title":"Benchmarking optimization software with performance profiles","volume":"91","author":"Dolan","year":"2002","journal-title":"Math. Program."},{"key":"ref_69","doi-asserted-by":"crossref","first-page":"172","DOI":"10.1137\/080724083","article-title":"Benchmarking derivative-free optimization algorithms","volume":"20","author":"Wild","year":"2009","journal-title":"SIAM J. Optim."},{"key":"ref_70","doi-asserted-by":"crossref","first-page":"197","DOI":"10.1007\/s10898-007-9133-5","article-title":"A particle swarm pattern search method for bound constrained global optimization","volume":"39","author":"Vaz","year":"2007","journal-title":"J. Glob. Optim."}],"container-title":["Axioms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/2075-1680\/11\/9\/483\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,11]],"date-time":"2025-10-11T00:34:25Z","timestamp":1760142865000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/2075-1680\/11\/9\/483"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,9,19]]},"references-count":70,"journal-issue":{"issue":"9","published-online":{"date-parts":[[2022,9]]}},"alternative-id":["axioms11090483"],"URL":"https:\/\/doi.org\/10.3390\/axioms11090483","relation":{},"ISSN":["2075-1680"],"issn-type":[{"value":"2075-1680","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022,9,19]]}}}