{"id":"W1980495840","doi":"10.1109/cec.2010.5586036","title":"The one-commodity traveling salesman problem with selective pickup and delivery: An ant colony approach","year":2010,"lang":"en","type":"article","venue":"","topic":"Vehicle Routing Optimization Methods","field":"Engineering","cited_by":54,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Travelling salesman problem; Pickup; Computer science; Mathematical optimization; Ant colony optimization algorithms; Heuristic; Spare part; Extremal optimization; Traveling purchaser problem; Convergence (economics); 2-opt; Optimization problem; Artificial intelligence; Engineering; Mathematics; Operations management; Multi-swarm optimization; Economics","routes":{"ca_aff":true,"ca_fund":true,"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.0006252887,0.0001446065,0.0001415041,0.00002875909,0.0002824784,0.0001132351,0.0001439965,0.00009173682,0.000005708627],"category_scores_gemma":[0.0000239675,0.000101087,0.00001462823,0.0001816783,0.00008562856,0.0001563245,0.00002567681,0.0004159659,0.000001485774],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002724,"about_ca_system_score_gemma":0.00003042171,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005205989,"about_ca_topic_score_gemma":0.0004820196,"domain_scores_codex":[0.9991832,0.00008144208,0.0001507027,0.0002066464,0.000129959,0.0002480787],"domain_scores_gemma":[0.9994168,0.0001390469,0.00003085355,0.0002290443,0.00008906024,0.00009514402],"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.0002097273,0.0003914501,0.03717342,0.00023963,0.0004877387,0.000005815854,0.01085888,0.7927605,0.05521272,0.02204135,0.0005664519,0.08005232],"study_design_scores_gemma":[0.0004374087,0.00009430447,0.01213499,0.000008226116,0.0000275169,0.00002748949,0.0002644551,0.9821198,0.004137787,0.0002113878,0.0002900969,0.0002465413],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.7166607,0.00002150421,0.2725286,0.00005123374,0.00005395941,0.0003435588,0.000003051204,0.0004109348,0.009926448],"genre_scores_gemma":[0.6301059,0.00001172337,0.3697277,0.00001561774,0.00003936188,0.00001899017,0.000004639588,0.00002652288,0.0000495685],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.1893593,"threshold_uncertainty_score":0.4122209,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01580826729962245,"score_gpt":0.2290344006878308,"score_spread":0.2132261333882083,"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."}}