{"id":"W3036776288","doi":"10.1287/trsc.2019.0956","title":"Vehicle Routing Problems with Synchronized Visits and Stochastic Travel and Service Times: Applications in Healthcare","year":2020,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":70,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal; Concordia University","funders":"","keywords":"Bounding overwatch; Scheduling (production processes); Mathematical optimization; Vehicle routing problem; Branch and cut; Integer programming; Linear programming; Computer science; Stochastic programming; Travelling salesman problem; Stochastic optimization; Routing (electronic design automation); 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.000258411,0.00009765539,0.0001248085,0.0000701672,0.0001170343,0.00004637014,0.00009250973,0.0000294136,0.000003276293],"category_scores_gemma":[0.00001316662,0.00009505417,0.000005225426,0.001212936,0.00006758164,0.0002894425,0.000003342143,0.0001082892,0.00000125864],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002572335,"about_ca_system_score_gemma":0.00005823691,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005801622,"about_ca_topic_score_gemma":0.0001447659,"domain_scores_codex":[0.9991459,0.00001503671,0.0002032137,0.0002659885,0.0001857951,0.0001841245],"domain_scores_gemma":[0.9996108,0.00005172747,0.00003664478,0.00007694876,0.00008213334,0.0001417899],"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.000009674504,0.000008645619,0.015043,0.0003104383,0.000003836225,0.000001087231,0.01383854,0.9555852,0.01090294,0.001358478,4.420673e-7,0.002937744],"study_design_scores_gemma":[0.0004733916,0.00002694324,0.1389319,0.00005457577,0.000007962713,0.000001329389,0.0006141212,0.8592157,0.000493252,0.00004845635,0.000002801819,0.0001295835],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4727989,0.00009349565,0.5255507,0.001041642,0.000006704358,0.0003554582,0.000008460886,0.0001163225,0.0000282959],"genre_scores_gemma":[0.9772508,0.000009960777,0.02247876,0.0001949814,0.00000739606,0.00003384755,0.000008231839,0.00001457289,0.000001496402],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5044519,"threshold_uncertainty_score":0.3876196,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01807848901507745,"score_gpt":0.258140197037406,"score_spread":0.2400617080223285,"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."}}