{"id":"W2886796913","doi":"10.1155/2018/4805250","title":"A Simulation-Based Dynamic Programming Method for Interchange Scheduling of Port Collecting and Distributing Network","year":2018,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Transportation Planning and Optimization","field":"Social Sciences","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Dalian University of Technology; National Natural Science Foundation of China","keywords":"Port (circuit theory); Computer science; Scheduling (production processes); Intersection (aeronautics); Operations research; Flow network; Traffic simulation; Simulation modeling; Network model; Traffic congestion; Dynamic programming; Mathematical optimization; Simulation; Transport engineering; Engineering; Data mining; Algorithm","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.001055196,0.001147692,0.001330067,0.0008446118,0.0007528265,0.001090963,0.001358605,0.001045655,0.004208692],"category_scores_gemma":[0.001502192,0.0008617875,0.001579054,0.0009806472,0.0005765755,0.0007717332,0.001051669,0.00139862,0.0002859917],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001513853,"about_ca_system_score_gemma":0.002723009,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.03072187,"about_ca_topic_score_gemma":0.01801937,"domain_scores_codex":[0.9995182,0.0002006612,0.00002023425,0.00009532938,0.0000900631,0.00007552893],"domain_scores_gemma":[0.9993615,0.0003759724,0.00006366968,0.00001805685,0.0001277316,0.00005317011],"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.00001055698,0.000012096,0.0001028476,0.00001939777,0.000009286486,0.00002195474,0.00001276344,0.9937691,0.0002276012,0.002308434,0.0001499037,0.003356048],"study_design_scores_gemma":[0.000002270087,0.000004418342,0.00001178592,0.000001511306,0.000002193375,0.000001685344,0.000002565689,0.9994681,0.00003230902,0.000345411,0.000126259,0.000001491117],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009155358,0.0001696576,0.9864215,0.0001318523,0.00005135017,0.00007296605,0.00007629251,0.000159062,0.003762065],"genre_scores_gemma":[0.6588395,0.0008074012,0.3316253,0.0001263983,0.0000806765,0.0009946151,0.0004112477,0.0001607628,0.006954153],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.03072187,"threshold_uncertainty_score":0.06108612,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02453397377602992,"score_gpt":0.3675801856748105,"score_spread":0.3430462118987806,"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."}}