{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003709665,0.0005794162,0.000687999,0.0004202849,0.0004505977,0.000939314,0.001169911,0.0009271319,0.001385494],"category_scores_gemma":[0.000953272,0.0003766093,0.0006302098,0.0008414736,0.0006279973,0.000979907,0.0007318851,0.0009150786,0.0002362608],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005744545,"about_ca_system_score_gemma":0.0008803504,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003712106,"about_ca_topic_score_gemma":0.003568789,"domain_scores_codex":[0.9997603,0.00008879399,0.000009804656,0.0000396067,0.00007025462,0.00003132016],"domain_scores_gemma":[0.9997525,0.00013816,0.0000361294,0.00001840651,0.00002838689,0.00002653246],"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.0000270633,0.00004677211,0.000255301,0.00006559904,0.00002176572,0.0001777696,0.00005894763,0.9385284,0.001567109,0.03285747,0.001287722,0.025106],"study_design_scores_gemma":[0.000006306037,0.00001562539,0.00003524202,0.00000309482,0.00000599449,0.0000395269,0.00001398882,0.9928426,0.000232824,0.005751819,0.001048901,0.000004152583],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02740706,0.0007704975,0.9627011,0.0005199108,0.00008192558,0.00008771044,0.00004270318,0.0001285559,0.008260457],"genre_scores_gemma":[0.529601,0.001735664,0.4598041,0.0001586304,0.00009397383,0.0002018525,0.00009633217,0.00009489396,0.008213541],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003712106,"threshold_uncertainty_score":0.007381022,"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."}}