{"id":"https://openalex.org/W2005416798","doi":"https://doi.org/10.1080/03081070902880433","title":"A shortest path routing algorithm using Hopfield neural network with an improved energy function","display_name":"A shortest path routing algorithm using Hopfield neural network with an improved energy function","publication_year":2009,"publication_date":"2009-04-23","ids":{"openalex":"https://openalex.org/W2005416798","doi":"https://doi.org/10.1080/03081070902880433","mag":"2005416798"},"language":"en","primary_location":{"id":"doi:10.1080/03081070902880433","is_oa":false,"landing_page_url":"https://doi.org/10.1080/03081070902880433","pdf_url":null,"source":{"id":"https://openalex.org/S145553572","display_name":"International Journal of General Systems","issn_l":"0308-1079","issn":["0308-1079","1026-7492","1563-5104"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of General Systems","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/A5022326567","display_name":"Dong-Chul Park","orcid":"https://orcid.org/0009-0007-7442-2301"},"institutions":[{"id":"https://openalex.org/I89440247","display_name":"Myongji University","ror":"https://ror.org/00s9dpb54","country_code":"KR","type":"education","lineage":["https://openalex.org/I89440247"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Dong-Chul Park","raw_affiliation_strings":["Department of Information Engineering, Myongji University, Yongin, South Korea","Department of Information Eng., Myongji University, Yongin, South Korea#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Information Engineering, Myongji University, Yongin, South Korea","institution_ids":["https://openalex.org/I89440247"]},{"raw_affiliation_string":"Department of Information Eng., Myongji University, Yongin, South Korea#TAB#","institution_ids":["https://openalex.org/I89440247"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076417363","display_name":"Kyo-Reen Keum","orcid":null},"institutions":[{"id":"https://openalex.org/I4210149572","display_name":"Institution of Structural Engineers","ror":"https://ror.org/04jdfdv39","country_code":"GB","type":"nonprofit","lineage":["https://openalex.org/I4210149572"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Kyo-Reen Keum","raw_affiliation_strings":["Department of Marine Diesel Engine Shop Test, STX Engine Co., Seoul, South Korea","Department of Marine Diesel Engine Shop Test , STX Engine Co. , Seoul, South Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Marine Diesel Engine Shop Test, STX Engine Co., Seoul, South Korea","institution_ids":["https://openalex.org/I4210149572"]},{"raw_affiliation_string":"Department of Marine Diesel Engine Shop Test , STX Engine Co. , Seoul, South Korea","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5022326567"],"corresponding_institution_ids":["https://openalex.org/I89440247"],"apc_list":null,"apc_paid":null,"fwci":0.5221,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.7815398,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"38","issue":"7","first_page":"777","last_page":"791"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10320","display_name":"Neural Networks and Applications","score":0.9988999962806702,"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.9988999962806702,"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/T13717","display_name":"Advanced Algorithms and Applications","score":0.9789999723434448,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T13579","display_name":"Image and Video Stabilization","score":0.9621999859809875,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.6818775534629822},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.6591748595237732},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5955430865287781},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5058038234710693},{"id":"https://openalex.org/keywords/rate-of-convergence","display_name":"Rate of convergence","score":0.49796342849731445},{"id":"https://openalex.org/keywords/artificial-neural-network","display_name":"Artificial neural network","score":0.4849086403846741},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.47868162393569946},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.47657060623168945},{"id":"https://openalex.org/keywords/distance-vector-routing-protocol","display_name":"Distance-vector routing protocol","score":0.45884522795677185},{"id":"https://openalex.org/keywords/energy","display_name":"Energy (signal processing)","score":0.42059633135795593},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.412129670381546},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.3885824680328369},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3514671325683594},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.19300177693367004},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.15931150317192078},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.08879795670509338},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.06191140413284302}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6818775534629822},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6591748595237732},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5955430865287781},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5058038234710693},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.49796342849731445},{"id":"https://openalex.org/C50644808","wikidata":"https://www.wikidata.org/wiki/Q192776","display_name":"Artificial neural network","level":2,"score":0.4849086403846741},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.47868162393569946},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47657060623168945},{"id":"https://openalex.org/C202385902","wikidata":"https://www.wikidata.org/wiki/Q1229441","display_name":"Distance-vector routing protocol","level":5,"score":0.45884522795677185},{"id":"https://openalex.org/C186370098","wikidata":"https://www.wikidata.org/wiki/Q442787","display_name":"Energy (signal processing)","level":2,"score":0.42059633135795593},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.412129670381546},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.3885824680328369},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3514671325683594},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.19300177693367004},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.15931150317192078},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.08879795670509338},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.06191140413284302},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1080/03081070902880433","is_oa":false,"landing_page_url":"https://doi.org/10.1080/03081070902880433","pdf_url":null,"source":{"id":"https://openalex.org/S145553572","display_name":"International Journal of General Systems","issn_l":"0308-1079","issn":["0308-1079","1026-7492","1563-5104"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320547","host_organization_name":"Taylor & Francis","host_organization_lineage":["https://openalex.org/P4310320547"],"host_organization_lineage_names":["Taylor & Francis"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of General Systems","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/7","display_name":"Affordable and clean energy","score":0.8999999761581421}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1502966765","https://openalex.org/W1506599325","https://openalex.org/W1597286183","https://openalex.org/W1957927411","https://openalex.org/W1977545325","https://openalex.org/W2076998221","https://openalex.org/W2102227134","https://openalex.org/W2115871876","https://openalex.org/W2126748234","https://openalex.org/W2128110222","https://openalex.org/W2144388665","https://openalex.org/W2146702772","https://openalex.org/W2149056569","https://openalex.org/W2151250580","https://openalex.org/W2152324445","https://openalex.org/W2152950844","https://openalex.org/W2153792349","https://openalex.org/W2159993801","https://openalex.org/W2165833729","https://openalex.org/W2169423175","https://openalex.org/W2171472662","https://openalex.org/W2171690703","https://openalex.org/W3149755158","https://openalex.org/W4246463991","https://openalex.org/W4376549916"],"related_works":["https://openalex.org/W2373440974","https://openalex.org/W4297809323","https://openalex.org/W3216936331","https://openalex.org/W2758162329","https://openalex.org/W1654103226","https://openalex.org/W2618387409","https://openalex.org/W3049586963","https://openalex.org/W1969380352","https://openalex.org/W2020650862","https://openalex.org/W2356086978"],"abstract_inverted_index":{"A":[0],"shortest":[1],"path":[2,50],"routing":[3,28,34],"algorithm":[4,77,111,122],"using":[5],"the":[6,21,48,75,99,109,128,138,141],"Hopfield":[7],"neural":[8],"network":[9,142],"with":[10,67,80],"a":[11,37],"modified":[12,18],"Lyapunov":[13,22],"function":[14,24,45],"is":[15,30,78],"proposed.":[16],"The":[17,42,72,105,120],"version":[19],"of":[20,62,74,98,118,140],"energy":[23,44],"for":[25,32,36],"an":[26],"optimal":[27],"problem":[29],"proposed":[31,43,76,110,121],"determining":[33],"order":[35],"source":[38],"and":[39,54,86,89,91,93,102,131],"multiple":[40],"destinations.":[41],"mainly":[46],"prevents":[47],"solution":[49],"from":[51],"having":[52],"loops":[53],"partitions.":[55],"Experiments":[56],"are":[57],"performed":[58],"on":[59,127],"3000":[60],"networks":[61],"up":[63],"to":[64],"50":[65,144],"nodes":[66],"randomly":[68],"selected":[69],"link":[70],"costs.":[71],"performance":[73],"compared":[79],"several":[81],"conventional":[82,113,135],"algorithms":[83,95,136],"including":[84],"Ali":[85],"Kamoun's,":[87],"Park":[88],"Choi's,":[90],"Ahn":[92],"Ramakrishna's":[94],"in":[96,115],"terms":[97],"route":[100,129],"optimality":[101,130],"convergence":[103,132],"rate.":[104],"results":[106],"show":[107],"that":[108],"outperforms":[112],"methods":[114],"all":[116],"cases":[117],"experiments.":[119],"particularly":[123],"shows":[124],"significant":[125],"improvements":[126],"rate":[133],"over":[134],"when":[137],"size":[139],"approaches":[143],"nodes.":[145]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2025-10-10T00:00:00"}