{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006810384,0.0006939287,0.000777921,0.000425651,0.0003938785,0.0006879285,0.001360269,0.0007706409,0.002552383],"category_scores_gemma":[0.001037019,0.0004093341,0.000503545,0.0006705962,0.0003072596,0.0006932975,0.0006585232,0.0009092833,0.0006172142],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003069417,"about_ca_system_score_gemma":0.000715407,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002368588,"about_ca_topic_score_gemma":0.002568492,"domain_scores_codex":[0.9994746,0.0002017758,0.0000238036,0.00009220454,0.0001648449,0.00004271017],"domain_scores_gemma":[0.9996471,0.000170129,0.00003279134,0.0000291092,0.00009644328,0.00002445608],"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.0001558409,0.0001310312,0.0006826564,0.0002104947,0.000134934,0.0001150304,0.00008834988,0.7987353,0.006738355,0.01401472,0.003569311,0.175424],"study_design_scores_gemma":[0.00001350743,0.00003490835,0.00005997139,0.000002886747,0.000004890175,0.00002511287,0.000004108851,0.9973642,0.0004344592,0.0009061201,0.001146105,0.000003786388],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.007040298,0.0002424167,0.9890055,0.00008724022,0.00006551411,0.00005025522,0.00002095673,0.0003175189,0.003170291],"genre_scores_gemma":[0.3472231,0.0002841361,0.6458588,0.00018558,0.000091693,0.0003222826,0.0001613753,0.0001730735,0.005700014],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002552383,"threshold_uncertainty_score":0.008538604,"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."}}