{"id":"W2478279759","doi":"","title":"A hybrid genetic algorithm for the Generalized Traveling Salesman Problem","year":2001,"lang":"en","type":"article","venue":"Genetic and Evolutionary Computation Conference","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université de Montréal","funders":"","keywords":"Travelling salesman problem; Heuristics; Vertex (graph theory); Bottleneck traveling salesman problem; Algorithm; Computer science; Benchmark (surveying); Genetic algorithm; 2-opt; Lin–Kernighan heuristic; Mathematical optimization; Selection (genetic algorithm); Christofides algorithm; Mathematics; Graph; Combinatorics; Theoretical computer science; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004621443,0.000759962,0.0008080836,0.0008219872,0.0004651463,0.001055293,0.001344169,0.001354603,0.002557687],"category_scores_gemma":[0.0009284716,0.0002806901,0.0006994135,0.001136029,0.0005186437,0.0008007037,0.0006902589,0.0007588291,0.0006192789],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000619554,"about_ca_system_score_gemma":0.0009622615,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005043777,"about_ca_topic_score_gemma":0.004428652,"domain_scores_codex":[0.9996618,0.00008515753,0.00001230147,0.00006894682,0.0001304512,0.00004137525],"domain_scores_gemma":[0.9998291,0.00007989284,0.0000161142,0.00001545319,0.00004634615,0.00001313533],"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.00007178526,0.00008195829,0.0004829481,0.000101667,0.0001004881,0.0001684829,0.00008030495,0.7872042,0.004989726,0.0350049,0.003527814,0.1681857],"study_design_scores_gemma":[0.00003543818,0.00005978982,0.0001268691,0.00001270028,0.00002571312,0.0000826454,0.00001604775,0.9852188,0.0007812216,0.007465176,0.006162648,0.00001290909],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01407108,0.0008285152,0.9758675,0.000180037,0.0001133439,0.00009141234,0.00006562075,0.0005898668,0.008192572],"genre_scores_gemma":[0.2742144,0.001067854,0.7116601,0.0002733744,0.00008755353,0.0003897352,0.0003413065,0.0001575953,0.01180809],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005043777,"threshold_uncertainty_score":0.01002884,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03526207476254649,"score_gpt":0.2775623342991926,"score_spread":0.2423002595366461,"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."}}