{"id":"W2277326438","doi":"","title":"The One-Commodity Traveling Salesman Problem with Selective Pickup and Delivery","year":2011,"lang":"en","type":"article","venue":"Document Server@UHasselt (UHasselt)","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Travelling salesman problem; Pickup; 2-opt; Bottleneck traveling salesman problem; Traveling purchaser problem; Computer science; Heuristic; Domain (mathematical analysis); Mathematical optimization; Combinatorial optimization; Operations research; Engineering; Mathematics; Artificial intelligence","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.0007653743,0.0009472517,0.001210503,0.0005663532,0.001065749,0.001624871,0.001772758,0.002049311,0.005723698],"category_scores_gemma":[0.001560815,0.000606126,0.00115049,0.001330334,0.001015072,0.002073468,0.0009037335,0.00116523,0.0007670862],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001025041,"about_ca_system_score_gemma":0.001350073,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002862056,"about_ca_topic_score_gemma":0.002903355,"domain_scores_codex":[0.9994226,0.0001840471,0.00002898668,0.0001513855,0.0001020953,0.0001109319],"domain_scores_gemma":[0.999378,0.0003749753,0.00009643846,0.00004003785,0.00004494014,0.00006571943],"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.0002726509,0.0003065131,0.0007527198,0.0005833445,0.0001707242,0.001252402,0.0002314232,0.7504597,0.002955628,0.1538457,0.01192153,0.07724775],"study_design_scores_gemma":[0.00009565831,0.0002173527,0.0003691266,0.00004179404,0.00007395264,0.000699973,0.0002539606,0.8754367,0.001965595,0.1042891,0.0165141,0.00004263486],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06758884,0.001253624,0.9089603,0.001179095,0.0002725025,0.0003328664,0.0005136185,0.0002491738,0.01964992],"genre_scores_gemma":[0.5725162,0.002591062,0.3816892,0.0004207195,0.0002955071,0.0005265588,0.000906981,0.0002614333,0.04079237],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005723698,"threshold_uncertainty_score":0.01914763,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02399300994395222,"score_gpt":0.2325518958199315,"score_spread":0.2085588858759793,"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."}}