{"id":"W2023470442","doi":"10.1016/j.ejor.2015.01.020","title":"The discrete time window assignment vehicle routing problem","year":2015,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":80,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal; Group for Research in Decision Analysis","funders":"","keywords":"Column generation; Vehicle routing problem; Heuristics; Mathematical optimization; Computer science; Set (abstract data type); Window (computing); Routing (electronic design automation); Assignment problem; 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.01795121,0.00009684251,0.0001171175,0.0001055046,0.0003606543,0.0003966055,0.0004551941,0.00001817228,0.00005028325],"category_scores_gemma":[0.001220598,0.0000662759,0.00005075838,0.0002942375,0.00009143251,0.0002823108,0.0001061307,0.000626408,0.0002536514],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002063204,"about_ca_system_score_gemma":0.0001960196,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":8.262238e-7,"about_ca_topic_score_gemma":2.578404e-7,"domain_scores_codex":[0.9958614,0.001961543,0.0005173677,0.00009881832,0.001236104,0.0003247329],"domain_scores_gemma":[0.9981033,0.000490401,0.00007216857,0.0001653073,0.000934299,0.0002345582],"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.00005253922,0.0000224419,0.0004473401,0.000006546913,0.00006860901,0.00007160947,0.0009067024,0.9561093,0.01261311,0.001223246,0.01683187,0.01164664],"study_design_scores_gemma":[0.002327743,0.0007227878,0.005662506,0.0002032104,0.00001714026,0.0002305293,0.0008616296,0.9053153,0.005784046,0.0005031106,0.07799669,0.0003753235],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2289385,0.002505673,0.402839,0.01552808,0.001322572,0.001151169,0.00001809973,0.0002746469,0.3474223],"genre_scores_gemma":[0.9583502,0.00004397077,0.03855204,0.00003507115,0.0006543399,0.000002491975,0.000002989999,0.0000596454,0.002299177],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7294118,"threshold_uncertainty_score":0.6221566,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07976025754685145,"score_gpt":0.3489772778608871,"score_spread":0.2692170203140356,"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."}}