{"id":"W2225208082","doi":"10.1007/s13676-016-0101-4","title":"The vehicle routing problem with hard time windows and stochastic service times","year":2016,"lang":"en","type":"article","venue":"EURO Journal on Transportation and Logistics","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":70,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Montréal; Polytechnique Montréal; Group for Research in Decision Analysis; École de Technologie Supérieure","funders":"","keywords":"Vehicle routing problem; Mathematical optimization; Probabilistic logic; Set (abstract data type); Stochastic dominance; Computer science; Service (business); Dimension (graph theory); Resource constraints; Routing (electronic design automation); Mathematics; Distributed computing; Artificial intelligence; Economics","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001532825,0.001636607,0.001528579,0.0006083113,0.0006627214,0.001923268,0.001882053,0.002021326,0.00364431],"category_scores_gemma":[0.005007684,0.0009713318,0.001335791,0.001424959,0.001151826,0.002902066,0.001246798,0.002015777,0.0003685601],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0015358,"about_ca_system_score_gemma":0.001767637,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005162258,"about_ca_topic_score_gemma":0.003987554,"domain_scores_codex":[0.9981166,0.0006897362,0.00007459481,0.000480777,0.0003063606,0.0003318651],"domain_scores_gemma":[0.9971786,0.002023251,0.0003655676,0.0001169673,0.000135469,0.0001801982],"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.00007476057,0.00004401813,0.0003125316,0.00008829772,0.00004012723,0.0001381046,0.00003883538,0.9287358,0.0008640692,0.05876581,0.0008924964,0.01000519],"study_design_scores_gemma":[0.00002571595,0.0000458317,0.0001616054,0.000007193646,0.00001530457,0.00007171928,0.00002561674,0.9519511,0.000498721,0.04597273,0.001209765,0.00001475033],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05642078,0.0005139536,0.9365079,0.0007813402,0.0001122389,0.000106312,0.0004076843,0.0001664615,0.004983294],"genre_scores_gemma":[0.7731043,0.001170647,0.2095608,0.0003101253,0.0003475359,0.0004020609,0.0007781856,0.0002320137,0.01409433],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005162258,"threshold_uncertainty_score":0.01219147,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01452917871732855,"score_gpt":0.2227213024743448,"score_spread":0.2081921237570163,"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."}}