{"id":"W2023445393","doi":"10.1287/trsc.1030.0086","title":"Heuristics for the One-Commodity Pickup-and-Delivery Traveling Salesman Problem","year":2004,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":133,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Ministerio de Ciencia y Tecnología; Canada Research Chairs","keywords":"Travelling salesman problem; Pickup; Heuristics; Traveling purchaser problem; Mathematical optimization; Heuristic; Product (mathematics); Computer science; Greedy algorithm; 2-opt; Vehicle routing problem; Commodity; Mathematics; Operations research; Routing (electronic design automation); Economics; Artificial intelligence","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.00102837,0.001271841,0.0012706,0.001158383,0.0006972944,0.001416612,0.001790011,0.001388228,0.003647356],"category_scores_gemma":[0.002383335,0.0006112992,0.0009877764,0.001989495,0.0007982901,0.001328222,0.0008529295,0.001191481,0.0006730735],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001431886,"about_ca_system_score_gemma":0.001923998,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004066788,"about_ca_topic_score_gemma":0.006131396,"domain_scores_codex":[0.9992124,0.0003578773,0.00003651244,0.0001197161,0.0001322935,0.0001410637],"domain_scores_gemma":[0.9989532,0.0007247505,0.0001317627,0.00006525454,0.00006147003,0.00006358718],"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.0001219601,0.0002067229,0.0003809801,0.000472181,0.0000659303,0.0002792078,0.0001592326,0.8509044,0.001080163,0.05833139,0.006666752,0.0813311],"study_design_scores_gemma":[0.0001702311,0.0001697704,0.0002571151,0.00007030518,0.0000620053,0.0002670323,0.0001356039,0.9447488,0.001236844,0.04140772,0.0114358,0.00003870775],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0299332,0.00294831,0.9526279,0.000423975,0.0001862874,0.0005491455,0.0002569969,0.0007802333,0.01229395],"genre_scores_gemma":[0.2735389,0.003059962,0.716356,0.0003030505,0.0001633649,0.000457173,0.0004645157,0.0002050873,0.005451963],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004066788,"threshold_uncertainty_score":0.01220161,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03870615525915687,"score_gpt":0.2777857777228835,"score_spread":0.2390796224637266,"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."}}