Methods › General › Stochastic Optimization › HGS
Hunger Games Search
HGS
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
Hunger Games Search (HGS) is a general-purpose population-based optimization technique with a simple structure, special stability features and very competitive performance to realize the solutions of both constrained and unconstrained problems more effectively. 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.
Implementation of the HGS algorithm is available at https://aliasgharheidari.com/HGS.html.
Code snippet in the archive: a link on aliasgharheidari.com (archive link, not checked and not linked: not a code host this site links to).
In Syntology the paper matched by title, arXiv:2512.14352, held, no code (no_code; paper_only). The lookup matched a paper by its title, arXiv:2512.14352, not a method entry. The archive credits no paper with an arXiv id for this method, so whether this answer (about arXiv:2512.14352) is about this method is not checked; it does not say whether this method has code.
Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.
Papers archive 2025-07-28
archive papers tagged: 12 · with a code link: 3 · where Syntology ran a sample: 0 (0 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran: none of the 12 tagged papers has a Syntology run on record
Page 1 of 1: papers 1 to 12 of 12, newest first by the archive's date (ties by slug), in archive order.
Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.
-
Masked Language Models are Good Heterogeneous Graph Generalizers 6 Jun 2025 · 1 repository · arXiv:2506.06157
-
Pushing Rendering Boundaries: Hard Gaussian Splatting 6 Dec 2024 · 0 repositories · arXiv:2412.04826
-
Few-Shot Causal Representation Learning for Out-of-Distribution Generalization on Heterogeneous Graphs 7 Jan 2024 · 0 repositories · arXiv:2401.03597
-
Cross-heterogeneity Graph Few-shot Learning 10 Aug 2023 · 0 repositories · arXiv:2308.05275
-
Hybrid Genetic Search for Dynamic Vehicle Routing with Time Windows 21 Jul 2023 · 0 repositories · arXiv:2307.11800
-
Homophily-oriented Heterogeneous Graph Rewiring 13 Feb 2023 · 0 repositories · arXiv:2302.06299
-
PAC learning and stabilizing Hedonic Games: towards a unifying approach 31 Jan 2023 · 0 repositories · arXiv:2301.13756
-
Neural Networks for Local Search and Crossover in Vehicle Routing: A Possible Overkill? 9 Sep 2022 · 0 repositories · arXiv:2210.12075
-
Zero-shot Transfer Learning within a Heterogeneous Graph via Knowledge Transfer Networks 3 Mar 2022 · 1 repository · arXiv:2203.02018
-
Structure-Aware Hard Negative Mining for Heterogeneous Graph Contrastive Learning 31 Aug 2021 · 0 repositories · arXiv:2108.13886
-
Hybrid Genetic Search for the CVRP: Open-Source Implementation and SWAP* Neighborhood 23 Nov 2020 · 2 repositories · arXiv:2012.10384
-
Are mouse and cat the missing link in the COVID-19 outbreaks in seafood markets? 18 Sep 2020 · 0 repositories · arXiv:2009.09911
Tasks archive 2025-07-28
19 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.
Usage over time archive 2025-07-28
Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).
Categories archive 2025-07-28
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections