{"id":"https://openalex.org/W2009584621","doi":"https://doi.org/10.1007/978-3-642-10844-0_63","title":"An Ant Colony Optimization Approach for the Preference-Based Shortest Path Search","display_name":"An Ant Colony Optimization Approach for the Preference-Based Shortest Path Search","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2009584621","doi":"https://doi.org/10.1007/978-3-642-10844-0_63","mag":"2009584621"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-642-10844-0_63","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-10844-0_63","pdf_url":null,"source":{"id":"https://openalex.org/S2764900261","display_name":"Communications in computer and information science","issn_l":"1865-0929","issn":["1865-0929","1865-0937"],"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":"Communications in Computer and Information 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/A5088016749","display_name":"Seung-Ho Ok","orcid":"https://orcid.org/0000-0002-9036-0872"},"institutions":[{"id":"https://openalex.org/I31419693","display_name":"Kyungpook National University","ror":"https://ror.org/040c17130","country_code":"KR","type":"education","lineage":["https://openalex.org/I31419693"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Seung-Ho Ok","raw_affiliation_strings":["School of Electrical Eng. & Computer Science, Kyungpook National University, Daegu, Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical Eng. & Computer Science, Kyungpook National University, Daegu, Korea","institution_ids":["https://openalex.org/I31419693"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111642627","display_name":"Woo-Jin Seo","orcid":null},"institutions":[{"id":"https://openalex.org/I31419693","display_name":"Kyungpook National University","ror":"https://ror.org/040c17130","country_code":"KR","type":"education","lineage":["https://openalex.org/I31419693"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Woo-Jin Seo","raw_affiliation_strings":["School of Electrical Eng. & Computer Science, Kyungpook National University, Daegu, Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical Eng. & Computer Science, Kyungpook National University, Daegu, Korea","institution_ids":["https://openalex.org/I31419693"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045468765","display_name":"Jin-Ho Ahn","orcid":"https://orcid.org/0000-0001-8776-5185"},"institutions":[{"id":"https://openalex.org/I162706563","display_name":"Hoseo University","ror":"https://ror.org/01qyd4k24","country_code":"KR","type":"education","lineage":["https://openalex.org/I162706563"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Jin-Ho Ahn","raw_affiliation_strings":["Dept. of Electronic Engineering, Hoseo University, Chungcheongnam-do, Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electronic Engineering, Hoseo University, Chungcheongnam-do, Korea","institution_ids":["https://openalex.org/I162706563"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5068528309","display_name":"Sungho Kang","orcid":"https://orcid.org/0000-0002-7093-2095"},"institutions":[{"id":"https://openalex.org/I193775966","display_name":"Yonsei University","ror":"https://ror.org/01wjejq96","country_code":"KR","type":"education","lineage":["https://openalex.org/I193775966"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Sungho Kang","raw_affiliation_strings":["Dept. of Electrical and Electronic Engineering, Yonsei University, Seoul, Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of Electrical and Electronic Engineering, Yonsei University, Seoul, Korea","institution_ids":["https://openalex.org/I193775966"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5043474789","display_name":"Byungin Moon","orcid":"https://orcid.org/0000-0002-8102-4818"},"institutions":[{"id":"https://openalex.org/I31419693","display_name":"Kyungpook National University","ror":"https://ror.org/040c17130","country_code":"KR","type":"education","lineage":["https://openalex.org/I31419693"]}],"countries":["KR"],"is_corresponding":false,"raw_author_name":"Byungin Moon","raw_affiliation_strings":["School of Electrical Eng. & Computer Science, Kyungpook National University, Daegu, Korea"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical Eng. & Computer Science, Kyungpook National University, Daegu, Korea","institution_ids":["https://openalex.org/I31419693"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.4292,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.6337963,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"539","last_page":"546"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T11106","display_name":"Data Management and Algorithms","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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.9969000220298767,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.9853000044822693,"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/shortest-path-problem","display_name":"Shortest path problem","score":0.8898478150367737},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.7658646702766418},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.7250685691833496},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.7011058926582336},{"id":"https://openalex.org/keywords/ant-colony-optimization-algorithms","display_name":"Ant colony optimization algorithms","score":0.666336715221405},{"id":"https://openalex.org/keywords/shortest-path-faster-algorithm","display_name":"Shortest Path Faster Algorithm","score":0.6508350968360901},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.56547611951828},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5543161630630493},{"id":"https://openalex.org/keywords/preference","display_name":"Preference","score":0.5430062413215637},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.43347883224487305},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4099052846431732},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.33357125520706177},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.31124061346054077},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.27579230070114136},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.1846071183681488},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.05677589774131775},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.0551755428314209},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.047566771507263184}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.8898478150367737},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.7658646702766418},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.7250685691833496},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.7011058926582336},{"id":"https://openalex.org/C40128228","wikidata":"https://www.wikidata.org/wiki/Q460851","display_name":"Ant colony optimization algorithms","level":2,"score":0.666336715221405},{"id":"https://openalex.org/C168451585","wikidata":"https://www.wikidata.org/wiki/Q7502159","display_name":"Shortest Path Faster Algorithm","level":5,"score":0.6508350968360901},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.56547611951828},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5543161630630493},{"id":"https://openalex.org/C2781249084","wikidata":"https://www.wikidata.org/wiki/Q908656","display_name":"Preference","level":2,"score":0.5430062413215637},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.43347883224487305},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4099052846431732},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.33357125520706177},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.31124061346054077},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.27579230070114136},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.1846071183681488},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.05677589774131775},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0551755428314209},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.047566771507263184},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-642-10844-0_63","is_oa":false,"landing_page_url":"https://doi.org/10.1007/978-3-642-10844-0_63","pdf_url":null,"source":{"id":"https://openalex.org/S2764900261","display_name":"Communications in computer and information science","issn_l":"1865-0929","issn":["1865-0929","1865-0937"],"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":"Communications in Computer and Information Science","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W797950765","https://openalex.org/W1530490667","https://openalex.org/W1548993723","https://openalex.org/W1573676079","https://openalex.org/W1576426930","https://openalex.org/W1602076081","https://openalex.org/W2009151996","https://openalex.org/W2017694061","https://openalex.org/W2025704344","https://openalex.org/W2062103774","https://openalex.org/W2107941094","https://openalex.org/W2111954781","https://openalex.org/W2123508631","https://openalex.org/W2139965813","https://openalex.org/W2143884249","https://openalex.org/W2164267739","https://openalex.org/W2165049137","https://openalex.org/W2166037317","https://openalex.org/W2171211995","https://openalex.org/W3147414854"],"related_works":["https://openalex.org/W4253588386","https://openalex.org/W2810620529","https://openalex.org/W2381419702","https://openalex.org/W2375775343","https://openalex.org/W2523719706","https://openalex.org/W1562631103","https://openalex.org/W2368964068","https://openalex.org/W4293054712","https://openalex.org/W2198982833","https://openalex.org/W2161960576"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":2}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}