{"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":"/task/metaheuristic-optimization","name":"Metaheuristic Optimization","slug":"metaheuristic-optimization","description_markdown":"In computer science and mathematical optimization, a metaheuristic is a higher-level procedure or heuristic designed to find, generate, or select a heuristic (partial search algorithm) that may provide a sufficiently good solution to an optimization problem. For some examples, you can visit https://aliasgharheidari.com/Publications.html","categories":[{"name":"Methodology","url":"/area/methodology"}],"source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","slug_source":"archive_url"},"counts":{"papers_tagged":69,"papers_with_code":18,"benchmarks":0,"benchmark_tables_in_archive":0,"benchmark_tables_shown":0,"benchmark_tables_withheld_as_spam":0,"benchmark_definition":"a leaderboard table with at least one row; benchmark_tables_shown also counts the zero-row tables; benchmark_tables_in_archive adds the tables withheld as spam","datasets":1,"subtasks":0,"parent_tasks":0},"benchmarks":[],"datasets":[{"url":"/dataset/ostd","name":"OSTD","full_name":"Open-Source-Total-Distance","num_papers_in_archive":1}],"subtasks":[],"parent_tasks":[],"papers":{"order":"repositories listed in the archive (most first), then date (newest first), then slug; the archive holds no stars","population":"every paper the archive tags with this task (distinct papers; spam titles not listed). 'of' counts the papers listed; until 2026-09-25 it counted only the papers with a code link, and that number is of_with_code","page":1,"pages_in_order":1,"rows_per_page":100,"shown":69,"of":69,"of_with_code":18,"tagged_in_all":69,"counts":{"archive_papers_tagged":69,"with_a_code_link":18,"where_syntology_ran_a_sample":2,"not_listed_spam_title":0,"listed":69,"listed_where_code_ran":2,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":1,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":1,"listed_every_run_a_failure_of_syntologys_instrument":1,"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"},"items":[{"url":"/paper/navigation-variable-based-multi-objective","slug":"navigation-variable-based-multi-objective","title":"Navigation Variable-based Multi-objective Particle Swarm Optimization for UAV Path Planning with Kinematic Constraints","date":"2025-01-03","arxiv_id":"2501.03261","repositories_listed":2,"syntology":null},{"url":"/paper/llamea-a-large-language-model-evolutionary","slug":"llamea-a-large-language-model-evolutionary","title":"LLaMEA: A Large Language Model Evolutionary Algorithm for Automatically Generating Metaheuristics","date":"2024-05-30","arxiv_id":"2405.20132","repositories_listed":2,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/llamea-a-large-language-model-evolutionary#ran","syntology_url":"https://syntology.ai/paper/2405.20132","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2405.20132"}},"official":{"repos":["nikivanstein/LLaMEA"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/paradiseo-from-a-modular-framework-for","slug":"paradiseo-from-a-modular-framework-for","title":"Paradiseo: From a Modular Framework for Evolutionary Computation to the Automated Design of Metaheuristics ---22 Years of Paradiseo---","date":"2021-05-02","arxiv_id":"2105.00420","repositories_listed":2,"syntology":null},{"url":"/paper/190409352","slug":"190409352","title":"Donkey and Smuggler Optimization Algorithm: A Collaborative Working Approach to Path Finding","date":"2019-04-19","arxiv_id":"1904.09352","repositories_listed":2,"syntology":null},{"url":"/paper/defending-against-diverse-attacks-in","slug":"defending-against-diverse-attacks-in","title":"Defending Against Diverse Attacks in Federated Learning Through Consensus-Based Bi-Level Optimization","date":"2024-12-03","arxiv_id":"2412.02535","repositories_listed":1,"syntology":null},{"url":"/paper/autooptlib-a-library-of-automatically","slug":"autooptlib-a-library-of-automatically","title":"AutoOptLib: Tailoring Metaheuristic Optimizers via Automated Algorithm Design","date":"2023-03-12","arxiv_id":"2303.06536","repositories_listed":1,"syntology":null},{"url":"/paper/learning-large-neighborhood-search-for","slug":"learning-large-neighborhood-search-for","title":"Learning Large Neighborhood Search for Vehicle Routing in Airport Ground Handling","date":"2023-02-27","arxiv_id":"2302.13797","repositories_listed":1,"syntology":null},{"url":"/paper/hivenas-neural-architecture-search-using","slug":"hivenas-neural-architecture-search-using","title":"HiveNAS: Neural Architecture Search using Artificial Bee Colony Optimization","date":"2022-11-18","arxiv_id":"2211.10250","repositories_listed":1,"syntology":null},{"url":"/paper/autoopt-a-methodological-framework-of","slug":"autoopt-a-methodological-framework-of","title":"AutoOpt: A General Framework for Automatically Designing Metaheuristic Optimization Algorithms with Diverse Structures","date":"2022-04-03","arxiv_id":"2204.00998","repositories_listed":1,"syntology":null},{"url":"/paper/janus-parallel-tempered-genetic-algorithm","slug":"janus-parallel-tempered-genetic-algorithm","title":"JANUS: Parallel Tempered Genetic Algorithm Guided by Deep Neural Networks for Inverse Molecular Design","date":"2021-06-07","arxiv_id":"2106.04011","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/janus-parallel-tempered-genetic-algorithm#ran","syntology_url":"https://syntology.ai/paper/2106.04011","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.04011"}},"official":{"repos":["aspuru-guzik-group/janus"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/safety-enhanced-uav-path-planning-with","slug":"safety-enhanced-uav-path-planning-with","title":"Safety-enhanced UAV Path Planning with Spherical Vector-based Particle Swarm Optimization","date":"2021-04-13","arxiv_id":"2104.10033","repositories_listed":1,"syntology":null},{"url":"/paper/motion-encoded-particle-swarm-optimization","slug":"motion-encoded-particle-swarm-optimization","title":"Motion-Encoded Particle Swarm Optimization for Moving Target Search Using UAVs","date":"2020-10-05","arxiv_id":"2010.02039","repositories_listed":1,"syntology":null},{"url":"/paper/battle-royale-optimization-algorithm","slug":"battle-royale-optimization-algorithm","title":"Battle royale optimization algorithm","date":"2020-06-02","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/ils-summ-iterated-local-search-for","slug":"ils-summ-iterated-local-search-for","title":"ILS-SUMM: Iterated Local Search for Unsupervised Video Summarization","date":"2019-12-08","arxiv_id":"1912.03650","repositories_listed":1,"syntology":null},{"url":"/paper/multi-modal-forest-optimization-algorithm","slug":"multi-modal-forest-optimization-algorithm","title":"Multi-Modal Forest Optimization Algorithm","date":"2019-03-05","arxiv_id":null,"repositories_listed":1,"syntology":null},{"url":"/paper/tree-based-optimization-a-meta-algorithm-for","slug":"tree-based-optimization-a-meta-algorithm-for","title":"Tree-Based Optimization: A Meta-Algorithm for Metaheuristic Optimization","date":"2018-09-25","arxiv_id":"1809.09284","repositories_listed":1,"syntology":null},{"url":"/paper/pontogammarus-maeoticus-swarm-optimization-a","slug":"pontogammarus-maeoticus-swarm-optimization-a","title":"Pontogammarus Maeoticus Swarm Optimization: A Metaheuristic Optimization Algorithm","date":"2018-07-05","arxiv_id":"1807.01844","repositories_listed":1,"syntology":null},{"url":"/paper/gnowee-a-hybrid-metaheuristic-optimization","slug":"gnowee-a-hybrid-metaheuristic-optimization","title":"Gnowee: A Hybrid Metaheuristic Optimization Algorithm for Constrained, Black Box, Combinatorial Mixed-Integer Design","date":"2018-04-15","arxiv_id":"1804.05429","repositories_listed":1,"syntology":null},{"url":null,"slug":"blindfolded-spider-man-optimization-a-single","title":"Blindfolded Spider-man Optimization: A Single-Point Metaheuristics Suitable for Continuous and Discrete Spaces","date":"2025-05-19","arxiv_id":"2505.17069","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimizing-interplanetary-trajectories-using","title":"Optimizing Interplanetary Trajectories using Hybrid Meta-heuristic","date":"2025-05-18","arxiv_id":"2505.12399","repositories_listed":0,"syntology":null},{"url":null,"slug":"hybrid-dense-unet201-optimization-for-pap","title":"Hybrid Dense-UNet201 Optimization for Pap Smear Image Segmentation Using Spider Monkey Optimization","date":"2025-04-17","arxiv_id":"2504.12807","repositories_listed":0,"syntology":null},{"url":null,"slug":"graph-theoretic-measures-for-interpretable","title":"Graph-Theoretic Measures for Interpretable Multicriteria Decision Making in Emergency Department Layout Optimization","date":"2025-04-15","arxiv_id":"2504.11620","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimization-through-in-context-learning-and","title":"Optimization through In-Context Learning and Iterative LLM Prompting for Nuclear Engineering Design Problems","date":"2025-03-25","arxiv_id":"2503.19620","repositories_listed":0,"syntology":null},{"url":null,"slug":"fig-tree-wasp-symbiotic-coevolutionary","title":"Fig Tree-Wasp Symbiotic Coevolutionary Optimization Algorithm","date":"2025-03-12","arxiv_id":"2503.09340","repositories_listed":0,"syntology":null},{"url":null,"slug":"goat-optimization-algorithm-a-novel-bio","title":"Goat Optimization Algorithm: A Novel Bio-Inspired Metaheuristic for Global Optimization","date":"2025-03-04","arxiv_id":"2503.02331","repositories_listed":0,"syntology":null},{"url":null,"slug":"applications-of-deep-reinforcement-learning-1","title":"Applications of deep reinforcement learning to urban transit network design","date":"2025-02-25","arxiv_id":"2502.17758","repositories_listed":0,"syntology":null},{"url":null,"slug":"pso-based-sliding-mode-current-control-of","title":"PSO-based Sliding Mode Current Control of Grid-Forming Inverter in Rotating Frame","date":"2025-01-20","arxiv_id":"2501.11633","repositories_listed":0,"syntology":null},{"url":null,"slug":"the-paradox-of-success-in-evolutionary-and","title":"The Paradox of Success in Evolutionary and Bioinspired Optimization: Revisiting Critical Issues, Key Studies, and Methodological Pathways","date":"2025-01-13","arxiv_id":"2501.07515","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimization-of-convolutional-neural-network-2","title":"Optimization of Convolutional Neural Network Hyperparameter for Medical Image Diagnosis using Metaheuristic Algorithms: A short Recent Review (2019-2022)","date":"2024-12-23","arxiv_id":"2412.17956","repositories_listed":0,"syntology":null},{"url":null,"slug":"social-distancing-induced-coronavirus","title":"Social Distancing Induced Coronavirus Optimization Algorithm (COVO): Application to Multimodal Function Optimization and Noise Removal","date":"2024-11-26","arxiv_id":"2411.17282","repositories_listed":0,"syntology":null},{"url":null,"slug":"boosting-the-efficiency-of-metaheuristics","title":"Boosting the Efficiency of Metaheuristics Through Opposition-Based Learning in Optimum Locating of Control Systems in Tall Buildings","date":"2024-11-07","arxiv_id":"2411.05864","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-cnn-classification-with-lamarckian","title":"Enhancing CNN Classification with Lamarckian Memetic Algorithms and Local Search","date":"2024-10-26","arxiv_id":"2410.20234","repositories_listed":0,"syntology":null},{"url":null,"slug":"what-is-metaheuristics-a-primer-for-the","title":"Metaheuristics is All You Need","date":"2024-10-26","arxiv_id":"2411.05797","repositories_listed":0,"syntology":null},{"url":null,"slug":"water-and-electricity-consumption-forecasting","title":"Water and Electricity Consumption Forecasting at an Educational Institution using Machine Learning models with Metaheuristic Optimization","date":"2024-10-25","arxiv_id":"2410.19709","repositories_listed":0,"syntology":null},{"url":null,"slug":"hra-a-multi-criteria-framework-for-ranking","title":"HRA: A Multi-Criteria Framework for Ranking Metaheuristic Optimization Algorithms","date":"2024-09-18","arxiv_id":"2409.11617","repositories_listed":0,"syntology":null},{"url":null,"slug":"enhancing-multistep-brent-oil-price","title":"Multistep Brent Oil Price Forecasting with a Multi-Aspect Meta-heuristic Optimization and Ensemble Deep Learning Model","date":"2024-07-15","arxiv_id":"2407.12062","repositories_listed":0,"syntology":null},{"url":null,"slug":"parameter-identification-for-electrochemical","title":"Parameter Identification for Electrochemical Models of Lithium-Ion Batteries Using Bayesian Optimization","date":"2024-05-17","arxiv_id":"2405.10750","repositories_listed":0,"syntology":null},{"url":null,"slug":"jclec-mo-a-java-suite-for-solving-many","title":"JCLEC-MO: a Java suite for solving many-objective optimization engineering problems","date":"2024-02-28","arxiv_id":"2402.18616","repositories_listed":0,"syntology":null},{"url":null,"slug":"time-to-stop-and-think-what-kind-of-research","title":"Time to Stop and Think: What kind of research do we want to do?","date":"2024-02-13","arxiv_id":"2402.08298","repositories_listed":0,"syntology":null},{"url":null,"slug":"decomposing-hard-sat-instances-with","title":"Decomposing Hard SAT Instances with Metaheuristic Optimization","date":"2023-12-16","arxiv_id":"2312.10436","repositories_listed":0,"syntology":null},{"url":null,"slug":"dense-visual-odometry-using-genetic-algorithm","title":"Dense Visual Odometry Using Genetic Algorithm","date":"2023-11-10","arxiv_id":"2311.06149","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-general-framework-for-utilizing","title":"A general Framework for Utilizing Metaheuristic Optimization for Sustainable Unrelated Parallel Machine Scheduling: A concise overview","date":"2023-09-14","arxiv_id":"2311.12802","repositories_listed":0,"syntology":null},{"url":null,"slug":"comparative-evaluation-of-metaheuristic","title":"Comparative Evaluation of Metaheuristic Algorithms for Hyperparameter Selection in Short-Term Weather Forecasting","date":"2023-09-05","arxiv_id":"2309.02600","repositories_listed":0,"syntology":null},{"url":null,"slug":"differential-privacy-may-have-a-potential","title":"Differential Privacy May Have a Potential Optimization Effect on Some Swarm Intelligence Algorithms besides Privacy-preserving","date":"2023-06-30","arxiv_id":"2306.17370","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimized-three-deep-learning-models-based","title":"Optimized Three Deep Learning Models Based-PSO Hyperparameters for Beijing PM2.5 Prediction","date":"2023-06-10","arxiv_id":"2306.07296","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-data-driven-rutting-depth-short-time","title":"A data-driven rutting depth short-time prediction model with metaheuristic optimization for asphalt pavements based on RIOHTrack","date":"2023-05-11","arxiv_id":"2305.06707","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-study-of-left-before-treatment-complete","title":"A Study of Left Before Treatment Complete Emergency Department Patients: An Optimized Explanatory Machine Learning Framework","date":"2022-12-22","arxiv_id":"2212.11879","repositories_listed":0,"syntology":null},{"url":null,"slug":"an-adaptive-simulated-annealing-based-machine","title":"An Adaptive Simulated Annealing-Based Machine Learning Approach for Developing an E-Triage Tool for Hospital Emergency Operations","date":"2022-12-22","arxiv_id":"2212.11892","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-metaheuristic-multi-objective-interaction","title":"A metaheuristic multi-objective interaction-aware feature selection method","date":"2022-11-10","arxiv_id":"2211.05423","repositories_listed":0,"syntology":null},{"url":null,"slug":"nature-inspired-metaheuristic-effectiveness","title":"Nature Inspired Metaheuristic Effectiveness Used in Phishing Intrusion Detection Systems with Grey Wolf Algorithm Techniques","date":"2022-09-09","arxiv_id":null,"repositories_listed":0,"syntology":null},{"url":null,"slug":"a-novel-computational-technique-using","title":"A novel computational technique using coefficient diagram method for load frequency control in an interconnected power system","date":"2022-08-15","arxiv_id":"2208.07054","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-brief-overview-of-physics-inspired","title":"A Brief Overview of Physics-inspired Metaheuristic Optimization Techniques","date":"2022-01-30","arxiv_id":"2201.12810","repositories_listed":0,"syntology":null},{"url":null,"slug":"swarm-intelligence-algorithms-applied-to","title":"Virtual reference feedback tuning with robustness constraints: A swarm intelligence solution","date":"2021-11-03","arxiv_id":"2111.02212","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-stochastic-metapopulation-state-space","title":"A stochastic metapopulation state-space approach to modeling and estimating Covid-19 spread","date":"2021-06-15","arxiv_id":"2106.07919","repositories_listed":0,"syntology":null},{"url":null,"slug":"ebola-optimization-search-algorithm-eosa-a","title":"Ebola Optimization Search Algorithm (EOSA): A new metaheuristic algorithm based on the propagation model of Ebola virus disease","date":"2021-06-02","arxiv_id":"2106.01416","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-new-k-means-grey-wolf-algorithm-for","title":"A New K means Grey Wolf Algorithm for Engineering Problems","date":"2021-02-27","arxiv_id":"2103.05760","repositories_listed":0,"syntology":null},{"url":null,"slug":"multi-objective-design-of-multilayer","title":"Multi-objective design of multilayer microwave dielectric filters using artificial bee colony algorithm","date":"2021-01-22","arxiv_id":"2101.10858","repositories_listed":0,"syntology":null},{"url":null,"slug":"a-metaheuristic-driven-approach-to-fine-tune","title":"A Metaheuristic-Driven Approach to Fine-Tune Deep Boltzmann Machines","date":"2021-01-14","arxiv_id":"2101.05795","repositories_listed":0,"syntology":null},{"url":null,"slug":"metaheuristic-optimization-of-power-and","title":"Metaheuristic optimization of power and energy systems: underlying principles and main issues of the 'rush to heuristics'","date":"2020-08-17","arxiv_id":"2008.07491","repositories_listed":0,"syntology":null},{"url":null,"slug":"performance-analysis-of-metaheuristic","title":"Performance Analysis of Metaheuristic Optimization Algorithms in Estimating the Interfacial Heat Transfer Coefficient on Directional Solidification","date":"2020-07-18","arxiv_id":"2007.15583","repositories_listed":0,"syntology":null},{"url":null,"slug":"benchmarking-for-metaheuristic-black-box","title":"Benchmarking for Metaheuristic Black-Box Optimization: Perspectives and Open Challenges","date":"2020-07-01","arxiv_id":"2007.00541","repositories_listed":0,"syntology":null},{"url":null,"slug":"influence-of-initialization-on-the","title":"Influence of Initialization on the Performance of Metaheuristic Optimizers","date":"2020-03-08","arxiv_id":"2003.03789","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-wind-driven-optimization-trained","title":"Adaptive Wind Driven Optimization Trained Artificial Neural Networks","date":"2019-11-20","arxiv_id":"1911.08942","repositories_listed":0,"syntology":null},{"url":null,"slug":"190602010","title":"A Hybrid Algorithm for Metaheuristic Optimization","date":"2019-05-26","arxiv_id":"1906.02010","repositories_listed":0,"syntology":null},{"url":null,"slug":"optimizing-software-effort-estimation-models","title":"Optimizing Software Effort Estimation Models Using Firefly Algorithm","date":"2019-01-08","arxiv_id":"1903.02079","repositories_listed":0,"syntology":null},{"url":null,"slug":"global-optimization-test-problems-based-on","title":"Global optimization test problems based on random field composition","date":"2018-07-13","arxiv_id":"1807.05096","repositories_listed":0,"syntology":null},{"url":null,"slug":"adaptive-plant-propagation-algorithm-for","title":"Adaptive Plant Propagation Algorithm for Solving Economic Load Dispatch Problem","date":"2017-08-04","arxiv_id":"1708.07040","repositories_listed":0,"syntology":null},{"url":null,"slug":"diversification-based-learning-in-computing","title":"Diversification-Based Learning in Computing and Optimization","date":"2017-03-23","arxiv_id":"1703.07929","repositories_listed":0,"syntology":null},{"url":null,"slug":"fuzzy-finite-element-model-updating-using","title":"Fuzzy finite element model updating using metaheuristic optimization algorithms","date":"2017-01-03","arxiv_id":"1701.00833","repositories_listed":0,"syntology":null}],"syntology_records":2,"syntology_note":"a paper without a record is not a recorded non-run: it may lack an arXiv id or simply be absent from the graph layer"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"since_archive_judged":{"papers":0,"papers_placed":0,"judged_by":{"model":"a model","models_as_recorded":[],"from":"lb_rows_run_verified.jsonl: each record's `model` field (the extractor's call that wrote decisions[])"},"note":"a model's judgement from the paper's own tables that they report on this leaderboard, not a result: no value from a paper that was not placed is printed or carried here; papers counts each paper once over these leaderboards","backfill":"8,886 of 18,637 newer papers checked so far (733 more had nothing to place; 41 could not be read)","backfill_complete":false,"leaderboards":[]},"papers_where_code_ran":2,"papers_where_code_ran_first_page":"/task/metaheuristic-optimization/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","pages":[{"order":"ran","page":1,"of":1,"url":"/task/metaheuristic-optimization/papers/ran/1","json":"/task/metaheuristic-optimization/papers/ran/1.json","rows":2}],"description_links":{"kept":0,"unwrapped_to_text":0,"bare_urls_linked":0,"relative_images_dropped":0,"rule":"internal links are kept only when the target slug exists in the catalog"},"syntology":{"read_at":"2026-10-05T00:36:11+00:00","claim":"Per-sample execution status on synthesized fixtures ('ran N of M samples'); not a correctness claim and not a ranking signal.","status_vocabulary":{"ran_honours":"ran, honoured the contract we drafted","ran_violates":"ran, violated the contract we drafted","ran_draft_wrong":"ran; our contract draft was wrong, not the code","ran_fixture":"ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)","ran":"ran on a synthesized input","unverified":"unverified (harvested, no recorded run)"},"row_route":"each syntology object on a benchmark's first row and on a paper carries sample_list (this site's paper page, #ran), syntology_url (syntology.ai's page for the paper, only when that route probed live) and mcp (the agent call that lists the paper's harvested samples; not a verdict on the paper)","developers":"https://syntology.ai/developers"},"not_shown":{"libraries":"the archive has no per-task library table","trend_sparklines":"the Trend column of the benchmarks table was a rendered image; it is not in the archive","social_and_latest_sorts":"stars and social signals are not in the archive"},"record_sha256":"cc2ce80fe5c7be99256e868dd6a6d9e03008552d5e44dca79dc0d13d85550dc1","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}