{"id":"W3213715850","doi":"10.18280/jesa.540505","title":"A Novel Hybrid Algorithm of Max-Min Ant System with Quadratic Programming to Solve the Unit Commitment Problem","year":2021,"lang":"en","type":"article","venue":"Journal Européen des Systèmes Automatisés","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Ant colony optimization algorithms; Mathematical optimization; Particle swarm optimization; Computer science; Genetic algorithm; Quadratic programming; Algorithm; MATLAB; Swarm behaviour; Schedule; Metaheuristic; Parallel metaheuristic; Meta-optimization; Mathematics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005752908,0.0002921566,0.0004519789,0.0001554847,0.0002930344,0.0003555779,0.0003169095,0.00004723499,0.00002461808],"category_scores_gemma":[0.00005498058,0.0001979534,0.0001130654,0.0006852583,0.00006635616,0.0001620929,0.0000680601,0.0003413724,0.00002517634],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002322277,"about_ca_system_score_gemma":0.000162913,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002252538,"about_ca_topic_score_gemma":0.00001850763,"domain_scores_codex":[0.9979221,0.0001130503,0.0007650958,0.0002047514,0.0005704112,0.0004246561],"domain_scores_gemma":[0.9985827,0.0001198039,0.0002461918,0.0003611014,0.0004635254,0.0002267085],"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.00001489812,0.0002038462,0.0001892628,0.00110935,0.0006968364,0.0005556493,0.003587397,0.5626636,0.001364585,0.0008240222,0.0003122765,0.4284782],"study_design_scores_gemma":[0.001016859,0.0002916222,0.004024681,0.002457658,0.0001657097,0.008152095,0.003718186,0.9757599,0.003208677,0.00003562832,0.0007524913,0.0004164586],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.02654589,0.001021738,0.9703445,0.0001670043,0.0003863588,0.0005177188,0.00002852269,0.0004127373,0.0005755002],"genre_scores_gemma":[0.1627927,0.0000398396,0.8366171,0.00004424818,0.0001625209,0.00005293668,0.000009542413,0.00009633576,0.0001848112],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4280618,"threshold_uncertainty_score":0.8072305,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01696474311065474,"score_gpt":0.2307585207693308,"score_spread":0.213793777658676,"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."}}