{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007643418,0.00008659843,0.00008892392,0.00004752437,0.0003061781,0.00006064938,0.0001980217,0.00003213076,0.000003905792],"category_scores_gemma":[0.00003875691,0.00007584882,0.00002666514,0.0003709302,0.0001914026,0.0002208274,0.000002425175,0.0000945494,0.000002099471],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004370357,"about_ca_system_score_gemma":0.00006698161,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001940325,"about_ca_topic_score_gemma":0.00005246175,"domain_scores_codex":[0.9991707,0.000007581678,0.0002215447,0.0001742379,0.0002300202,0.0001959373],"domain_scores_gemma":[0.9995083,0.0001403622,0.00003564102,0.0001400246,0.000115914,0.00005981568],"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.000003827879,0.000008951968,0.0005496281,0.0000431767,0.000004995566,3.010622e-7,0.001892517,0.9817227,0.00414628,0.006998509,0.000004364532,0.00462481],"study_design_scores_gemma":[0.001565222,0.00006959094,0.1625255,0.0001041815,0.0001129801,0.00000422445,0.000493119,0.7989179,0.02636436,0.008659879,0.0006633278,0.000519663],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2177409,0.00005179268,0.7814001,0.0001774921,0.0001107029,0.0002378804,0.0000177541,0.0001493782,0.0001140653],"genre_scores_gemma":[0.7581933,0.00004827248,0.2416493,0.00004179712,0.00002361908,0.00001868137,0.000006322146,0.00001148584,0.000007167987],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5404525,"threshold_uncertainty_score":0.3093025,"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."}}