{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.000969794,0.001603336,0.002386082,0.003050872,0.0003461133,0.001875827,0.001692825,0.001460462,0.004582291],"category_scores_gemma":[0.0017567,0.0007447791,0.001038897,0.005805187,0.0005710446,0.002776269,0.001047698,0.001425451,0.001823466],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005932989,"about_ca_system_score_gemma":0.00193281,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001770032,"about_ca_topic_score_gemma":0.002598157,"domain_scores_codex":[0.9996295,0.00005033829,0.00006048954,0.00008698458,0.0001424803,0.00003009606],"domain_scores_gemma":[0.9990308,0.0005655774,0.0001073679,0.00003195762,0.000217686,0.00004656339],"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":[0.00006852335,0.000159393,0.0003276085,0.03108327,0.0002114556,0.0001009877,0.00004657067,0.004867695,0.0009088966,0.008222591,0.03076406,0.9232389],"study_design_scores_gemma":[0.00005191172,0.0002086288,0.00117921,0.01049597,0.0006453964,0.0008933257,0.0001484862,0.004063651,0.0009353583,0.01234947,0.9689311,0.00009751473],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"review","genre_gemma":"review","genre_scores_codex":[0.0002080859,0.9966454,0.001757949,0.0001615381,0.0002293608,0.00000893683,0.00004057201,0.00001427219,0.0009338382],"genre_scores_gemma":[0.001045633,0.9966034,0.001507922,0.00009380416,0.0002326729,0.000008369528,0.00005949338,0.000004311938,0.0004444055],"genre_candidate":"review","genre_consensus":"review","teacher_disagreement_score":0.004582291,"threshold_uncertainty_score":0.0153293,"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."}}