{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.00547482,0.0004624678,0.0004991023,0.0005201504,0.001700689,0.001452295,0.004137556,0.0002608816,0.00008784919],"category_scores_gemma":[0.0008339733,0.0002471666,0.0002472939,0.001552184,0.001676265,0.0002277492,0.0007200135,0.001190991,0.00007624862],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001846523,"about_ca_system_score_gemma":0.0007278982,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008500624,"about_ca_topic_score_gemma":0.0001450733,"domain_scores_codex":[0.9942126,0.00014225,0.000956043,0.001422678,0.002422481,0.0008439161],"domain_scores_gemma":[0.9938053,0.003247296,0.0005333537,0.001716647,0.0005682801,0.000129118],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00000170484,0.000008736386,0.00001840949,0.000002084448,0.00001027484,0.00001163214,0.00102845,0.358975,0.0001651202,0.0005770808,0.00001023522,0.6391913],"study_design_scores_gemma":[0.0001096538,0.00003277983,0.00009902832,0.0001898896,0.00002792876,0.0001181276,0.000004432849,0.7776814,0.0003979011,0.2194887,0.001510925,0.0003392605],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0006543483,0.001131642,0.9924485,0.001043406,0.001667381,0.0004366435,0.000006139404,0.00006366024,0.002548262],"genre_scores_gemma":[0.2161081,0.00008327656,0.7797356,0.00127994,0.001635328,0.00001123837,0.000002173556,0.00005555181,0.001088777],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.6388521,"threshold_uncertainty_score":0.999998,"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."}}