Preprint
Article

This version is not peer-reviewed.

Energy Efficiency Evaluation of Artificial Intelligence Algorithms

A peer-reviewed version of this preprint was published in:
Electronics 2024, 13(19), 3836. https://doi.org/10.3390/electronics13193836

Submitted:

26 June 2024

Posted:

27 June 2024

Read the latest preprint version here

Abstract
This article continues research efforts on performance and energy efficiency of intelligent algorithms and its role for green and sustainable computing. The introduction focusses on Bremermann's Limit and its effect on extensive approach for improvement of computers performance. The article aims to identify role of Intelligent Algorithms energy efficiency, how it differs from general software energy efficiency. An improved empirical investigation on heuristic methods for search and optimisation illustrates algorithms' energy efficiency. Experimental results and consideration of further work conclude the article.
Keywords: 
;  ;  ;  ;  ;  ;  ;  ;  

1. Introduction

Inspired by environmental behaviour euphoria to green technologies logically converges to green computing where major player is software. According to the literature green computing aspects involve optimising hardware and software design, reducing power consumption, using renewable energy sources, improving software efficiency, virtualizing servers, and managing e-waste [1]. Green computing should enhance the performance and energy effectiveness of computational systems by optimising hardware and software. Recent trends and concerns on environment and society regarding well-being, reasonably targeted Responsible Artificial Intelligence (RAI) [2] which accelerated demand for energy efficient intelligent software. [3]
Although “Artificial Intelligence (AI) has the potential to drive towards a future in which all of humanity flourishes” [2] the energy consumption of Information Technologies (IT) including, portable devices, data centres and cloud servers, has been dramatically increasing every year [4], which is reflected on global carbon emissions as identified in published global energy reviews [5,6].
Issues with computing energy efficiency need more deep analysis. According to the publications in fundamental research “There is a maximum rate at which data processing can proceed. This maximum rate applies to all data pro-cessing systems, manmade as well as biological. This conjecture aims stimulate the discussion towards a tightening of concepts in artificial data processing and biological evolution alike. The conjecture is the following:
No data processing system whether artificial or living can process more than (2 ×1047) bits per second per gram of its mass.” [7]
Formulation of these computational limitations is based on fundamental physical principles: “The capacity of any closed information transmission or processing does not exceed mc2/h bits per second, where m is the mass of the system, c the light velocity, h Planck’s constant” [8].
More recent publications stated that: “suggested by H. J. Bremermann in 1962 limit has to be corrected to make it compatible with general relativity. As a result, Bremermann’s limit, proportional to mass M of system, Mc2/h = ~ (M/gram)1047 bits per second, should be replaced by an absolute limit (c5/Gh)1/2= ~ 1043 bits per second, where universal constants c, G, and h are the speed of light, the gravitational constant, and Planck’s constant [9].
Presence of Bremermann’s limit alerts that extensive improvement of computational performance will face insurmountable barrier. Initial indications that computers approaching this barrier are: - increasing need for cooling for extraction of the heat produced from computational systems; - need for extensive growth of electricity sources; - changes of the environmental heat pollution, and impact on the climate which seems irreversible.
A natural solution to cope with limitations could be adapting efficiency similarly to the natural systems and considering two aspects - hardware and software energy efficiency. As far as large computational systems are home of most of AI services including popular OpenAI it is essential to mention that according to [10,11,12], based on the LINPAC Benchmark [13] for the last 20 years Supercomputers hardware energy efficiency is improved more than 200 times. This article focuses on software energy efficiency where is difficult to see such categorical progress, and more specifically on Artificial Intelligence and intelligent algorithms, which are mostly dealing with high volume, largely uncertain, and time dependent data.

2. Materials, Tools and Methods

For the purpose of this study are selected 7 test problems. Criteria for tests selection are:
  • must be scalable for multidimensional format.
  • must be with heterogeneous landscape.
The chosen numerical tests are scalable and form different search spaces. All tests are transformed for maximisation and scaled to 100 parameters.
  • Griewank test is global [43]. Optimal value is 0.
  • Michalewicz test is global test with unknown optimum [44]. Optimal value depends on dimensions number.
  • Norwegian test is global test with unknown optimum [45]. Optimal value depends on dimensions number.
  • Rastrigin test is global [46]. Optimal value is 0.
  • Rosenbrock test is smooth flat test with single solution [47]. Optimal value is 0.
  • Schwefel test is global [48]. Optimal value is 0.
  • Step test introduces plateaus to the topology and the search process cannot rely on local correlation [49]. Optimal value depends on the dimensions number and for variety of dimension is unknown.
For the purpose of this study 3 algorithms are selected:
  • Particle Swarm Optimisation (PSO) [50] – representing the group of swarm algorithms applied to real coded tasks over continues space.
  • Differential Evolution (DE) [51] - heuristic approach for optimising nonlinear and non-differentiable continuous space functions.
  • Free Search (FS) [52] - adaptive heuristic algorithm for search and optimisation within continuous space.
All algorithms are implemented to operate on 10 solutions and limited to 100000 iterations, 320 sequential runs. The aim of the experiment is to measure time and energy required for completion of the defined number of iterations.
For these experiments, a computer system with the following components and settings is used - processor Intel XEON E5 1660 V2 overclocked at 4.750 GHz, running 1 core – 1 thread, Max TDP – 130 W, CPU water cooler, RAM at 2000 MHz, motherboard ASUS P9X79-E WS and solid-state disk - SanDisk Extreme SSD SATA III.
All experiments are completed individually running one single algorithm on a single test function at time.

Methodology

For this study is adopted Green Software Measurement Model proposed in the literature [30], which is adapted according to the nature of the study by control of the following parameters:
  • Duration min
  • Number of iterations integer
  • Mean system power W
  • System Energy W
  • CPU usage %
  • CPU power W
  • CPU cores - 1 core – 1 thread
Application of full Green Software Measurement Model as proposed in [30] could be a subject of further research and availability of necessary resources.
Power is measured for entire system using digital Power Consumption Energy Meter [53]. Power for each algorithm applied to each test is calculating as a difference between the level during the algorithms’ execution and level on standby - running OS components and tools for CPU parameters measurement – CPUZ [54] and CPU cores temperature measurement CoreTemp [55]. SPUZ and CoreTemp are ringing during all experiments in parallels to the algorithms.
Each experiment is limited to 100000 iterations, and the duration is measured by recording start time manually and end time of the experiment is stored as an attribute of the results file. This ensures the time recording has no effects on the performance of the algorithms or the system’s configurations.

3. Results

Experimental results are presented in Table 1, where: Column Test indicates the test function. Column PSO indicates time of experiments achieved by Particle Swarm Optimisation. Column DE indicates time of experiments achieved by Differential Evolution. Column FS indicates time of experiments achieved by Free Search. Time is presented in format hh:mm:ss.
The Mean system power on standby for Task Monitor 0% workload measured on the socket is 166W. CPU power for 1 core – 1 thread measured by CoreTemp is 33.4W and 21.5W.
The Mean system power for Task Monitor 100% workload for all experiments presented in Table 1 is 185W with variation 3% over the time of execution. Reason for this variation may be due to variation in temperature and other environmental factors but, this could be a subject of further research.
CPU power for 1 core – 1 thread measured by CoreTemp is 42.8W and 30.4W.
Presented in Table 1 data indicates variation of time for execution per test and per algorithm.
Analysis of the experimental data suggest that based on the complexity of the search space time for evaluation per test vary. More complex search space needs more time. Based on capabilities of the search algorithms time for search also vary.
Presented on Figure 1 graphic indicates time per test and on Figure 2 per algorithm for completion of 100000 iterations on selected test. Particle Swarm Optimisation needs more time for all tests. Differential Evolution uses medium interval of time over all tests. Free Search completed faster all tests.
Results for Schwefel and Step test on Figure 2 suggest presence of possible specific factors which reflect on the time for exploration.
Within the time of evaluation can be distinguished specific components such as:
  • Time of objective function evaluation in other words this is time for apprehension of the space.
  • Time for algorithm execution in other words this is time for interpretation and assessment of the search space.
  • Time for algorithm decision making in other word this is time for selection and further action.
Energy use presented in Table 2 is based on algorithms energy consumption (difference between measured power for 100% workload during the experiments and 0% workload on standby), multiplied by period of time for completion of the experiment.
Different algorithms can cope with the same task for different periods which lead to different energy use.
Analysis aiming to identify systematic relations between these components summarized of Table 3 identifies general qualitative difference only.
Presented within Table 3 relative difference between time in % in general suggest that DE is faster than PSO on all test, and FS is faster that RSO and DE. The difference highly varies and cannot be identified precise systematic relation per test and per algorithm. Precise quantitative analysis could be subject of further research.

4. Discussion

This section analyses the results, their interpretation from the perspective of previous studies and of the Role of Intelligent Algorithms Energy Efficiency.
Achieved results confirms and in certain extent clarifies published earlier results [27] on intelligent algorithms aimed to study computational limitations, energy consumptions and time. It can be argued that different efficiency is due to software design, implementation and execution which by its own is absolutely correct. However, it should be clarified how different software engineering techniques implement intelligent behaviour.
First little attention will be given to Epistemology [56,57]. Popular models Data-Information Knowledge (DIK) [58] and Data-Information-Knowledge-Wisdom (DIKW) [59] suggest a way in which intelligent beings and systems can cope with apprehension of the surrounding environment is generation and preprocessing data abstracting essential for certain purposes information which can be used and then abstracting from the information knowledge, which could be memorised for further use. This process first reduces the amount of data, which should be stored and second allow much faster processing of known cases and adapting to and processing unknown cases. Both contribute significantly to efficiency and sustainability of intelligent beings. Implementing this process as a software for Intelligent Computing can contribute to the sustainability of Artificial Intelligence Systems.
For amongst the many definitions of knowledge [60,61,62] probably the closest to understanding of software design and implementation is “Knowledge is the perception of the agreement or disagreement of two ideas” [60].
In the cognitive processes understanding the fundamental principles could help significantly to strengthen machine learning efficiency and sustainability of intelligent systems. According to the literature [63] “Knowledge of the external world can be obtained either by intuition or by abstraction”.
Where appropriate understanding of intuition and abstraction could support significant improvement of the process of learning and more precisely formulated in a process of building knowledge. A good interpretation of intuitive and abstractive cognition is formulated by William of Ockham [64].
“Intuitive cognition is defined as an act of apprehension in virtue of which the intellect can evidently judge that the apprehended object exists or does not exist, or that it has or does not have some particular quality or other condition; in short, an intuitive cognition is an act of immediate awareness in virtue of which an evident judgment of contingent fact can be made.
Abstractive cognition is defined as any act of cognition in virtue of which it cannot be evidently known whether the apprehended object exists or does not exist, and in virtue of which an evident contingent judgment cannot be made” [64].
Applying these concepts to the Blackbox model helps the adaptive heuristic algorithm called Free Search to perform fasted amongst heterogenous landscapes and tasks.
Future research could focus on new models and software implementations for machine training, intelligent computing, apprehension of the environment, building actionable knowledge and adaptive behaviour. For simple tasks computational intelligence con-tributes in competition between algorithms and systems. For large complex problems for example where the search space exceeds the range of 101000000 locations, and the time for exploration for space with this size could tend to infinite, intelligent, adaptive behaviour is essential for reducing the time and energy use of the process of search, and a good example is the result available in [28] achieved by Free Search applied to optimisation of a task with 100 000 parameters.

5. Conclusions

In summary this research completed an empirical evaluation and comparison of intelligent and adaptive algorithms time and energy consumption applied to heterogeneous numerical tests. It identified notable difference in energy efficiency and speed when different algorithms are applied to same tasks.
Experimental results illustrate strengths and limitations of used algorithms. Discussion on concepts and their relationship with computational intelligence and possible value for sustaining intelligent systems concludes the article.

Author Contributions

Conceptualization - Kalin Penev & Alexander Gegov; methodology & software & validation - Kalin Penev; formal analysis - Kalin Penev &Femi Isiaq; investigation & resources & data curation - Kalin Penev; writing—original draft preparation Kalin Penev; writing—review and editing - Kalin Penev & Alexander Gegov & Femi Isiaq & Raheleh Jafari. All authors have read and agreed to the published version of the manuscript.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Paul, S.G.; Saha, A.; Arefin, M.S.; Bhuiyan, T.; Biswas, A.A.; Reza, A.W.; Alotaibi, N.M.; Alyami, S.A.; Moni, M.A. A Comprehensive Review of Green Computing: Past, Present, and Future Research. IEEE Access 2023, 11, 87445–87494. [Google Scholar] [CrossRef]
  2. Cheng, L. , Varshney, K. R., Liu, H. Socially responsible AI algorithms: Issues, purposes, and challenges. Journal of Artificial Intelligence Research 2021, 71, 1137–1181. [Google Scholar] [CrossRef]
  3. Lee, S.U.; Fernando, N.; Lee, K.; Schneider, J.-G. A survey of energy concerns for software engineering. J. Syst. Softw. 2024, 210. [Google Scholar] [CrossRef]
  4. Naumann, S.; Dick, M.; Kern, E.; Johann, T. The GREENSOFT Model: A reference model for green and sustainable software and its engineering. Sustain. Comput. Informatics Syst. 2011, 1, 294–304. [Google Scholar] [CrossRef]
  5. Raimi, D.; Zhu, Y.; Newell, R.G.; Prest, B.C. Global Energy Outlook 2024: Peaks or Plateaus? 2024. Available online: https://www.rff.org/publications/reports/global-energy-outlook-2024/ (accessed on 10.06.2024).
  6. IEA, GlobalEnergyReview2021. Available online: https://www.iea.org/reports/global-energy-review-2021 (accessed on 10.06.2024).
  7. Bremermann, H.J. , “Optimization through Evolution and Recombination,” in Self-organizing Systems, M.C. Yovits, G.T. Jacobi and G.D. Goldstein, Eds. Washington, DC: Spartan Books, 1962, pp. 93-106.
  8. Bremermann, H.J. , 1967, January. In Quantum noise and information. In Proceedings of the fifth Berkeley symposium on mathematical statistics and probability (Vol. 4; pp. 15–20.
  9. Gorelik, G. , 2009. Bremermann’s Limit and cGh-physics. arXiv:0910.3424.
  10. Top500A 2024, FRONTIER - HPE CRAY EX235A, AMD OPTIMIZED 3RD GENERATION EPYC 64C 2GHZ, AMD INSTINCT MI250X, SLINGSHOT-11. https://top500.org/system/180047/ Accessed 15.05.2024.
  11. Top500B, 2024, BLUEGENE/L - ESERVER BLUE GENE SOLUTION. https://top500.org/system/174210/, Accessed 15.05.2024.
  12. Top500C, 2024, JEDI - BULLSEQUANA XH3000, GRACE HOPPER SUPERCHIP 72C 3GHZ, NVIDIA GH200 SUPERCHIP, QUAD-RAIL NVIDIA INFINIBAND NDR200 https://top500.org/system/180269/ Accessed 15.05.2024.
  13. Dongarra, J. , 2007, Frequently Asked Questions on the Linpack Benchmark and Top500, available at https://www.netlib.org/utk/people/JackDongarra/faq-linpack.html, Accessed 19.01.2024.
  14. JVA Initiative Committee and Iowa State University, 2011, ATANASOFF BERRY COMPUTER, available at https://jva.cs.iastate.edu/operation.php, Accessed 12.06. 2024.
  15. Freiberger, Paul A. and Swaine, Michael R.. “Atanasoff-Berry Computer”. Encyclopedia Britannica, 20 Mar. 2023. https://www.britannica.com/technology/Atanasoff-Berry-Computer. Accessed 11 June 2024.
  16. Calero, C.; Mancebo, J.; Garcia, F.; Moraga, M.A.; Berna, J.A.G.; Fernandez-Aleman, J.L.; Toval, A. 5Ws of green and sustainable software. Tsinghua Sci. Technol. 2020, 25, 401–414. [Google Scholar] [CrossRef]
  17. Gottschalk, M.; Jelschen, J.; Winter, A. Energy-Efficient Code by Refactoring. Available at: https://dl.gi.de/server/api/core/bitstreams/a42bfb61-43dd-4d5c-9b1d-2c8c2b4ca51f/content, Accessed 12.06.2024.
  18. Şanlıalp, I.; Öztürk, M.M.; Yiğit, T. Energy Efficiency Analysis of Code Refactoring Techniques for Green and Sustainable Software in Portable Devices. Electronics 2022, 11, 442. [Google Scholar] [CrossRef]
  19. Anwar, H.; Pfahl, D.; Srirama, S.N. Evaluating the impact of code smell refactoring on the energy consumption of Android applications. In Proceedings of the 45th Euromicro Conference on Software Engineering and Advanced Applications (SEAA), Kallithea, Greece, 28–30 August 2019. [Google Scholar]
  20. Noman, H.; Mahoto, N.; Bhatti, S.; Rajab, A.; Shaikh, A. Towards sustainable software systems: A software sustainability analysis framework. Inf. Softw. Technol. 2024, 169. [Google Scholar] [CrossRef]
  21. Heldal, R.; Nguyen, N.-T.; Moreira, A.; Lago, P.; Duboc, L.; Betz, S.; Coroamă, V.C.; Penzenstadler, B.; Porras, J.; Capilla, R.; et al. Sustainability competencies and skills in software engineering: An industry perspective. J. Syst. Softw. 2024, 211. [Google Scholar] [CrossRef]
  22. Venters, C.C.; Capilla, R.; Nakagawa, E.Y.; Betz, S.; Penzenstadler, B.; Crick, T.; Brooks, I. Sustainable software engineering: Reflections on advances in research and practice. Inf. Softw. Technol. 2023, 164. [Google Scholar] [CrossRef]
  23. Martínez-Fernández, S.; Franch, X.; Durán, F. Towards green AI-based software systems: an architecture-centric approach (GAISSA). 2023 49th Euromicro Conference on Software Engineering and Advanced Applications (SEAA) 2023. [CrossRef]
  24. Penev, K.; Littlefair, G. Free Search—a comparative analysis. Inf. Sci. 2005, 172, 173–193. [Google Scholar] [CrossRef]
  25. Penev, K. and Gegov, A., 2008. Free Search of real value or how to make computers think. St. Qu.
  26. Vasileva, V. and Penev, K., 2012, September. Free search of global value. In 2012 6th IEEE International Conference Intelligent Systems (pp. 425-430). IEEE.
  27. Penev, K. , Free Search in Multidimensional Space M, 2018, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Lirkov, I. & Margenov, S. (eds.). Switzerland: Springer Nature, Vol. 10665. p. 399-407 9 p.
  28. Penev, K. , 2022, An optimal value for 100 000-dimensional Michalewicz test. Available at: https://pure.solent.ac.uk/files/33733992/100_000_dimensional_Michalewicz_test_2.pdf, Accessed 12.06.2024.
  29. Washizaki, H.; Khomh, F.; Gueheneuc, Y.-G.; Takeuchi, H.; Natori, N.; Doi, T.; Okuda, S. Software-Engineering Design Patterns for Machine Learning Applications. Computer 2022, 55, 30–39. [Google Scholar] [CrossRef]
  30. Guldner, A.; Bender, R.; Calero, C.; Fernando, G.S.; Funke, M.; Gröger, J.; Hilty, L.M.; Hörnschemeyer, J.; Hoffmann, G.-D.; Junger, D.; et al. Development and evaluation of a reference measurement model for assessing the resource and energy efficiency of software products and components—Green Software Measurement Model (GSMM). Futur. Gener. Comput. Syst. 2024, 155, 402–418. [Google Scholar] [CrossRef]
  31. Koedijk, L.; Oprescu, A. Finding Significant Differences in the Energy Consumption when Comparing Programming Languages and Programs. 2022 International Conference on ICT for Sustainability (ICT4S). LOCATION OF CONFERENCE, BulgariaDATE OF CONFERENCE; pp. 1–12.
  32. Wu, C.; Raghavendra, R.; Gupta, U.; Acun, B.; Ardalani, N.; Maeng, K.; Chang, G.; Behram, F.A.; Huang, J.; Bai, C.; Gschwind, M.; Gupta, A.; Ott, M.; Melnikov, A.; Candido, S.; Brooks, D.; Chauhan, G.; Lee, B.; Lee, H.S.; Akyildiz, B.; Balandat, M.; Spisak, J.; Jain, R.; Rabbat, M.; Hazelwood, K.; Ai, F. Sustainable AI: Environmental Implications, Challenges and Opportunities. Available at: https://www.semanticscholar.org/reader/2c6df83795cd5baf3b8c6e2639b85e2df0cee1d0, Accessed 13.06.2024.
  33. Patterson, D.; Gonzalez, J.; Le, Q.; Liang, C.; Munguia, L.; Rothchild, D.; So, D.; Texier, M.; Dean, J. Carbon Emissions and Large Neural Network Training. arXiv:2104.10350, 2021.
  34. EU, “Regulation (EU) 2020/852 of the european parliament and of the council of 18 june 2020 on the establishment of a framework to facilitate sustainable investment, and amending regulation (EU) 2019/2088 (Text with EEA relevance),” Official Journal of the European Communities, vol. 198, pp. 13–43, 2020. Available at: https://eur-lex.europa.eu/legal-content/EN/TXT/PDF/?uri=CELEX:32020R0852&from=EN, Accessed 13.06.2024.
  35. EU, AI Act, 2024. Available at: https://digital-strategy.ec.europa.eu/en/policies/regulatory-framework-ai, Accessed 13.06.2024.
  36. Darwin, C. On the Origin of Species by Means of Natural Selection. New York: D. Appleton and Company, 443 & 445 Broadway. MDCCCLXI. Available at: https://darwin-online.org.uk/converted/pdf/1861_OriginNY_F382.pdf, Accessed 13.06.202.
  37. Pinto, P.; Bispo, J.; Cardoso, J.M.P.; Barbosa, J.G.; Gadioli, D.; Palermo, G.; Martinovic, J.; Golasowski, M.; Slaninova, K.; Cmar, R.; et al. Pegasus: Performance Engineering for Software Applications Targeting HPC Systems. IEEE Trans. Softw. Eng. 2020, 48, 732–754. [Google Scholar] [CrossRef]
  38. GG, 2024, Sorting Algorithms, available at: https://www.geeksforgeeks.org/sorting-algorithms/, Accessed 13.06.2024.
  39. Penev, K. (2018). Free Search in Multidimensional Space M. In: Lirkov, I., Margenov, S. (eds) Large-Scale Scientific Computing. LSSC 2017. Lecture Notes in Computer Science(), vol 10665. Springer, Cham. [CrossRef]
  40. Jain, S.; Saha, A. Improving and comparing performance of machine learning classifiers optimized by swarm intelligent algorithms for code smell detection. Sci. Comput. Program. 2024. [Google Scholar] [CrossRef]
  41. Deng, L. Artificial Intelligence in the Rising Wave of Deep Learning: The Historical Path and Future Outlook [Perspectives]. IEEE Signal Process. Mag. 2018, 35, 180–177. [Google Scholar] [CrossRef]
  42. Hutter, M.; Legg, S. A. 2007. A Collection of Definitions of Intelligence. In Proceedings of the 2007 conference on Advances in Artificial General Intelligence: Concepts, Architectures and Algorithms: Proceedings of the AGI Workshop 2006.. IOS Press, NLD, 17–24. arXiv:0706.3639.
  43. Griewank, A. O. , 1981, “Generalized Decent for Global Optimization.” Journal of Optimization Theory and Applications, 34, pp. 11-39.
  44. Michalewicz, Z. Genetic Algorithms + Data Structures = Evolution Programs. Berlin, Heidelberg, New York: Springer-Verlag, 1992.
  45. Penev, K. (2015). Free Search in Multidimensional Space II. In: Dimov, I., Fidanova, S., Lirkov, I. (eds) Numerical Methods and Applications. NMA 2014. Lecture Notes in Computer Science(), vol 8962. Springer, Cham. [CrossRef]
  46. Mühlenbein, H.; Schomisch, M.; Born, J. The Parallel Genetic Algorithm as Function Optimizer. Parallel Comput. 1991, 17, 619–632. [Google Scholar] [CrossRef]
  47. Rosenbrock, H.H. , 1960, An automate method for finding the greatest or least value of a function. Comput. J. 3 (1960), pp.175-184.
  48. Schwefel, H. P. , 1981, Numerical Optimization of Computer Models. John Wiley & Sons, English translation of Numerische Optimierung von Computer-Modellen mittels der Evolutionsstrategie, 1977.
  49. De Jung K., A. , 1975, An Analysis of the Behaviour of a Class of Genetic Adaptive Systems, PhD Thesis, University of Michigan.
  50. Eberhart, R. , and Kennedy J., 1995, Particle Swarm Optimisation, Proceedings of the 1995 IEEE International Conference on Neural Networks., vol. 4, p.p. (1942-1948). IEEE Press.
  51. Storn, R.; Price, K. Differential Evolution—A Simple and Efficient Heuristic for Global Optimization over Continuous Spaces. J. Glob. Optim. 1997, 11, 341–359. [Google Scholar] [CrossRef]
  52. Penev, K. (2008). Adaptive Heuristic Applied to Large Constraint Optimisation Problem. In: Lirkov, I., Margenov, S., Waśniewski, J. (eds) Large-Scale Scientific Computing. LSSC 2007. Lecture Notes in Computer Science, vol 4818. Springer, Berlin, Heidelberg. [CrossRef]
  53. GMM-DDS108 (KWE-PM01) Digital Power Consumption Energy Meter UK Plug Socket, 2024, Available at: https://testmeter.sg/webshaper/pcm/files/Data%20Sheet/GMM-DDS108-KWE-PM01-UK.pdf, Accessed 17.06.2024.
  54. CUPID, 2024, CPU-Z for Windows® x86/x64, available at: https://www.cpuid.com/softwares/cpu-z.html, Accessed 17.06.2024.
  55. CoreTemp, 2024, Core Temp 1.18.1, available at: https://www.alcpu.com/CoreTemp/, Accessed 17.06.2024.
  56. Stroll, Avrum and Martinich, A.P.. “epistemology”. Encyclopedia Britannica, 19 Apr. 2024, available at: https://www.britannica.com/topic/epistemology. Accessed 18.06.2024.
  57. Steup, Matthias and Ram Neta, “Epistemology”, The Stanford Encyclopedia of Philosophy (Spring 2024 Edition), Edward N. Zalta & Uri Nodelman (eds.), available at: URL = https://plato.stanford.edu/archives/spr2024/entries/epistemology/. Accessed 18.06.2024.
  58. Zins, C. Conceptual approaches for defining data, information, and knowledge. J. Am. Soc. Inf. Sci. Technol. 2007, 58, 479–493. [Google Scholar] [CrossRef]
  59. Rowley, J. The wisdom hierarchy: representations of the DIKW hierarchy. J. Inf. Sci. 2007, 33, 163–180. [Google Scholar] [CrossRef]
  60. Locke, J. , 1689, An Essay Concerning Human Understanding, 1689, ISBN 0-87220-217-8.
  61. Nonaka, I and Takeuchi, H., 1995, The Knowledge – Creating Company How Japanese Companies Create the Dynamics of Information, ISBN 0-19-509269-4.
  62. Davenport, T. , & Prusak, L., 2000, Working Knowledge: how organisations manage what they know, ISBN 0-87584-655-6.
  63. Tommaso Campanella (1568-1639), Encyclopaedia of Philosophy, Macmillan, New York, Vol.2, p. 12.
  64. William of Ockham (1285 – 1349), Encyclopaedia of Philosophy, Macmillan, New York, Vol.8, p. 308.
Figure 1. Tests time comparison per algorithm.
Figure 1. Tests time comparison per algorithm.
Preprints 110444 g001
Figure 2. Algorithms time comparison per test.
Figure 2. Algorithms time comparison per test.
Preprints 110444 g002
Table 1. Time for execution of 100-dimensional version of the tests.
Table 1. Time for execution of 100-dimensional version of the tests.
Test PSO DE FS
Time Time Time
Griewank 01:45:00 00:41:00 00:14:00
Michalewicz 02:44:00 01:46:00 01:02:00
Norwegian 01:50:00 00:47:00 00:12:00
Rastrigin 01:46:00 00:45:00 00:11:00
Rosenbrock 01:39:00 00:40:00 00:05:00
Schwefel 02:44:00 01:03:00 00:27:00
Step 02:37:00 00:42:00 00:06:00
Table 2. Energy use for execution of 100-dimensional version of the tests.
Table 2. Energy use for execution of 100-dimensional version of the tests.
Test PSO DE FS
Wh Wh Wh
Griewank 33.25 12.98 4.43
Michalewicz 51.93 33.57 19.63
Norwegian 34.83 14.88 3.80
Rastrigin 33.57 14.25 3.48
Rosenbrock 31.35 12.67 1.58
Schwefel 51.93 19.95 8.55
Step 49.72 13.30 1.90
Table 3. Relative time difference per test in %.
Table 3. Relative time difference per test in %.
Test DE/PSO FS/PSO FS/DE
% % %
Griewank 39% 13% 34%
Michalewicz 65% 38% 58%
Norwegian 43% 11% 26%
Rastrigin 42% 10% 24%
Rosenbrock 40% 5% 13%
Schwefel 38% 16% 43%
Step 27% 4% 14%
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.
Copyright: This open access article is published under a Creative Commons CC BY 4.0 license, which permit the free download, distribution, and reuse, provided that the author and preprint are cited in any reuse.
Prerpints.org logo

Preprints.org is a free preprint server supported by MDPI in Basel, Switzerland.

Subscribe

Disclaimer

Terms of Use

Privacy Policy

Privacy Settings

© 2026 MDPI (Basel, Switzerland) unless otherwise stated