{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006143355,0.0007906973,0.0006656044,0.0008690328,0.0005006078,0.0007696801,0.001543463,0.0008311563,0.002368861],"category_scores_gemma":[0.000991854,0.0004911824,0.0009369843,0.001199299,0.0005122247,0.001019247,0.0007326723,0.0009489585,0.0002760821],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001588899,"about_ca_system_score_gemma":0.002334716,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01850903,"about_ca_topic_score_gemma":0.02298577,"domain_scores_codex":[0.9995458,0.0001371496,0.00002074678,0.00008359341,0.0001188485,0.00009389646],"domain_scores_gemma":[0.9996573,0.0001809976,0.00004752033,0.00003500289,0.00004777858,0.0000313862],"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.00001158895,0.0000277723,0.0001274193,0.00003260713,0.00000969262,0.00002863913,0.00001720559,0.9821238,0.0005988062,0.008591687,0.0005252754,0.007905506],"study_design_scores_gemma":[0.000005103961,0.000009212931,0.00002967245,0.000001666639,0.000003739247,0.000004721364,0.000004768297,0.9980218,0.00007077979,0.001584248,0.0002621352,0.000002111629],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0136739,0.0001478384,0.9816057,0.0001256403,0.0000342923,0.0001073464,0.0001283135,0.0002091463,0.003967751],"genre_scores_gemma":[0.3506742,0.00034569,0.6453236,0.0001331188,0.00006534848,0.0003898636,0.0003962071,0.00006723287,0.00260478],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01850903,"threshold_uncertainty_score":0.03680259,"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."}}