{"id":"W2035903817","doi":"10.1016/j.cor.2010.10.019","title":"Online vehicle routing and scheduling with dynamic travel times","year":2010,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":65,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Computer science; Vehicle routing problem; Scheduling (production processes); Operations research; Adaptive routing; Routing (electronic design automation); Dynamic priority scheduling; Distributed computing; Mathematical optimization; Static routing; Computer network; Routing protocol; Engineering; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00287821,0.001391137,0.002497499,0.001087719,0.0007448838,0.002449912,0.00293602,0.001972626,0.005758846],"category_scores_gemma":[0.01041955,0.001950162,0.001148356,0.002299563,0.001298163,0.005177747,0.001927203,0.002521513,0.0007602546],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002147079,"about_ca_system_score_gemma":0.002280998,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006096152,"about_ca_topic_score_gemma":0.004219854,"domain_scores_codex":[0.9982887,0.0007121031,0.00007365987,0.0003845458,0.0003406039,0.0002003343],"domain_scores_gemma":[0.9936539,0.004729457,0.0004931319,0.0004913427,0.0003825092,0.0002497316],"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.0002022352,0.0001309961,0.000264066,0.00007516819,0.00003523009,0.0000559485,0.00003717467,0.9401073,0.0004106399,0.03319004,0.001452798,0.02403842],"study_design_scores_gemma":[0.000009859484,0.00001053769,0.00003129387,0.000002090166,0.000005339839,0.000006394474,0.000003995512,0.9900317,0.00008745409,0.009572873,0.0002355586,0.000002923268],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01915316,0.0003169217,0.9768412,0.0003326676,0.0001478236,0.00005879131,0.0001381466,0.0002281226,0.002783276],"genre_scores_gemma":[0.7059035,0.000780239,0.274707,0.0001731288,0.0005025572,0.0003585205,0.0004677179,0.0003638761,0.01674354],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006096152,"threshold_uncertainty_score":0.01926529,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02958572442583442,"score_gpt":0.343052482940414,"score_spread":0.3134667585145796,"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."}}