{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/method/hunger-games-search-hgs","slug":"hunger-games-search-hgs","name":"HGS","full_name":"Hunger Games Search","full_name_withheld":false,"description_markdown":"**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. \r\n\r\nImplementation of the HGS algorithm is available at [https://aliasgharheidari.com/HGS.html](https://aliasgharheidari.com/HGS.html).","description_state":"present","introduced_year":null,"introduced_by":{"title":null,"paper":null,"first_author":null,"n_authors":0,"url_abs":null,"archive_paper_url":null},"source":{"url":null,"title":null,"url_on_a_paper_host":false},"code_snippet_url":"https://aliasgharheidari.com/HGS.html","code_snippet_url_on_a_code_host":false,"categories":[{"area":"General","area_id":"general","collection":"Stochastic Optimization","url":"/methods/category/stochastic-optimization","pwc_aliases":[]},{"area":"General","area_id":"general","collection":"Optimization","url":"/methods/category/optimization","pwc_aliases":[]}],"n_papers_tagged":12,"archive_num_papers":12,"papers_newest_first":[{"paper":"/paper/masked-language-models-are-good-heterogeneous","slug":"masked-language-models-are-good-heterogeneous","title":"Masked Language Models are Good Heterogeneous Graph Generalizers","date":"2025-06-06","arxiv_id":"2506.06157","n_code_links":1,"syntology":null},{"paper":null,"slug":"pushing-rendering-boundaries-hard-gaussian","title":"Pushing Rendering Boundaries: Hard Gaussian Splatting","date":"2024-12-06","arxiv_id":"2412.04826","n_code_links":0,"syntology":null},{"paper":null,"slug":"few-shot-causal-representation-learning-for","title":"Few-Shot Causal Representation Learning for Out-of-Distribution Generalization on Heterogeneous Graphs","date":"2024-01-07","arxiv_id":"2401.03597","n_code_links":0,"syntology":null},{"paper":null,"slug":"cross-heterogeneity-graph-few-shot-learning","title":"Cross-heterogeneity Graph Few-shot Learning","date":"2023-08-10","arxiv_id":"2308.05275","n_code_links":0,"syntology":null},{"paper":null,"slug":"adapting-hybrid-genetic-search-for-dynamic","title":"Hybrid Genetic Search for Dynamic Vehicle Routing with Time Windows","date":"2023-07-21","arxiv_id":"2307.11800","n_code_links":0,"syntology":null},{"paper":null,"slug":"homophily-oriented-heterogeneous-graph","title":"Homophily-oriented Heterogeneous Graph Rewiring","date":"2023-02-13","arxiv_id":"2302.06299","n_code_links":0,"syntology":null},{"paper":null,"slug":"pac-learning-and-stabilizing-hedonic-games","title":"PAC learning and stabilizing Hedonic Games: towards a unifying approach","date":"2023-01-31","arxiv_id":"2301.13756","n_code_links":0,"syntology":null},{"paper":null,"slug":"neural-networks-for-local-search-and","title":"Neural Networks for Local Search and Crossover in Vehicle Routing: A Possible Overkill?","date":"2022-09-09","arxiv_id":"2210.12075","n_code_links":0,"syntology":null},{"paper":"/paper/zero-shot-domain-adaptation-of-heterogeneous","slug":"zero-shot-domain-adaptation-of-heterogeneous","title":"Zero-shot Transfer Learning within a Heterogeneous Graph via Knowledge Transfer Networks","date":"2022-03-03","arxiv_id":"2203.02018","n_code_links":1,"syntology":null},{"paper":null,"slug":"structure-aware-hard-negative-mining-for","title":"Structure-Aware Hard Negative Mining for Heterogeneous Graph Contrastive Learning","date":"2021-08-31","arxiv_id":"2108.13886","n_code_links":0,"syntology":null},{"paper":"/paper/hybrid-genetic-search-for-the-cvrp-open","slug":"hybrid-genetic-search-for-the-cvrp-open","title":"Hybrid Genetic Search for the CVRP: Open-Source Implementation and SWAP* Neighborhood","date":"2020-11-23","arxiv_id":"2012.10384","n_code_links":2,"syntology":null},{"paper":null,"slug":"are-mouse-and-cat-the-missing-link-in-the","title":"Are mouse and cat the missing link in the COVID-19 outbreaks in seafood markets?","date":"2020-09-18","arxiv_id":"2009.09911","n_code_links":0,"syntology":null}],"papers_shown":12,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":12,"with_a_code_link":3,"where_syntology_ran_a_sample":0,"not_listed_spam_title":0,"listed":12,"listed_where_code_ran":0,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":0,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":0,"listed_every_run_a_failure_of_syntologys_instrument":0,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":0,"papers_where_code_ran_first_page":null,"papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[],"tasks":[{"task":"/task/graph-neural-network","name":"Graph Neural Network","papers":3},{"task":"/task/combinatorial-optimization","name":"Combinatorial Optimization","papers":2},{"task":"/task/few-shot-learning","name":"Few-Shot Learning","papers":2},{"task":"/task/graph-learning","name":"Graph Learning","papers":2},{"task":"/task/meta-learning","name":"Meta-Learning","papers":2},{"task":"/task/representation-learning","name":"Representation Learning","papers":2},{"task":"/task/transfer-learning","name":"Transfer Learning","papers":2},{"task":"/task/3dgs","name":"3DGS","papers":1},{"task":"/task/contrastive-learning","name":"Contrastive Learning","papers":1},{"task":"/task/domain-adaptation","name":"Domain Adaptation","papers":1},{"task":"/task/efficient-exploration","name":"Efficient Exploration","papers":1},{"task":"/task/heuristic-search","name":"Heuristic Search","papers":1},{"task":"/task/informativeness","name":"Informativeness","papers":1},{"task":"/task/language-modeling","name":"Language Modeling","papers":1},{"task":"/task/language-modelling","name":"Language Modelling","papers":1},{"task":"/task/masked-language-modeling","name":"Masked Language Modeling","papers":1},{"task":"/task/novel-view-synthesis","name":"Novel View Synthesis","papers":1},{"task":"/task/out-of-distribution-generalization","name":"Out-of-Distribution Generalization","papers":1},{"task":"/task/pac-learning","name":"PAC learning","papers":1}],"tasks_shown":19,"n_tasks":19,"usage_by_year":[{"year":"2020","papers":2},{"year":"2021","papers":1},{"year":"2022","papers":2},{"year":"2023","papers":4},{"year":"2024","papers":2},{"year":"2025","papers":1}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/hunger-games-search-hgs"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=HGS","read_at":"2026-10-05T00:57:39+00:00","query":"HGS","kind":"paper","have":"no_code","tier":"paper_only","verified_implementation":false,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"arxiv_id":"2512.14352"},"resolution":"paper","resolved_name_differs":false,"absence_asserted":"for_this_paper_only","absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"unknown","archive_paper_arxiv_id":null,"repositories":{"listed":null,"in_graph":0,"list_truncated":null,"strongest_link":null},"retrieve_with":null,"name_competition":{"verdict":"sole_bearer","may_be_wrong_sense":false,"bearers_found":1,"served":{"arxiv_id":"2512.14352","citations":null},"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing else in this corpus is named 'HGS'. That is a statement about this corpus and not about the field: short names are reused, and a sense we never collected cannot show up here. Confirm `served.arxiv_id` if you had a specific paper in mind."},"name_competition_text":null,"near_matches":null,"code_nearby":[],"code_nearby_caption":null,"origin_paper":{"arxiv_id":"2512.14352","page":null,"syntology_url":null,"in_graph_layer":false,"samples":0},"line":"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.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"1b7c5d61388296b7dd4e91f68a9a0fb97dc9af52e3971a136c841fb53e9bf08f","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}