{"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":"codex-gemma-dda1882f352a","candidate_categories":["sts"],"consensus_categories":[],"category_scores_codex":[0.001317726,0.00009031039,0.00008453239,0.00004348825,0.002060464,0.0002145895,0.0005576064,0.00003380801,0.00001442725],"category_scores_gemma":[0.00009850334,0.00007529458,0.00004755843,0.0001942368,0.0002683876,0.0005496269,0.000004840905,0.00008950695,0.000003874291],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004776917,"about_ca_system_score_gemma":0.00007423032,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003646477,"about_ca_topic_score_gemma":0.0001343094,"domain_scores_codex":[0.9990084,0.000008874435,0.0002112476,0.0001925011,0.0002425281,0.0003364204],"domain_scores_gemma":[0.9991996,0.0001124257,0.00007099321,0.000399649,0.0001451226,0.00007221122],"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.000004127277,0.000006949548,0.002411881,0.00003290678,0.000009682079,4.675829e-7,0.002109697,0.9484696,0.02410659,0.00613197,0.00006073531,0.01665539],"study_design_scores_gemma":[0.0003113041,0.00001180143,0.1395579,0.00002059254,0.00002803884,7.644161e-7,0.0001847646,0.8511314,0.007106533,0.000561498,0.0009275441,0.0001579049],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.1008867,0.0000523836,0.8966448,0.0005443223,0.000320013,0.0003850065,0.00004156405,0.0002122475,0.0009129056],"genre_scores_gemma":[0.9490167,0.00002166771,0.05072149,0.00002328024,0.00004537435,0.00005554898,0.000005180091,0.00001681233,0.00009396807],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.84813,"threshold_uncertainty_score":0.9992387,"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."}}