{"id":"W2754261999","doi":"10.1287/trsc.2017.0771","title":"Exact Solutions for the Carrier–Vehicle Traveling Salesman Problem","year":2017,"lang":"en","type":"article","venue":"Transportation Science","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":35,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal","funders":"Università di Bologna; Ministero dell’Istruzione, dell’Università e della Ricerca","keywords":"Travelling salesman problem; Range (aeronautics); Computer science; Mathematical optimization; A priori and a posteriori; Integer programming; Vehicle routing problem; Traveling purchaser problem; Integer (computer science); Conic section; 2-opt; Algorithm; Engineering; Mathematics; Routing (electronic design automation); Computer network; Aerospace engineering","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.001258789,0.001352115,0.001233961,0.0009332511,0.0007422422,0.001823403,0.001412726,0.002019414,0.01308605],"category_scores_gemma":[0.005472964,0.0005733083,0.0008252626,0.001599941,0.0007555118,0.001464987,0.00101924,0.001644715,0.001433766],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001589591,"about_ca_system_score_gemma":0.002478641,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01195341,"about_ca_topic_score_gemma":0.01170598,"domain_scores_codex":[0.9993523,0.0002248049,0.00002647272,0.0001168332,0.0001504506,0.0001291618],"domain_scores_gemma":[0.9979212,0.001568913,0.0001487573,0.00007760055,0.0002128762,0.00007081423],"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.00004483697,0.00008096395,0.0003460958,0.0001678222,0.00002610414,0.00007680499,0.00005143487,0.9115151,0.0002150318,0.04972392,0.006480691,0.0312711],"study_design_scores_gemma":[0.00001208322,0.00001532627,0.0000555853,0.00001241467,0.000005265263,0.00001379352,0.00002741948,0.9763782,0.00007643212,0.02191612,0.001482842,0.000004408936],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02409805,0.001594097,0.9341713,0.0009895745,0.0001828131,0.0001879401,0.0005566215,0.0003927805,0.03782688],"genre_scores_gemma":[0.4143894,0.001724152,0.5619488,0.0003558188,0.0002460037,0.0005232155,0.001317216,0.0003382075,0.01915718],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01308605,"threshold_uncertainty_score":0.04377723,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0518667728935645,"score_gpt":0.3175971464896225,"score_spread":0.2657303735960579,"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."}}