{"id":"W648203179","doi":"","title":"Scheduled service network design with synchronization and transshipment constraints for intermodal container transportation networks","year":2012,"lang":"en","type":"article","venue":"Data Archiving and Networked Services (DANS)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":84,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; Université de Montréal; Compute Canada; Université du Québec à Montréal","keywords":"Container (type theory); Transshipment (information security); Computer science; Service (business); Network planning and design; Routing (electronic design automation); Vehicle routing problem; Operations research; Solver; Integer programming; Flow network; Transport engineering; Computer network; Mathematical optimization; Engineering; Business","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.0009990325,0.0003086335,0.0003055884,0.0000515197,0.0002422024,0.0001045477,0.0003002534,0.0001059667,0.000007580159],"category_scores_gemma":[0.00000511552,0.0002817271,0.0000192471,0.0002580202,0.00007805925,0.0005769923,0.00003776377,0.0001937025,5.062161e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002609917,"about_ca_system_score_gemma":0.00001652176,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002712797,"about_ca_topic_score_gemma":0.0003104646,"domain_scores_codex":[0.9983857,0.0001746669,0.0003585153,0.0003660393,0.0001311673,0.0005839616],"domain_scores_gemma":[0.9988522,0.0004364054,0.0000928956,0.0003633289,0.00004748015,0.0002077232],"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.0001453633,0.0000190093,0.01467071,0.0003992674,0.0001374638,0.00000104195,0.002544755,0.9613111,0.00009325078,0.0001900862,0.00003036422,0.02045758],"study_design_scores_gemma":[0.0009489392,0.00005184015,0.01897521,0.0003925329,0.0001735597,0.00001541223,0.0003859252,0.978476,0.00002285722,0.00004256527,0.0001775723,0.0003376159],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.09196141,0.0007119815,0.9061502,0.00004266505,0.0001558829,0.0005799527,0.00009907216,0.0002394247,0.00005940023],"genre_scores_gemma":[0.8058284,0.0002010508,0.1917622,0.000144508,0.0002955242,0.00004922714,0.001647069,0.00006876043,0.000003271268],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.714388,"threshold_uncertainty_score":0.9999635,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0210175494109844,"score_gpt":0.241143561860551,"score_spread":0.2201260124495666,"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."}}