{"id":"W2898365018","doi":"10.1109/tits.2018.2874235","title":"A Hierarchical Heuristic Approach for Solving Air Traffic Scheduling and Routing Problem With a Novel Air Traffic Model","year":2018,"lang":"en","type":"article","venue":"IEEE Transactions on Intelligent Transportation Systems","topic":"Air Traffic Management and Optimization","field":"Engineering","cited_by":25,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"University of Science and Technology of China; Nanyang Technological University; University of Toronto; Economic Development Board - Singapore","keywords":"Scheduling (production processes); Heuristic; Air traffic control; Computer science; Job shop scheduling; Routing (electronic design automation); Mathematical optimization; Operations research; Engineering; Computer network; Artificial intelligence; Mathematics; Aerospace engineering","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002609926,0.000378546,0.0003544455,0.000321123,0.0003529319,0.00007658495,0.0001369811,0.0001620326,0.000005366811],"category_scores_gemma":[0.000001874262,0.000363991,0.0001149039,0.0003838432,0.0001049792,0.0002718539,2.910916e-7,0.0002714627,0.000003176858],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00008877365,"about_ca_system_score_gemma":0.00003903635,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008144621,"about_ca_topic_score_gemma":0.00008093825,"domain_scores_codex":[0.998059,0.00001723496,0.0006757875,0.000507362,0.0003185397,0.0004220561],"domain_scores_gemma":[0.9993298,0.00008631114,0.00009459102,0.0002002293,0.0001447712,0.0001442727],"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.0001431067,0.0001559013,0.00000309142,0.0006725287,0.0001538845,8.388316e-7,0.004895012,0.9886541,0.0002232394,0.0003697023,0.00001329363,0.004715273],"study_design_scores_gemma":[0.0008502657,0.0002339522,0.00001081787,0.0002632117,0.0001875445,0.000006422705,0.001507396,0.9956549,0.0008257658,0.000002924824,0.000045602,0.0004111567],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1158717,0.00005866226,0.881373,0.00002372877,0.0002700998,0.0014803,0.00008573947,0.0007102445,0.0001265301],"genre_scores_gemma":[0.9399115,0.00004050017,0.05908293,0.00002183151,0.0001014855,0.0005027634,0.00008600997,0.0001053044,0.0001477147],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8240398,"threshold_uncertainty_score":0.9998812,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01996212838975903,"score_gpt":0.222176386048137,"score_spread":0.202214257658378,"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."}}