{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001360796,0.001536473,0.0009417151,0.0006821176,0.000533435,0.001315625,0.001554932,0.0009957806,0.003345847],"category_scores_gemma":[0.002371626,0.0006424185,0.001085229,0.001177763,0.0008258255,0.001486133,0.0008154523,0.001155706,0.0003675254],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002185393,"about_ca_system_score_gemma":0.00252961,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01212627,"about_ca_topic_score_gemma":0.01299397,"domain_scores_codex":[0.9991143,0.0003949885,0.00003023433,0.0001492142,0.00017523,0.0001360376],"domain_scores_gemma":[0.9991754,0.0004310916,0.0001586166,0.00004081762,0.0001228585,0.00007123452],"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.00002094387,0.00001421345,0.0001243687,0.00003351271,0.00001148694,0.00003646703,0.00002015075,0.9865775,0.0004501685,0.008269935,0.0002769998,0.004164329],"study_design_scores_gemma":[0.00000588803,0.00002106153,0.00002688667,0.000004343205,0.000005544548,0.000007310817,0.00001273409,0.9961272,0.0002043411,0.002939156,0.0006429035,0.00000271583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02562311,0.0002377694,0.970709,0.0001637774,0.00005581951,0.00007814532,0.0001339831,0.0001196756,0.002878661],"genre_scores_gemma":[0.6103793,0.0007714945,0.3792729,0.0001310377,0.00008026573,0.0004292341,0.0005538896,0.0001888249,0.008192995],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01212627,"threshold_uncertainty_score":0.02411139,"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."}}