Skip to content

Visit: https://aliasgharheidari.com/HGS.html. HGS optimizer is a population-based method with stochastic switching elements that enrich its main exploratory and exploitative behaviors and flexibility of HGS in dealing with challenging problem landscapes. The algorithm has been compared to LSHADE, SPS_L_SHADE_EIG, LSHADE_cnEpSi, SHADE, SADE, MPED…

License

Notifications You must be signed in to change notification settings

aliasgharheidaricom/Hunger-Games-Search-Visions-Conception-Implementation-Deep-Analysis-and-Performance-Shifts

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

8 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Hunger Games Search: Visions, Conception, Implementation, Deep Analysis, Perspectives, and Towards Performance Shifts

Visit for all files: https://aliasgharheidari.com/HGS.html.

A recent set of overused population-based methods have been published in recent years. Despite their popularity, as a result of manipulated systematic internet marketing, product bundling, and advertising techniques, most of them have uncertain, immature performance, partially done verifications, similar overused metaphors, similar immature exploration and exploitation components and operations, and an insecure tradeoff between exploration and exploitation trends in most of the new real-world cases. Therefore, all users need to extensively modify and adjust their operations based on main evolutionary methods to reach faster convergence, more stable balance, and high-quality results. To move the optimization community one step ahead toward more focus on performance rather than change of metaphor, a general-purpose population-based optimization technique called Hunger Games Search (HGS) is proposed in this research with a simple structure, special stability features and very competitive performance to realize the solutions of both constrained and unconstrained problems more effectively. The proposed HGS is designed according to the hunger-driven activities and behavioural choice of animals. This dynamic, fitness-wise search method follows a simple concept of “Hunger” as the most crucial homeostatic motivation and reason for behaviours, decisions, and actions in the life of all animals to make the process of optimization more understandable and consistent for new users and decision-makers. The Hunger Games Search incorporates the concept of hunger into the feature process; in other words, an adaptive weight based on the concept of hunger is designed and employed to simulate the effect of hunger on each search step. It follows the computationally logical rules (games) utilized by almost all animals and these rival activities and games are often adaptive evolutionary by securing higher chances of survival and food acquisition. This method's main feature is its dynamic nature, simple structure, and high performance in terms of convergence and acceptable quality of solutions, proving to be more efficient than the current optimization methods. The effectiveness of HGS was verified by comparing HGS with a comprehensive set of popular and advanced algorithms on 23 well-known optimization functions and the IEEE CEC 2014 benchmark test suite. Also, the HGS was applied to several engineering problems to demonstrate its applicability. The results validate the effectiveness of the proposed optimizer compared to popular essential optimizers, several advanced variants of the existing methods, and several CEC winners and powerful differential evolution (DE)-based methods abbreviated as LSHADE, SPS_L_SHADE_EIG, LSHADE_cnEpSi, SHADE, SADE, MPEDE, and JDE methods in handling many single-objective problems. We designed this open-source population-based method to be a standard tool for optimization in different areas of artificial intelligence and machine learning with several new exploratory and exploitative features, high performance, and high optimization capacity. The method is very flexible and scalable to be extended to fit more form of optimization cases in both structural aspects and application sides. This paper's source codes, supplementary files, Latex and office source files, sources of plots, a brief version and pseudocode, and an open-source software toolkit for solving optimization problems with Hunger Games Search and online web service for any question, feedback, suggestion, and idea on HGS algorithm will be available to the public at https://aliasgharheidari.com/HGS.html.


Hunger Games Search (HGS) Visions, Conception, Implementation, Deep Analysis, Perspectives, and Towards Performance Shifts Website of HGS: http://www.aliasgharheidari.com/HGS.html


Yutao Yang and Professor Huiling Chen (citations above 7000) and Ali Asghar Heidari (citations above 4000) College of Computer Science and Artificial Intelligence, Wenzhou University, Wenzhou, Zhejiang 325035, China Exceptionally Talented Researcher, Department of Computer Science, School of Computing, National University of Singapore, Singapore National Elite, Exceptionally Talented Researcher, School of Surveying and Geospatial Engineering, College of Engineering, University of Tehran, Tehran 1439957131, Iran

Thanks to Professor Amir H Gandomi (citations above 19000) Faculty of Engineering & Information Technology, University of Technology Sydney, NSW 2007, Australia

Last update: 02-17-2021


E-Mail for cooperations and developments: [email protected], [email protected]

Developers: Yutao Yang, Huiling Chen, Ali Asghar Heidari, Amir H Gandomi

After use, please refer to the main paper: Yang, Y., Chen, H., Heidari, A. A., & Gandomi, A. H. (2021). Hunger Games Search: Visions, Conception, Implementation, Deep Analysis, Perspectives, and Towards Performance Shifts. Expert Systems with Applications, 114864. Elsevier BV. Retrieved from https://doi.org/10.1016%2Fj.eswa.2021.114864

Yutao Yang, Huiling Chen, Ali Asghar Heidari, Amir H Gandomi, Hunger Games Search: Visions, Conception, Implementation, Deep Analysis, Perspectives, and Towards Performance Shifts Expert Systems With Applications, https://doi.org/10.1016/j.eswa.2021.114864 (Q1, 5-Year Impact Factor: 5.448, H-INDEX: 184)

Researchgate: https://www.researchgate.net/profile/Ali_Asghar_Heidari Website of HGS: http://www.aliasgharheidari.com/HGS.html

You can also use and compare with our other new optimization methods: (HHO)-2019- http://www.aliasgharheidari.com/HHO.html (SMA)-2020- http://www.aliasgharheidari.com/SMA.htm

About

Visit: https://aliasgharheidari.com/HGS.html. HGS optimizer is a population-based method with stochastic switching elements that enrich its main exploratory and exploitative behaviors and flexibility of HGS in dealing with challenging problem landscapes. The algorithm has been compared to LSHADE, SPS_L_SHADE_EIG, LSHADE_cnEpSi, SHADE, SADE, MPED…

Topics

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages