{"id":"https://openalex.org/W2037241235","doi":"https://doi.org/10.1002/scj.4690230209","title":"Self\u2010organizing neural networks and various euclidean traveling salesman problems","display_name":"Self\u2010organizing neural networks and various euclidean traveling salesman problems","publication_year":1992,"publication_date":"1992-01-01","ids":{"openalex":"https://openalex.org/W2037241235","doi":"https://doi.org/10.1002/scj.4690230209","mag":"2037241235"},"language":"en","primary_location":{"id":"doi:10.1002/scj.4690230209","is_oa":false,"landing_page_url":"https://doi.org/10.1002/scj.4690230209","pdf_url":null,"source":{"id":"https://openalex.org/S58208175","display_name":"Systems and Computers in Japan","issn_l":"0882-1666","issn":["0882-1666","1520-684X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Systems and Computers in Japan","raw_type":"journal-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/A5004156746","display_name":"Yasuo Matsuyama","orcid":"https://orcid.org/0000-0002-0819-9240"},"institutions":[{"id":"https://openalex.org/I65143321","display_name":"Hitachi (Japan)","ror":"https://ror.org/02exqgm79","country_code":"JP","type":"company","lineage":["https://openalex.org/I65143321"]},{"id":"https://openalex.org/I6178835","display_name":"Ibaraki University","ror":"https://ror.org/00sjd5653","country_code":"JP","type":"education","lineage":["https://openalex.org/I6178835"]}],"countries":["JP"],"is_corresponding":true,"raw_author_name":"Yasuo Matsuyama","raw_affiliation_strings":["Information Engineering Department, Faculty of Engineering, Ibaraki University, Hitachi, Japan 316","Yasuo Matsuyama:  received a B.S. in Electrical Engineering from Soowa University in 1969. He completed the Doctoral Program there in 1974. He entered the Japan Teachers Exchange Program (Stanford University) the same year. He became a teaching assistant there in 1977. He completed the Doctoral program there in 1978. Currently, he is Professor of Information Engineering at Ibaraki University. He conducts research related to Information and Computer Engineering. He translated VLSI Design Menu, Microcomputer Dictionary, The C Language and UNIX, Fundamentals of CMOS VLSI Design, and The C Language/Digital Symbol Processing. He is a member of the ACM, IEEE, INNS, the Information Processing Society, the Neural Networks Society, and the Information Theory and Applications Society"],"affiliations":[{"raw_affiliation_string":"Information Engineering Department, Faculty of Engineering, Ibaraki University, Hitachi, Japan 316","institution_ids":["https://openalex.org/I6178835","https://openalex.org/I65143321"]},{"raw_affiliation_string":"Yasuo Matsuyama:  received a B.S. in Electrical Engineering from Soowa University in 1969. He completed the Doctoral Program there in 1974. He entered the Japan Teachers Exchange Program (Stanford University) the same year. He became a teaching assistant there in 1977. He completed the Doctoral program there in 1978. Currently, he is Professor of Information Engineering at Ibaraki University. He conducts research related to Information and Computer Engineering. He translated VLSI Design Menu, Microcomputer Dictionary, The C Language and UNIX, Fundamentals of CMOS VLSI Design, and The C Language/Digital Symbol Processing. He is a member of the ACM, IEEE, INNS, the Information Processing Society, the Neural Networks Society, and the Information Theory and Applications Society","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5004156746"],"corresponding_institution_ids":["https://openalex.org/I6178835","https://openalex.org/I65143321"],"apc_list":null,"apc_paid":null,"fwci":0.5353,"has_fulltext":false,"cited_by_count":21,"citation_normalized_percentile":{"value":0.7275938,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"23","issue":"2","first_page":"101","last_page":"112"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10320","display_name":"Neural Networks and Applications","score":0.9995999932289124,"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/T10320","display_name":"Neural Networks and Applications","score":0.9995999932289124,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.9739000201225281,"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/T10057","display_name":"Face and Expression Recognition","score":0.9341999888420105,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"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.9261435270309448},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.6428465843200684},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.633404016494751},{"id":"https://openalex.org/keywords/simulated-annealing","display_name":"Simulated annealing","score":0.5982445478439331},{"id":"https://openalex.org/keywords/euclidean-space","display_name":"Euclidean space","score":0.5805840492248535},{"id":"https://openalex.org/keywords/euclidean-geometry","display_name":"Euclidean geometry","score":0.578532338142395},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.47846317291259766},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.4644228518009186},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.43837684392929077},{"id":"https://openalex.org/keywords/euclidean-distance","display_name":"Euclidean distance","score":0.4328901171684265},{"id":"https://openalex.org/keywords/2-opt","display_name":"2-opt","score":0.41799306869506836},{"id":"https://openalex.org/keywords/position","display_name":"Position (finance)","score":0.41428062319755554},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3721022605895996},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.36346396803855896},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3441474139690399},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.13863158226013184}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.9261435270309448},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.6428465843200684},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.633404016494751},{"id":"https://openalex.org/C126980161","wikidata":"https://www.wikidata.org/wiki/Q863783","display_name":"Simulated annealing","level":2,"score":0.5982445478439331},{"id":"https://openalex.org/C186450821","wikidata":"https://www.wikidata.org/wiki/Q17295","display_name":"Euclidean space","level":2,"score":0.5805840492248535},{"id":"https://openalex.org/C129782007","wikidata":"https://www.wikidata.org/wiki/Q162886","display_name":"Euclidean geometry","level":2,"score":0.578532338142395},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.47846317291259766},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.4644228518009186},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.43837684392929077},{"id":"https://openalex.org/C120174047","wikidata":"https://www.wikidata.org/wiki/Q847073","display_name":"Euclidean distance","level":2,"score":0.4328901171684265},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.41799306869506836},{"id":"https://openalex.org/C198082294","wikidata":"https://www.wikidata.org/wiki/Q3399648","display_name":"Position (finance)","level":2,"score":0.41428062319755554},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3721022605895996},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.36346396803855896},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3441474139690399},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.13863158226013184},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1002/scj.4690230209","is_oa":false,"landing_page_url":"https://doi.org/10.1002/scj.4690230209","pdf_url":null,"source":{"id":"https://openalex.org/S58208175","display_name":"Systems and Computers in Japan","issn_l":"0882-1666","issn":["0882-1666","1520-684X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Systems and Computers in Japan","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11","score":0.7699999809265137}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1597286183","https://openalex.org/W1964286413","https://openalex.org/W1973284970","https://openalex.org/W2021615457","https://openalex.org/W2033320243","https://openalex.org/W2044714532","https://openalex.org/W2051719061","https://openalex.org/W2054808295","https://openalex.org/W2056760934","https://openalex.org/W2109808436","https://openalex.org/W2134383396","https://openalex.org/W2150593711","https://openalex.org/W2160060889","https://openalex.org/W2606809758","https://openalex.org/W3036512766","https://openalex.org/W3139666781","https://openalex.org/W3207342693","https://openalex.org/W4300402905","https://openalex.org/W6661721348"],"related_works":["https://openalex.org/W4389782626","https://openalex.org/W2392101695","https://openalex.org/W2359992618","https://openalex.org/W2161373934","https://openalex.org/W2361943787","https://openalex.org/W2411789204","https://openalex.org/W2271841533","https://openalex.org/W2980689483","https://openalex.org/W4376138746","https://openalex.org/W2171568915"],"abstract_inverted_index":{"Abstract":[0],"By":[1],"using":[2,126],"competitive":[3],"learning,":[4],"which":[5,63],"causes":[6],"just":[7],"one":[8,72],"or":[9,52],"a":[10,13,21,46,49,60,74,81,86,118,140,144,170,194,198],"group":[11],"of":[12,16,25,41,69,100,109,129,146,162],"small":[14],"number":[15,99,108,161],"neurons":[17,101],"to":[18,20,38,156],"respond":[19],"given":[22],"input,":[23],"self\u2010organization":[24,34],"entire":[26],"neural":[27,82],"networks":[28],"can":[29,189],"be":[30,190],"achieved.":[31],"When":[32],"this":[33,90,134,177],"process":[35],"is":[36,56,103],"applied":[37],"various":[39],"kinds":[40],"travelling":[42],"salesman":[43],"problems":[44],"in":[45,106,159,164],"Euclidean":[47],"space,":[48],"good":[50,141],"approximation":[51,142],"the":[53,66,77,107,112,122,157,160],"true":[54],"solution":[55],"obtained.":[57],"We":[58],"use":[59,93],"sequential":[61],"update":[62],"looks":[64],"at":[65,73],"position":[67],"vector":[68],"each":[70],"city":[71],"time":[75],"as":[76,85],"training":[78],"method":[79,125],"for":[80,169],"network":[83],"arranged":[84],"closed":[87],"loop.":[88],"In":[89,111],"case,":[91],"we":[92,115,138,175],"symmetrical":[94],"connections":[95],"between":[96],"neurons.":[97],"The":[98,187],"required":[102],"approximately":[104],"linear":[105],"cities.":[110],"first":[113],"experiment,":[114],"carried":[116],"out":[117],"quantitative":[119],"comparison":[120],"with":[121,154,197],"simulated":[123],"annealing":[124],"500":[127],"sets":[128],"30":[130],"cities":[131,149,163],"and":[132,150,180,182],"demonstrated":[133],"method's":[135,178],"superiority.":[136],"Next,":[137],"obtained":[139],"on":[143],"set":[145],"532":[147],"U.S.":[148],"demonstrate":[151],"its":[152],"superiority":[153],"respect":[155],"increase":[158],"actual":[165],"(realistic)":[166],"data.":[167],"Further,":[168],"generalized":[171],"constrained":[172],"multiple\u2010salesman":[173],"problem,":[174],"explain":[176],"compactness":[179],"efficiency":[181],"give":[183],"an":[184],"experimental":[185],"example.":[186],"computation":[188],"adequately":[191],"performed":[192],"by":[193],"common":[195],"workstation":[196],"serial":[199],"processor.":[200]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}