{"id":"W2088134026","doi":"10.1007/s10957-010-9716-z","title":"Annealing a Genetic Algorithm for Constrained Optimization","year":2010,"lang":"en","type":"article","venue":"Journal of Optimization Theory and Applications","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":false,"ca_institutions":"Acadia University","funders":"","keywords":"Mathematical optimization; Simulated annealing; Penalty method; Convergence (economics); Computer science; Optimization problem; Genetic algorithm; Forcing (mathematics); Algorithm; Mathematics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006464454,0.0005935924,0.001029112,0.0005594883,0.0006052277,0.0007880308,0.0009819734,0.001937994,0.002969106],"category_scores_gemma":[0.002375064,0.0004684823,0.0008199727,0.001235057,0.0009314114,0.0007600855,0.0008431319,0.001539738,0.0006461741],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004804126,"about_ca_system_score_gemma":0.0009814247,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004747078,"about_ca_topic_score_gemma":0.00398827,"domain_scores_codex":[0.9995313,0.0002067769,0.00001826336,0.00005372468,0.0001670512,0.00002296772],"domain_scores_gemma":[0.9995016,0.0003058465,0.00002568146,0.00005906035,0.00009461654,0.00001317091],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00005321347,0.00004836117,0.0002093843,0.00009046117,0.00007291143,0.00004643939,0.00007314802,0.8476739,0.003338368,0.05276069,0.002638174,0.09299491],"study_design_scores_gemma":[0.0000153379,0.00002157902,0.00007944926,0.00001005973,0.00001485876,0.00001371075,0.000004236863,0.9854053,0.0003263495,0.01166413,0.002438514,0.000006568794],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004091067,0.0005462745,0.989616,0.0001619113,0.0001160139,0.00003865211,0.00002370019,0.0002416705,0.005164666],"genre_scores_gemma":[0.1556194,0.0008423514,0.8355592,0.0001914219,0.0001314559,0.0002481568,0.00009466895,0.0002109911,0.007102462],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004747078,"threshold_uncertainty_score":0.009932697,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01071977768036943,"score_gpt":0.2848696662227373,"score_spread":0.2741498885423679,"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."}}