{"id":"W4396920847","doi":"10.31857/s0005117924030037","title":"Genetic Engineering Algorithm (GEA): An Efficient Metaheuristic Algorithm for Solving Combinatorial Optimization Problems","year":2024,"lang":"en","type":"article","venue":"Automation and Remote Control","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Crossover; Metaheuristic; Benchmark (surveying); Genetic algorithm; Computer science; Combinatorial optimization; Algorithm; Mathematical optimization; Convergence (economics); Heuristic; Randomness; Exploit; Quality control and genetic algorithms; Premature convergence; Meta-optimization; Mathematics; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0009478187,0.0002596262,0.0003162001,0.0004266428,0.000246699,0.001049775,0.0003928767,0.0001320918,0.00002011396],"category_scores_gemma":[0.0002606354,0.0002409625,0.00009014214,0.0005773242,0.00004290914,0.0004460989,0.00008372076,0.0001777859,0.00001326593],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008866486,"about_ca_system_score_gemma":0.0001532115,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001727272,"about_ca_topic_score_gemma":2.550614e-7,"domain_scores_codex":[0.9977272,0.0001188378,0.0005301851,0.0006695644,0.0005254438,0.0004288336],"domain_scores_gemma":[0.9984982,0.0004190167,0.0001021378,0.0003904172,0.0003487696,0.0002414775],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001582624,0.00003451432,3.43756e-7,0.00008202472,0.00005065719,0.00000868397,0.0001462819,0.4970497,0.00007315782,0.002268175,0.0000387533,0.500246],"study_design_scores_gemma":[0.001357844,0.0001481652,0.00006035191,0.00007350167,0.00005316288,0.000038551,0.000006521367,0.9966027,0.00004798583,0.000524432,0.0008113658,0.0002754422],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00005490215,0.001057715,0.9944773,0.0003406051,0.001956099,0.00123598,0.00002503423,0.0008219305,0.00003046482],"genre_scores_gemma":[0.01427127,0.00008568047,0.9850134,0.00006137104,0.0003369161,0.00005465635,0.00003616584,0.00004548383,0.00009506482],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4999706,"threshold_uncertainty_score":0.9999872,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009434068072688354,"score_gpt":0.2482859273020918,"score_spread":0.2388518592294034,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}