{"id":"W2041485345","doi":"10.1016/j.orl.2005.01.009","title":"The multiple TSP with time windows: vehicle bounds based on precedence graphs","year":2005,"lang":"en","type":"article","venue":"Operations Research Letters","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":33,"is_retracted":false,"has_abstract":false,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Travelling salesman problem; Vehicle routing problem; Combinatorics; Traveling purchaser problem; Mathematics; Computer science; Similarity (geometry); Mathematical optimization; 2-opt; Routing (electronic design automation); Artificial intelligence","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.002675717,0.001688981,0.002272212,0.001886007,0.0008791463,0.002864414,0.003470907,0.001454298,0.005692977],"category_scores_gemma":[0.01481592,0.001204355,0.001339913,0.003676466,0.001190419,0.007366613,0.002331501,0.00409714,0.0006321474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002101915,"about_ca_system_score_gemma":0.002178563,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006973655,"about_ca_topic_score_gemma":0.006856881,"domain_scores_codex":[0.9982677,0.0005232333,0.00006884713,0.000326027,0.0005310047,0.0002831808],"domain_scores_gemma":[0.9913168,0.006754579,0.0005256778,0.0004732709,0.0005378802,0.0003917489],"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.0001456638,0.00005698835,0.0002780394,0.0001588325,0.00004630359,0.0000774392,0.00007452669,0.8258612,0.001179922,0.1266496,0.002430091,0.04304143],"study_design_scores_gemma":[0.00000736507,0.00001860753,0.00008396823,0.00001821015,0.00001672031,0.00002028612,0.00001145507,0.9445199,0.00035314,0.05394768,0.0009948778,0.000007755767],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01186077,0.001407142,0.9803329,0.0004398976,0.000135481,0.00003087373,0.0001232837,0.0001242825,0.00554527],"genre_scores_gemma":[0.6045204,0.005717234,0.3739176,0.0003260957,0.0009672379,0.000222926,0.0004180855,0.0005751824,0.01333525],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.006973655,"threshold_uncertainty_score":0.01904494,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0257977929190062,"score_gpt":0.3082450610410842,"score_spread":0.282447268122078,"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."}}