{"id":"W4245026044","doi":"10.1002/net.20178","title":"Path inequalities for the vehicle routing problem with time windows","year":2007,"lang":"en","type":"article","venue":"Networks","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":34,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"HEC Montréal; Deakin University","keywords":"Vehicle routing problem; Context (archaeology); Polytope; Path (computing); Travelling salesman problem; Mathematical optimization; Node (physics); Mathematics; Computer science; Dimension (graph theory); Routing (electronic design automation); Combinatorics","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009992522,0.001324908,0.000786669,0.0006504569,0.0004045563,0.001284495,0.000960962,0.0008906599,0.006891374],"category_scores_gemma":[0.003193288,0.000432059,0.0008975352,0.001180958,0.0007965037,0.00238674,0.001180367,0.002769144,0.0004800988],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001262474,"about_ca_system_score_gemma":0.001155192,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003624662,"about_ca_topic_score_gemma":0.002389083,"domain_scores_codex":[0.998955,0.0003746054,0.00004684754,0.0001718149,0.0003120634,0.0001396587],"domain_scores_gemma":[0.9985381,0.00103588,0.0001737326,0.00004701974,0.0001510093,0.00005410917],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00008910927,0.00007512768,0.000390515,0.0002043554,0.00004059817,0.0001825219,0.0001148418,0.737681,0.002621474,0.2153461,0.003256536,0.03999772],"study_design_scores_gemma":[0.00002764478,0.00005325022,0.0001912345,0.00002899138,0.00001312128,0.00005762227,0.00003651028,0.907607,0.0007254258,0.08585183,0.005396609,0.00001085676],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02228858,0.000714522,0.96676,0.0004651395,0.00009285922,0.0001272438,0.0002956539,0.00007884897,0.009177327],"genre_scores_gemma":[0.5388077,0.00284515,0.4412655,0.0003040046,0.0003459468,0.0009219249,0.001181212,0.0001772802,0.01415128],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006891374,"threshold_uncertainty_score":0.02305394,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01413964396293443,"score_gpt":0.2414425082797293,"score_spread":0.2273028643167949,"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."}}