{"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/tree-based-optimization-a-meta-algorithm-for","title":"Tree-Based Optimization: A Meta-Algorithm for Metaheuristic Optimization","arxiv_id":"1809.09284","date":"2018-09-25","proceeding":null,"authors":["Benyamin Ghojogh","Saeed Sharifian","Hoda Mohammadzade"],"abstract":"Designing search algorithms for finding global optima is one of the most\nactive research fields, recently. These algorithms consist of two main\ncategories, i.e., classic mathematical and metaheuristic algorithms. This\narticle proposes a meta-algorithm, Tree-Based Optimization (TBO), which uses\nother heuristic optimizers as its sub-algorithms in order to improve the\nperformance of search. The proposed algorithm is based on mathematical tree\nsubject and improves performance and speed of search by iteratively removing\nparts of the search space having low fitness, in order to minimize and purify\nthe search space. The experimental results on several well-known benchmarks\nshow the outperforming performance of TBO algorithm in finding the global\nsolution. Experiments on high dimensional search spaces show significantly\nbetter performance when using the TBO algorithm. The proposed algorithm\nimproves the search algorithms in both accuracy and speed aspects, especially\nfor high dimensional searching such as in VLSI CAD tools for Integrated Circuit\n(IC) design.","url_abs":"http://arxiv.org/abs/1809.09284v1","url_pdf":"http://arxiv.org/pdf/1809.09284v1.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":"tree-based-optimization-a-meta-algorithm-for","repo_url":"https://github.com/bghojogh/TBO-Metaheuristic-Optimization","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"metaheuristic-optimization","task_name":"Metaheuristic Optimization"}],"methods":[{"method_slug":"speed","method_name":"SPEED"}],"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":"bghojogh/TBO-Metaheuristic-Optimization","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":"993cc12cb2d45e6613fdf77aad057ebfffc3e00dc2650dbf5d59e3dcd39503b8","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}