{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001464343,0.0001400779,0.0001420043,0.00002764947,0.0001688468,0.00005949319,0.0001477689,0.00009175116,0.00002067487],"category_scores_gemma":[0.00003545981,0.00009918712,0.00003972361,0.0002326548,0.00003220301,0.00008250477,0.00002233783,0.0002010361,0.000005829574],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004364214,"about_ca_system_score_gemma":0.00001087578,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000671627,"about_ca_topic_score_gemma":0.000008664168,"domain_scores_codex":[0.9990476,0.00003569844,0.0002432423,0.0001333097,0.0001253586,0.0004147448],"domain_scores_gemma":[0.9988293,0.0007980864,0.0000510848,0.0002091379,0.00006164307,0.00005072776],"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.00002061702,0.000004644457,0.0009512951,0.0000198524,0.0000327501,0.000001018293,0.0003846597,0.9764391,0.00006432827,0.0005603373,0.0006383513,0.0208831],"study_design_scores_gemma":[0.0003688293,0.00003625278,0.0007810053,0.00004890688,0.00002180089,0.000003831012,0.0001297569,0.9960519,0.0001862417,0.00005633071,0.002159784,0.0001553238],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00809129,0.0002803571,0.9871503,0.00006670962,0.0001333985,0.0004323476,0.000002452995,0.0004503221,0.003392787],"genre_scores_gemma":[0.8652211,0.00001432997,0.1333654,0.0001533693,0.0006008209,0.00004691535,0.0000110345,0.00008351586,0.0005035159],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8571298,"threshold_uncertainty_score":0.4044733,"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."}}