{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.0009053216,0.0001481583,0.0001505648,0.0002014585,0.001380401,0.0001819366,0.0003280011,0.00007645498,0.00001502871],"category_scores_gemma":[0.0001209953,0.0001173072,0.00004710067,0.0007569652,0.0001791344,0.0002852883,0.00006688035,0.0004177402,0.00004786825],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000177026,"about_ca_system_score_gemma":0.0001309734,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003242408,"about_ca_topic_score_gemma":0.00002952434,"domain_scores_codex":[0.9984609,0.0001937289,0.000251187,0.0002876117,0.0003674965,0.0004391037],"domain_scores_gemma":[0.9985127,0.0005343774,0.00001384875,0.0003987256,0.0004511041,0.00008923945],"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.00001959277,0.00002698302,0.0001142222,0.00002079531,0.00004627968,0.000001988292,0.0006829505,0.9786927,0.01384945,0.00004786148,0.0002931434,0.006203999],"study_design_scores_gemma":[0.0006776015,0.00008401829,0.0006000969,0.00003750345,0.000007923545,0.00006220561,0.0001036036,0.9950774,0.002808379,0.00000977344,0.0003832889,0.0001482196],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.185122,0.0001586141,0.8123127,0.0006008228,0.000122112,0.001271696,0.000006074916,0.0002796061,0.0001263148],"genre_scores_gemma":[0.5368422,0.00004800648,0.4623868,0.0000117648,0.00009602004,0.0002364509,0.00002645101,0.00004762553,0.000304705],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.3517202,"threshold_uncertainty_score":0.9999197,"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."}}