{"id":"W2233419640","doi":"10.1016/j.cor.2015.06.001","title":"Time-dependent routing problems: A review","year":2015,"lang":"en","type":"review","venue":"Computers & Operations Research","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":244,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Tree traversal; Arc routing; Computer science; Time horizon; Routing (electronic design automation); Graph traversal; Arc (geometry); Point (geometry); Graph; Vehicle routing problem; Point of interest; Field (mathematics); Operations research; Node (physics); Mathematical optimization; Algorithm; Artificial intelligence; Theoretical computer science; Computer network; 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":["metaepi_narrow","insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.007057812,0.0004816455,0.001596091,0.0006263035,0.0003507756,0.0004139046,0.001069125,0.0003117438,0.0001748317],"category_scores_gemma":[0.0005357014,0.0004447872,0.0002595306,0.001914478,0.0001104723,0.0002242421,0.0004819832,0.001600495,0.002103906],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008609124,"about_ca_system_score_gemma":0.0007726791,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001144982,"about_ca_topic_score_gemma":0.000004378861,"domain_scores_codex":[0.9944676,0.002036219,0.001108988,0.0006078926,0.001026964,0.0007523395],"domain_scores_gemma":[0.9972813,0.0004623408,0.00005084805,0.001038014,0.0008611045,0.0003063548],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[1.445715e-7,0.00001969172,3.531519e-8,0.02285389,0.00009426305,0.000008361607,0.00009095002,0.2189155,3.479218e-7,0.00004302849,0.02378195,0.7341918],"study_design_scores_gemma":[0.00007107875,0.00002023852,1.201e-8,0.03641974,0.00008586357,0.00004334818,0.00000423964,0.3131282,2.660809e-7,0.000002805845,0.6499253,0.0002989029],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[8.2169e-8,0.916354,0.07774267,0.00006758,0.0003270125,0.002510461,0.00002898513,0.0005473095,0.002421875],"genre_scores_gemma":[2.6264e-7,0.9533417,0.04361435,0.00003161877,0.0003353702,0.0005362658,0.0003041401,0.0001906635,0.001645615],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.7338929,"threshold_uncertainty_score":0.9998004,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1917023661751183,"score_gpt":0.4491348750788929,"score_spread":0.2574325089037747,"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."}}