{"id":"W1988416901","doi":"10.1016/j.cor.2008.08.010","title":"Dynamic window reduction for the multiple depot vehicle scheduling problem with time windows","year":2008,"lang":"en","type":"article","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":36,"is_retracted":false,"has_abstract":false,"ca_institutions":"Group for Research in Decision Analysis; Polytechnique Montréal; Kronos (Canada)","funders":"","keywords":"Computer science; Depot; Scheduling (production processes); Reduction (mathematics); Mathematical optimization; Window (computing); Dynamic programming; Real-time computing; Algorithm; Mathematics; Operating system","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.0007198519,0.000758896,0.001107597,0.0004217292,0.0003647444,0.0007780174,0.001148243,0.0004829694,0.002076803],"category_scores_gemma":[0.001768459,0.0004391531,0.0007352568,0.0006562577,0.0003356593,0.00143299,0.0007394602,0.001332347,0.0002478775],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004878954,"about_ca_system_score_gemma":0.0009121465,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003647811,"about_ca_topic_score_gemma":0.002286384,"domain_scores_codex":[0.9995944,0.0001038862,0.00001643399,0.00007883045,0.0001136333,0.00009279147],"domain_scores_gemma":[0.9994062,0.0004042797,0.00005002468,0.00004429976,0.00005273777,0.00004240931],"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.0003896515,0.0001727022,0.000297207,0.0002082652,0.0000746376,0.00009881145,0.00007970814,0.8400124,0.009824369,0.0370386,0.003985314,0.1078182],"study_design_scores_gemma":[0.00001628713,0.00003336609,0.0001058128,0.000003965033,0.00001405445,0.00001276948,0.00001068258,0.9896454,0.001029598,0.008380503,0.0007424147,0.000005207328],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03251944,0.0006690056,0.9638925,0.0002130105,0.0001197268,0.00004934051,0.000100752,0.0001894666,0.002246724],"genre_scores_gemma":[0.7222114,0.001420099,0.2673352,0.00009464018,0.0002701149,0.0002499307,0.0003780574,0.0002333193,0.007807198],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003647811,"threshold_uncertainty_score":0.00725317,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04590354069195404,"score_gpt":0.3203809419870968,"score_spread":0.2744774012951428,"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."}}