{"id":"W3181596661","doi":"10.1287/trsc.2022.1176","title":"Exponential-Size Neighborhoods for the Pickup-and-Delivery Traveling Salesman Problem","year":2022,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Travelling salesman problem; Pickup; Metaheuristic; Computer science; Vehicle routing problem; Mathematical optimization; Combinatorial optimization; Routing (electronic design automation); Traveling purchaser problem; Heuristic; 2-opt; Mathematics; Artificial intelligence; Computer network","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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001219824,0.00009160808,0.00008899943,0.00005783864,0.0007275656,0.00005858074,0.0002781405,0.00001688256,0.00007142961],"category_scores_gemma":[0.00003011222,0.0000836348,0.0000377979,0.0006017477,0.0001220127,0.0002271063,0.000007977354,0.0001209151,9.153301e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004396879,"about_ca_system_score_gemma":0.00006178426,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000139243,"about_ca_topic_score_gemma":0.000009805669,"domain_scores_codex":[0.9989491,0.00002411739,0.0002424566,0.0002190642,0.0003433714,0.0002219124],"domain_scores_gemma":[0.9994064,0.0002818147,0.00004459678,0.0001485753,0.00006559826,0.00005302326],"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.00001000534,0.000008867509,0.001082684,0.00002865651,0.000008337674,6.061478e-7,0.003543803,0.9621581,0.02102011,0.002609164,0.00003389177,0.009495721],"study_design_scores_gemma":[0.000656446,0.00005106009,0.05900558,0.00001012609,0.00005149904,0.000004570145,0.001334376,0.9310091,0.005120205,0.0006980069,0.001790231,0.0002688216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3209714,0.0001645233,0.677252,0.0002432969,0.000365758,0.0004616447,0.0000332371,0.0002371643,0.0002709334],"genre_scores_gemma":[0.9263094,0.00003220712,0.07333547,0.00007872069,0.0000262483,0.0001359484,0.000007475953,0.00001892501,0.00005558871],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.605338,"threshold_uncertainty_score":0.559592,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02026834478762276,"score_gpt":0.2571430720023677,"score_spread":0.236874727214745,"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."}}