{"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":"/paper/general-subpopulation-framework-and-taming","title":"General Subpopulation Framework and Taming the Conflict Inside Populations","arxiv_id":"1901.00266","date":"2019-01-02","proceeding":null,"authors":["Danilo Vasconcellos Vargas","Junichi Murata","Hirotaka Takano","Alexandre Claudio Botazzo Delbem"],"abstract":"Structured evolutionary algorithms have been investigated for some time.\nHowever, they have been under-explored specially in the field of\nmulti-objective optimization. Despite their good results, the use of complex\ndynamics and structures make their understanding and adoption rate low. Here,\nwe propose the general subpopulation framework that has the capability of\nintegrating optimization algorithms without restrictions as well as aid the\ndesign of structured algorithms. The proposed framework is capable of\ngeneralizing most of the structured evolutionary algorithms, such as cellular\nalgorithms, island models, spatial predator-prey and restricted mating based\nalgorithms under its formalization. Moreover, we propose two algorithms based\non the general subpopulation framework, demonstrating that with the simple\naddition of a number of single-objective differential evolution algorithms for\neach objective the results improve greatly, even when the combined algorithms\nbehave poorly when evaluated alone at the tests. Most importantly, the\ncomparison between the subpopulation algorithms and their related panmictic\nalgorithms suggests that the competition between different strategies inside\none population can have deleterious consequences for an algorithm and reveal a\nstrong benefit of using the subpopulation framework.\n  The code for SAN, the proposed multi-objective algorithm which has the\ncurrent best results in the hardest benchmark, is available at the following\nhttps://github.com/zweifel/zweifel","url_abs":"http://arxiv.org/abs/1901.00266v1","url_pdf":"http://arxiv.org/pdf/1901.00266v1.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"general-subpopulation-framework-and-taming","repo_url":"https://github.com/zweifel/zweifel","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"evolutionary-algorithms","task_name":"Evolutionary Algorithms"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"zweifel/zweifel","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"69385b0330b19e419d1ae618ff58630860773e8823eb3876185362679e732054","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}