{"id":"https://openalex.org/W2105243294","doi":"https://doi.org/10.1109/ijcnn.2003.1223902","title":"Using adaptive resonance theory and local optimization to divide and conquer large scale traveling salesman problems","display_name":"Using adaptive resonance theory and local optimization to divide and conquer large scale traveling salesman problems","publication_year":2004,"publication_date":"2004-03-22","ids":{"openalex":"https://openalex.org/W2105243294","doi":"https://doi.org/10.1109/ijcnn.2003.1223902","mag":"2105243294"},"language":"en","primary_location":{"id":"doi:10.1109/ijcnn.2003.1223902","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ijcnn.2003.1223902","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Joint Conference on Neural Networks, 2003.","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5001017720","display_name":"Samuel A. Mulder","orcid":"https://orcid.org/0000-0001-9514-7061"},"institutions":[{"id":"https://openalex.org/I76835614","display_name":"University of Missouri","ror":"https://ror.org/02ymw8z06","country_code":"US","type":"education","lineage":["https://openalex.org/I76835614"]},{"id":"https://openalex.org/I20382870","display_name":"Missouri University of Science and Technology","ror":"https://ror.org/00scwqd12","country_code":"US","type":"education","lineage":["https://openalex.org/I20382870"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"S.A. Mulder","raw_affiliation_strings":["Department of Computer Science, University of Missouri, Rolla, Rolla, MO, USA","Dept. of Comput. Sci, Missouri Univ., Rolla, MO, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Missouri, Rolla, Rolla, MO, USA","institution_ids":["https://openalex.org/I20382870"]},{"raw_affiliation_string":"Dept. of Comput. Sci, Missouri Univ., Rolla, MO, USA","institution_ids":["https://openalex.org/I76835614"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5038037619","display_name":"Donald C. Wunsch","orcid":"https://orcid.org/0000-0002-9726-9051"},"institutions":[{"id":"https://openalex.org/I76835614","display_name":"University of Missouri","ror":"https://ror.org/02ymw8z06","country_code":"US","type":"education","lineage":["https://openalex.org/I76835614"]},{"id":"https://openalex.org/I20382870","display_name":"Missouri University of Science and Technology","ror":"https://ror.org/00scwqd12","country_code":"US","type":"education","lineage":["https://openalex.org/I20382870"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D.C. Wunsch","raw_affiliation_strings":["Department of Electrical and Computer Engineering, University of Missouri, Rolla, Rolla, MO, USA","Dept. of Comput. Sci, Missouri Univ., Rolla, MO, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, University of Missouri, Rolla, Rolla, MO, USA","institution_ids":["https://openalex.org/I20382870"]},{"raw_affiliation_string":"Dept. of Comput. Sci, Missouri Univ., Rolla, MO, USA","institution_ids":["https://openalex.org/I76835614"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5001017720"],"corresponding_institution_ids":["https://openalex.org/I20382870","https://openalex.org/I76835614"],"apc_list":null,"apc_paid":null,"fwci":0.4497,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.7539206,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"2","issue":null,"first_page":"1408","last_page":"1411"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12176","display_name":"Optimization and Packing Problems","score":0.996399998664856,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/travelling-salesman-problem","display_name":"Travelling salesman problem","score":0.8206329345703125},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6874642372131348},{"id":"https://openalex.org/keywords/divide-and-conquer-algorithms","display_name":"Divide and conquer algorithms","score":0.6585124731063843},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.6398525238037109},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6390721797943115},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6190109848976135},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5427257418632507},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.4460518956184387},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.43866026401519775},{"id":"https://openalex.org/keywords/field","display_name":"Field (mathematics)","score":0.4148310422897339},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.35665518045425415},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2797011137008667},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.20527738332748413}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8206329345703125},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6874642372131348},{"id":"https://openalex.org/C71559656","wikidata":"https://www.wikidata.org/wiki/Q671298","display_name":"Divide and conquer algorithms","level":2,"score":0.6585124731063843},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.6398525238037109},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6390721797943115},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6190109848976135},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5427257418632507},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.4460518956184387},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.43866026401519775},{"id":"https://openalex.org/C9652623","wikidata":"https://www.wikidata.org/wiki/Q190109","display_name":"Field (mathematics)","level":2,"score":0.4148310422897339},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.35665518045425415},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2797011137008667},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.20527738332748413},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C202444582","wikidata":"https://www.wikidata.org/wiki/Q837863","display_name":"Pure mathematics","level":1,"score":0.0},{"id":"https://openalex.org/C205649164","wikidata":"https://www.wikidata.org/wiki/Q1071","display_name":"Geography","level":0,"score":0.0},{"id":"https://openalex.org/C13280743","wikidata":"https://www.wikidata.org/wiki/Q131089","display_name":"Geodesy","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ijcnn.2003.1223902","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ijcnn.2003.1223902","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the International Joint Conference on Neural Networks, 2003.","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W254889097","https://openalex.org/W1975474393","https://openalex.org/W2042986967","https://openalex.org/W2055569927","https://openalex.org/W2106304233","https://openalex.org/W2140425706","https://openalex.org/W2142171423","https://openalex.org/W2152454054","https://openalex.org/W2165142526","https://openalex.org/W2946046356","https://openalex.org/W6609586712","https://openalex.org/W6680423233","https://openalex.org/W6681078530","https://openalex.org/W6682575781"],"related_works":["https://openalex.org/W4247094814","https://openalex.org/W1525389557","https://openalex.org/W4297427155","https://openalex.org/W3025823153","https://openalex.org/W3136451934","https://openalex.org/W3200006077","https://openalex.org/W2975368677","https://openalex.org/W2170228269","https://openalex.org/W2783065147","https://openalex.org/W4312723892"],"abstract_inverted_index":{"The":[0,107],"traveling":[1],"salesman":[2],"problem":[3,10,40],"(TSP)":[4],"is":[5,25,41,74,119,141,146],"a":[6,91,147],"very":[7,60,101],"hard":[8],"optimization":[9,31,97],"in":[11,63,88],"the":[12,35,49,54,67,94,105,120,127,134],"field":[13],"of":[14,34,93,104,110],"operations":[15],"research.":[16],"It":[17],"has":[18],"been":[19],"shown":[20],"to":[21,99],"be":[22],"NP-complete,":[23],"and":[24,53,62,116,123,144],"an":[26,80],"often-used":[27],"benchmark":[28],"for":[29,66,150],"new":[30],"techniques.":[32],"One":[33],"main":[36],"challenges":[37],"with":[38,90],"this":[39,111],"that":[42,73,82],"standard,":[43],"non-AI":[44],"heuristic":[45],"approaches":[46,118],"such":[47],"as":[48],"Lin-Kernighan":[50,95],"algorithm":[51,81,98,112,135],"(LK)":[52],"chained":[55],"LK":[56,115],"variant":[57,72],"are":[58,136],"currently":[59],"effective":[61],"wide":[64],"use":[65],"common":[68],"fully":[69],"connected,":[70],"Euclidean":[71],"considered":[75],"here.":[76],"This":[77],"paper":[78],"presents":[79],"uses":[83],"adaptive":[84],"resonance":[85],"theory":[86],"(ART)":[87],"combination":[89],"variation":[92],"local":[96],"solve":[100],"large":[102],"instances":[103],"TSP.":[106],"primary":[108],"advantage":[109],"over":[113],"traditional":[114],"chained-LK":[117],"increased":[121],"scalability":[122],"parallelism":[124],"allowed":[125],"by":[126,133],"divide-and-conquer":[128],"clustering":[129],"paradigm.":[130],"Tours":[131],"obtained":[132],"lower":[137],"quality,":[138],"but":[139],"scaling":[140],"much":[142],"better":[143],"there":[145],"high":[148],"potential":[149],"increasing":[151],"performance":[152],"using":[153],"parallel":[154],"hardware.":[155]},"counts_by_year":[{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}