{"id":"https://openalex.org/W177682317","doi":"https://doi.org/10.1007/978-3-540-77368-9_29","title":"Adaptive Routing Algorithm Using Evolution Program for Multiple Shortest Paths in DRGS","display_name":"Adaptive Routing Algorithm Using Evolution Program for Multiple Shortest Paths in DRGS","publication_year":2007,"publication_date":"2007-12-07","ids":{"openalex":"https://openalex.org/W177682317","doi":"https://doi.org/10.1007/978-3-540-77368-9_29","mag":"177682317"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-540-77368-9_29","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-77368-9_29","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"book-chapter","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/A5111688213","display_name":"Sung\u2010Soo Kim","orcid":null},"institutions":[{"id":"https://openalex.org/I165507594","display_name":"Kangwon National University","ror":"https://ror.org/01mh5ph17","country_code":"KR","type":"education","lineage":["https://openalex.org/I165507594"]}],"countries":["KR"],"is_corresponding":true,"raw_author_name":"Sung-Soo Kim","raw_affiliation_strings":["Department of Industrial Engineering, Kangwon National University, 192-1, Hyoja-2-Dong, Chunchon, Kangwon, 200-701, Korea","Department of Industrial Engineering, Kangwon National University, Chunchon, Kangwon, Korea"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering, Kangwon National University, 192-1, Hyoja-2-Dong, Chunchon, Kangwon, 200-701, Korea","institution_ids":["https://openalex.org/I165507594"]},{"raw_affiliation_string":"Department of Industrial Engineering, Kangwon National University, Chunchon, Kangwon, Korea","institution_ids":["https://openalex.org/I165507594"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059587530","display_name":"Seung B. Ahn","orcid":null},"institutions":[{"id":"https://openalex.org/I146429904","display_name":"Incheon National University","ror":"https://ror.org/02xf7p935","country_code":"KR","type":"education","lineage":["https://openalex.org/I146429904"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Seung B. Ahn","raw_affiliation_strings":["Graduate School of Logistics, University of Incheon, 7-46, Yeonsu-Gu, Incheon, 406-840, Korea","Graduate School of Logistics, University of Incheon, Yeonsu-Gu, Incheon, Korea"],"affiliations":[{"raw_affiliation_string":"Graduate School of Logistics, University of Incheon, 7-46, Yeonsu-Gu, Incheon, 406-840, Korea","institution_ids":["https://openalex.org/I146429904"]},{"raw_affiliation_string":"Graduate School of Logistics, University of Incheon, Yeonsu-Gu, Incheon, Korea","institution_ids":["https://openalex.org/I146429904"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5111688213"],"corresponding_institution_ids":["https://openalex.org/I165507594"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.04143682,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"292","last_page":"301"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12203","display_name":"Mobile Agent-Based Network Management","score":0.9830999970436096,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12203","display_name":"Mobile Agent-Based Network Management","score":0.9830999970436096,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10586","display_name":"Robotic Path Planning Algorithms","score":0.9782999753952026,"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"}},{"id":"https://openalex.org/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.975600004196167,"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/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.8409532308578491},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.7524521350860596},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7330420017242432},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.7000834345817566},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.6921266317367554},{"id":"https://openalex.org/keywords/suurballes-algorithm","display_name":"Suurballe's algorithm","score":0.6732655167579651},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6203543543815613},{"id":"https://openalex.org/keywords/private-network-to-network-interface","display_name":"Private Network-to-Network Interface","score":0.5694701671600342},{"id":"https://openalex.org/keywords/adaptive-routing","display_name":"Adaptive routing","score":0.5264528393745422},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.514994204044342},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"Dynamic programming","score":0.4959507882595062},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.48246151208877563},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.48160049319267273},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.47630250453948975},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4654667377471924},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.4575897455215454},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.2681065797805786},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.24012181162834167},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.20789611339569092},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.11098209023475647},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.09173917770385742},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08067885041236877}],"concepts":[{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.8409532308578491},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.7524521350860596},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7330420017242432},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.7000834345817566},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.6921266317367554},{"id":"https://openalex.org/C98779529","wikidata":"https://www.wikidata.org/wiki/Q7650417","display_name":"Suurballe's algorithm","level":5,"score":0.6732655167579651},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6203543543815613},{"id":"https://openalex.org/C204348804","wikidata":"https://www.wikidata.org/wiki/Q3888133","display_name":"Private Network-to-Network Interface","level":5,"score":0.5694701671600342},{"id":"https://openalex.org/C24856439","wikidata":"https://www.wikidata.org/wiki/Q352483","display_name":"Adaptive routing","level":5,"score":0.5264528393745422},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.514994204044342},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.4959507882595062},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.48246151208877563},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.48160049319267273},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.47630250453948975},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4654667377471924},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.4575897455215454},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.2681065797805786},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.24012181162834167},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.20789611339569092},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.11098209023475647},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.09173917770385742},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08067885041236877}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-540-77368-9_29","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-540-77368-9_29","pdf_url":null,"source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W77510497","https://openalex.org/W1889956542","https://openalex.org/W1964392442","https://openalex.org/W1964473960","https://openalex.org/W1993157704","https://openalex.org/W1993796847","https://openalex.org/W2033471184","https://openalex.org/W2035620649","https://openalex.org/W2119926658","https://openalex.org/W2138400873","https://openalex.org/W2163396525","https://openalex.org/W2233387323","https://openalex.org/W2338905098"],"related_works":["https://openalex.org/W2136320479","https://openalex.org/W651485002","https://openalex.org/W2358661218","https://openalex.org/W2380764023","https://openalex.org/W2368964068","https://openalex.org/W2170980056","https://openalex.org/W2167426328","https://openalex.org/W2755818550","https://openalex.org/W2226180094","https://openalex.org/W177682317"],"abstract_inverted_index":null,"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}