{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001489223,0.0001259607,0.0001996821,0.000283845,0.0002971156,0.0002495911,0.0004937063,0.00009245191,0.00008873965],"category_scores_gemma":[0.0003917453,0.0001160875,0.00007274434,0.0004908042,0.0001336391,0.0004578076,0.00006168199,0.0002145528,0.000001534824],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001406353,"about_ca_system_score_gemma":0.0001699038,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":3.087794e-7,"about_ca_topic_score_gemma":8.667129e-8,"domain_scores_codex":[0.9986553,0.0001297313,0.0005639951,0.0002251798,0.0002454143,0.0001803458],"domain_scores_gemma":[0.9974011,0.0006119344,0.0004635247,0.0002971797,0.001038455,0.0001877758],"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.000009215771,0.00005629951,0.000004919409,0.000009449369,0.00002420957,9.997925e-7,0.00007209353,0.775779,0.00009994009,0.09627055,0.00004681713,0.1276265],"study_design_scores_gemma":[0.0006441668,0.0000686503,0.00001078969,0.000007397569,0.00002683175,0.0001490764,0.00004248866,0.9879053,0.0002115409,0.009383878,0.001429778,0.0001200942],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000260011,0.0001161733,0.998427,0.0004201451,0.0001764179,0.0005293333,0.00001300303,0.00003942223,0.0002525226],"genre_scores_gemma":[0.001709827,0.0001721118,0.9974858,0.000128366,0.0002578362,0.00008608165,0.00001268849,0.00001601177,0.0001312944],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.2121263,"threshold_uncertainty_score":0.4733909,"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."}}