{"id":"W3187917979","doi":"10.1016/j.cor.2021.105511","title":"The transit time constrained fixed charge multi-commodity network design problem","year":2021,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Urban and Freight Transport Logistics","field":"Engineering","cited_by":16,"is_retracted":false,"has_abstract":false,"ca_institutions":"HEC Montréal; Group for Research in Decision Analysis; Concordia University","funders":"","keywords":"Solver; Fixed charge; Mathematical optimization; Network planning and design; Flow network; Computer science; Path (computing); Set (abstract data type); Integer programming; Integer (computer science); Commodity; Mathematics","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0008281494,0.0001467023,0.0001726694,0.00005115471,0.0009067332,0.0003135413,0.0003438345,0.00009075338,0.0001673712],"category_scores_gemma":[0.00002977174,0.000121496,0.00006510955,0.000531501,0.0002553634,0.00009075901,0.00003452195,0.0005361296,0.0002481774],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007254793,"about_ca_system_score_gemma":0.0001815509,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009619002,"about_ca_topic_score_gemma":0.0001143017,"domain_scores_codex":[0.9983389,0.0002908115,0.0002728546,0.000230722,0.000297221,0.0005694304],"domain_scores_gemma":[0.9987136,0.0004266588,0.000005075998,0.0003950273,0.0003220173,0.0001376213],"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.000009277535,0.0000805827,0.00002310816,0.00002601231,0.0001023847,0.00007227615,0.0004083457,0.9367988,0.003094832,0.005978615,0.04875349,0.004652303],"study_design_scores_gemma":[0.0004223055,0.00003205884,0.0001329898,0.00002788025,0.000008627597,0.00001135797,0.00001752532,0.9815485,0.001365964,0.0001097461,0.01617015,0.0001529184],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0005264482,0.0009084271,0.9951991,0.000845294,0.0002898956,0.0005303443,0.0000394409,0.0002229927,0.001438027],"genre_scores_gemma":[0.6478718,0.0009021163,0.3440843,0.0001661196,0.0007851179,0.0002424089,0.0004881744,0.0001118484,0.005348145],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6511149,"threshold_uncertainty_score":0.697395,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1085132087749521,"score_gpt":0.2885765261306434,"score_spread":0.1800633173556913,"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."}}