{"id":"W136384337","doi":"","title":"A Kohonen-like decomposition method for the traveling salesman problem—KNIES_DECOMPOSE","year":2000,"lang":"en","type":"article","venue":"European Conference on Artificial Intelligence","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":7,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Travelling salesman problem; Euclidean geometry; Partition (number theory); 2-opt; Heuristic; Self-organizing map; Computer science; Mathematical optimization; Bottleneck traveling salesman problem; Decomposition; Artificial neural network; Traveling purchaser problem; Euclidean distance; Mathematics; Algorithm; Artificial intelligence; Combinatorics","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.0004579849,0.0006343627,0.000555634,0.0005262275,0.0005030161,0.000709094,0.0009161007,0.0007893227,0.002606213],"category_scores_gemma":[0.0007915565,0.0003435627,0.0008642771,0.0007225371,0.0003647446,0.001185375,0.0008861945,0.0008668479,0.0005892661],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004261061,"about_ca_system_score_gemma":0.0008741816,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005349743,"about_ca_topic_score_gemma":0.006811308,"domain_scores_codex":[0.9997615,0.0000556503,0.00001432463,0.00003749877,0.0001009211,0.00003012249],"domain_scores_gemma":[0.9998438,0.00005471199,0.00001341317,0.00001625061,0.00005703939,0.00001456518],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"bench_or_experimental","study_design_scores_codex":[0.0001064291,0.0001046447,0.0005274676,0.0002770992,0.0001220662,0.00009947735,0.0001546152,0.5951224,0.008311996,0.0430481,0.005699412,0.3464263],"study_design_scores_gemma":[0.00001286239,0.0000281958,0.0001050133,0.00001222968,0.00001308756,0.00003987808,0.00003350707,0.9837896,0.001399389,0.009125496,0.00542805,0.0000126667],"study_design_candidate":"bench_or_experimental","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004235869,0.0002598801,0.9916825,0.00009520912,0.00007351019,0.00004999792,0.00004280731,0.0001955761,0.003364589],"genre_scores_gemma":[0.1156824,0.0004592243,0.8778563,0.0001253274,0.00005255368,0.000163564,0.0001885323,0.0001074548,0.005364454],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005349743,"threshold_uncertainty_score":0.01063722,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1107698732265577,"score_gpt":0.3762386932067224,"score_spread":0.2654688199801648,"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."}}