{"id":"W1605222863","doi":"10.1007/3-540-45153-6_30","title":"Solving the Traveling Salesman Problem Using the Enhanced Genetic Algorithm","year":2001,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Guelph","funders":"","keywords":"Travelling salesman problem; Computer science; Extension (predicate logic); Genetic algorithm; Graph; Constraint (computer-aided design); Constraint satisfaction problem; Algorithm; Mathematical optimization; Theoretical computer science; Artificial intelligence; Machine learning; Mathematics","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.0003140428,0.0004275269,0.0005733236,0.0003872032,0.0002627772,0.0006129707,0.0009122412,0.0008692494,0.002522808],"category_scores_gemma":[0.0009684823,0.000226039,0.0006223216,0.000653053,0.0002250513,0.0007685181,0.0004399368,0.0008404828,0.0004108092],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002904182,"about_ca_system_score_gemma":0.0008479814,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003107529,"about_ca_topic_score_gemma":0.002649328,"domain_scores_codex":[0.9998573,0.00003802674,0.000006180592,0.00002192799,0.00005038776,0.00002614414],"domain_scores_gemma":[0.9998388,0.00007922495,0.00001512408,0.00002122778,0.00003671535,0.000008853083],"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.00008157915,0.0001144176,0.000459291,0.0001651114,0.00007356438,0.0001398399,0.00007480536,0.7597404,0.01155297,0.02663341,0.002611338,0.1983533],"study_design_scores_gemma":[0.00002329571,0.00003777222,0.0001618511,0.00001191418,0.00002569576,0.00006170732,0.00001421272,0.9869968,0.002229552,0.007867064,0.002564181,0.000005955263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06678326,0.0007003626,0.9192631,0.0002098334,0.0001034046,0.00007019731,0.00005604367,0.0005080607,0.0123057],"genre_scores_gemma":[0.3111614,0.0008737171,0.680382,0.00008421954,0.00005816274,0.00009955336,0.0001797876,0.0001045928,0.00705651],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003107529,"threshold_uncertainty_score":0.0084396,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0795154929231639,"score_gpt":0.3358123765656945,"score_spread":0.2562968836425306,"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."}}