{"id":"https://openalex.org/W2023766747","doi":"https://doi.org/10.1016/s0305-0548(02)00230-7","title":"Finding the first K shortest paths in a time-window network","display_name":"Finding the first K shortest paths in a time-window network","publication_year":2003,"publication_date":"2003-02-17","ids":{"openalex":"https://openalex.org/W2023766747","doi":"https://doi.org/10.1016/s0305-0548(02)00230-7","mag":"2023766747"},"language":"en","primary_location":{"id":"doi:10.1016/s0305-0548(02)00230-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0305-0548(02)00230-7","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","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/A5059627035","display_name":"Yen\u2010Liang Chen","orcid":"https://orcid.org/0000-0002-0121-5658"},"institutions":[{"id":"https://openalex.org/I22265921","display_name":"National Central University","ror":"https://ror.org/00944ve71","country_code":"TW","type":"education","lineage":["https://openalex.org/I22265921"]}],"countries":["TW"],"is_corresponding":true,"raw_author_name":"Yen-Liang Chen","raw_affiliation_strings":["Department of Information Management, National Central University, Chung-Li, Taiwan 320, Republic of China","Department of Information Management, National Central University, Chung\u2010Li, Taiwan 320, Republic of China"],"affiliations":[{"raw_affiliation_string":"Department of Information Management, National Central University, Chung-Li, Taiwan 320, Republic of China","institution_ids":["https://openalex.org/I22265921"]},{"raw_affiliation_string":"Department of Information Management, National Central University, Chung\u2010Li, Taiwan 320, Republic of China","institution_ids":["https://openalex.org/I22265921"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5059867656","display_name":"Hsu\u2010Hao Yang","orcid":"https://orcid.org/0000-0002-7476-8114"},"institutions":[{"id":"https://openalex.org/I65446980","display_name":"National Chin-Yi University of Technology","ror":"https://ror.org/040bs6h16","country_code":"TW","type":"education","lineage":["https://openalex.org/I65446980"]}],"countries":["TW"],"is_corresponding":false,"raw_author_name":"Hsu-Hao Yang","raw_affiliation_strings":["Department of Industrial Engineering and Management, National Chinyi Institute of Technology, Taiping, Taiwan 411, Republic of China","Department of Industrial Engineering and Management, National Chinyi Institute of Technology, Taiping, Taiwan 411, Republic of China#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering and Management, National Chinyi Institute of Technology, Taiping, Taiwan 411, Republic of China","institution_ids":["https://openalex.org/I65446980"]},{"raw_affiliation_string":"Department of Industrial Engineering and Management, National Chinyi Institute of Technology, Taiping, Taiwan 411, Republic of China#TAB#","institution_ids":["https://openalex.org/I65446980"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5059627035"],"corresponding_institution_ids":["https://openalex.org/I22265921"],"apc_list":{"value":3210,"currency":"USD","value_usd":3210},"apc_paid":null,"fwci":0.5923,"has_fulltext":false,"cited_by_count":39,"citation_normalized_percentile":{"value":0.67578088,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"31","issue":"4","first_page":"499","last_page":"513"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9997000098228455,"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.9997000098228455,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9990000128746033,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9968000054359436,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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.7623672485351562},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6456962823867798},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6261630058288574},{"id":"https://openalex.org/keywords/window","display_name":"Window (computing)","score":0.6249062418937683},{"id":"https://openalex.org/keywords/constrained-shortest-path-first","display_name":"Constrained Shortest Path First","score":0.6211975812911987},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.4838956296443939},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.47693341970443726},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.42692580819129944},{"id":"https://openalex.org/keywords/generalization","display_name":"Generalization","score":0.42485958337783813},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.37690797448158264},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28710466623306274},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.24434295296669006},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.20820128917694092},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.14102691411972046},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.08388727903366089}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7623672485351562},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6456962823867798},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6261630058288574},{"id":"https://openalex.org/C2778751112","wikidata":"https://www.wikidata.org/wiki/Q835016","display_name":"Window (computing)","level":2,"score":0.6249062418937683},{"id":"https://openalex.org/C178067994","wikidata":"https://www.wikidata.org/wiki/Q1128278","display_name":"Constrained Shortest Path First","level":5,"score":0.6211975812911987},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.4838956296443939},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.47693341970443726},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.42692580819129944},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.42485958337783813},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37690797448158264},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28710466623306274},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.24434295296669006},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.20820128917694092},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.14102691411972046},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.08388727903366089},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1016/s0305-0548(02)00230-7","is_oa":false,"landing_page_url":"https://doi.org/10.1016/s0305-0548(02)00230-7","pdf_url":null,"source":{"id":"https://openalex.org/S173256270","display_name":"Computers & Operations Research","issn_l":"0305-0548","issn":["0305-0548","1873-765X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320990","host_organization_name":"Elsevier BV","host_organization_lineage":["https://openalex.org/P4310320990"],"host_organization_lineage_names":["Elsevier BV"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Computers & Operations Research","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320321026","display_name":"Ministry of Earth Sciences","ror":"https://ror.org/013cf5k59"},{"id":"https://openalex.org/F4320322724","display_name":"Ministry of Education, India","ror":"https://ror.org/048xjjh50"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1980308649","https://openalex.org/W1994909604","https://openalex.org/W2011282943","https://openalex.org/W2017413817","https://openalex.org/W2069480138","https://openalex.org/W2069530841","https://openalex.org/W2078948975","https://openalex.org/W2084224084","https://openalex.org/W2126207702","https://openalex.org/W2126598061","https://openalex.org/W2131058166","https://openalex.org/W2151021662","https://openalex.org/W2163526781","https://openalex.org/W2169528473","https://openalex.org/W2611491551"],"related_works":["https://openalex.org/W2198982833","https://openalex.org/W2767202586","https://openalex.org/W2523719706","https://openalex.org/W2375775343","https://openalex.org/W1990043277","https://openalex.org/W4223969905","https://openalex.org/W2171039275","https://openalex.org/W2388654557","https://openalex.org/W2170980056","https://openalex.org/W4310124294"],"abstract_inverted_index":null,"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":4},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}