{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001464405,0.0005401965,0.000474221,0.0001237999,0.0006627008,0.0003134135,0.0005327933,0.0002152222,0.00006257144],"category_scores_gemma":[0.0000495503,0.0004446032,0.00009946901,0.0006017128,0.0001512406,0.0007411088,0.0001398828,0.00064636,0.00003311215],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002939363,"about_ca_system_score_gemma":0.00009610961,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002658785,"about_ca_topic_score_gemma":0.0005661709,"domain_scores_codex":[0.9970523,0.0003337751,0.0006275464,0.0006069795,0.0005363081,0.0008431125],"domain_scores_gemma":[0.9982725,0.000344285,0.0001931094,0.0006731468,0.0002535478,0.0002634336],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"observational","study_design_gemma":"observational","study_design_scores_codex":[0.002859132,0.002622562,0.3676053,0.003906538,0.01078554,0.000341008,0.07447123,0.29753,0.01517855,0.1037255,0.01032537,0.1106493],"study_design_scores_gemma":[0.02045495,0.003974053,0.4648234,0.002248267,0.002466808,0.000561398,0.007126534,0.3112741,0.1151934,0.04549629,0.01520041,0.01118037],"study_design_candidate":"observational","study_design_consensus":"observational","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.941599,0.0006160773,0.04675764,0.0002416564,0.0003214938,0.001302326,0.0000143252,0.00123158,0.007915935],"genre_scores_gemma":[0.9313828,0.0003976673,0.06750757,0.00008632482,0.0001056877,0.0001384232,0.00002517114,0.0001420877,0.0002142064],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1000149,"threshold_uncertainty_score":0.9998006,"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."}}