{"id":"https://openalex.org/W2557580619","doi":"https://doi.org/10.1109/cec.2016.7744078","title":"An effective method to find the k shortest paths in a generalized time-window network","display_name":"An effective method to find the k shortest paths in a generalized time-window network","publication_year":2016,"publication_date":"2016-07-01","ids":{"openalex":"https://openalex.org/W2557580619","doi":"https://doi.org/10.1109/cec.2016.7744078","mag":"2557580619"},"language":"en","primary_location":{"id":"doi:10.1109/cec.2016.7744078","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2016.7744078","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-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/A5079907239","display_name":"Xiao\u2010Bing Hu","orcid":"https://orcid.org/0000-0002-1555-0684"},"institutions":[{"id":"https://openalex.org/I25254941","display_name":"Beijing Normal University","ror":"https://ror.org/022k4wk35","country_code":"CN","type":"education","lineage":["https://openalex.org/I25254941"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Xiao-Bing Hu","raw_affiliation_strings":["Academy of Disaster Reduction and Emergence Management, Beijing Normal University, Beijing, China"],"affiliations":[{"raw_affiliation_string":"Academy of Disaster Reduction and Emergence Management, Beijing Normal University, Beijing, China","institution_ids":["https://openalex.org/I25254941"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008097973","display_name":"Ming-Kong Zhang","orcid":null},"institutions":[{"id":"https://openalex.org/I25254941","display_name":"Beijing Normal University","ror":"https://ror.org/022k4wk35","country_code":"CN","type":"education","lineage":["https://openalex.org/I25254941"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Ming-Kong Zhang","raw_affiliation_strings":["Academy of Disaster Reduction and Emergence Management, Beijing Normal University, Beijing, China"],"affiliations":[{"raw_affiliation_string":"Academy of Disaster Reduction and Emergence Management, Beijing Normal University, Beijing, China","institution_ids":["https://openalex.org/I25254941"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076523879","display_name":"Jian-Qin Liao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jian-Qin Liao","raw_affiliation_strings":["Chengdu MiidShare Technology Ltd, Chengdu, China"],"affiliations":[{"raw_affiliation_string":"Chengdu MiidShare Technology Ltd, Chengdu, China","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100462434","display_name":"Hailin Zhang","orcid":"https://orcid.org/0000-0002-8545-1032"},"institutions":[{"id":"https://openalex.org/I4210139553","display_name":"Research Institute of Highway","ror":"https://ror.org/0335kqk33","country_code":"CN","type":"government","lineage":["https://openalex.org/I4210127216","https://openalex.org/I4210139553"]},{"id":"https://openalex.org/I4210127216","display_name":"Ministry of Transport","ror":"https://ror.org/031wq1t38","country_code":"CN","type":"government","lineage":["https://openalex.org/I4210127216"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Hai-Lin Zhang","raw_affiliation_strings":["Ministry of Transport, Research Institute of Highway, Beijing, China"],"affiliations":[{"raw_affiliation_string":"Ministry of Transport, Research Institute of Highway, Beijing, China","institution_ids":["https://openalex.org/I4210139553","https://openalex.org/I4210127216"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5079907239"],"corresponding_institution_ids":["https://openalex.org/I25254941"],"apc_list":null,"apc_paid":null,"fwci":0.9188,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.78680517,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"43","issue":null,"first_page":"2345","last_page":"2351"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic 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/T10714","display_name":"Software-Defined Networks and 5G","score":0.9965999722480774,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9959999918937683,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.7539824843406677},{"id":"https://openalex.org/keywords/window","display_name":"Window (computing)","score":0.6274138689041138},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5821284651756287},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.4966631531715393},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.49554288387298584},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.45148804783821106},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4306979477405548},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4109848141670227},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3495819568634033},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.34420597553253174},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.0961475670337677},{"id":"https://openalex.org/keywords/physics","display_name":"Physics","score":0.08809807896614075}],"concepts":[{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.7539824843406677},{"id":"https://openalex.org/C2778751112","wikidata":"https://www.wikidata.org/wiki/Q835016","display_name":"Window (computing)","level":2,"score":0.6274138689041138},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5821284651756287},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.4966631531715393},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.49554288387298584},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.45148804783821106},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4306979477405548},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4109848141670227},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3495819568634033},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.34420597553253174},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0961475670337677},{"id":"https://openalex.org/C121332964","wikidata":"https://www.wikidata.org/wiki/Q413","display_name":"Physics","level":0,"score":0.08809807896614075},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C62520636","wikidata":"https://www.wikidata.org/wiki/Q944","display_name":"Quantum mechanics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cec.2016.7744078","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cec.2016.7744078","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2016 IEEE Congress on Evolutionary Computation (CEC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W73629738","https://openalex.org/W1595295153","https://openalex.org/W1969982063","https://openalex.org/W2011282943","https://openalex.org/W2017413817","https://openalex.org/W2023766747","https://openalex.org/W2058725370","https://openalex.org/W2069480138","https://openalex.org/W2069530841","https://openalex.org/W2089845007","https://openalex.org/W2094004254","https://openalex.org/W2121101044","https://openalex.org/W2122410182","https://openalex.org/W2122516422","https://openalex.org/W2126207702","https://openalex.org/W2131058166","https://openalex.org/W2134531349","https://openalex.org/W2160019827","https://openalex.org/W2461541081","https://openalex.org/W2623293810","https://openalex.org/W2946046356","https://openalex.org/W6643036874"],"related_works":["https://openalex.org/W2109115373","https://openalex.org/W2390901981","https://openalex.org/W4230691760","https://openalex.org/W4391923333","https://openalex.org/W2393847170","https://openalex.org/W85049056","https://openalex.org/W158465905","https://openalex.org/W577521963","https://openalex.org/W2054277467","https://openalex.org/W2170725231"],"abstract_inverted_index":{"It":[0],"is":[1,27,147,190,206,216],"a":[2,12,16,35,62,67,72,94,120,137,160,178,223,228],"challenging":[3],"task":[4],"to":[5,46,76,150,163,171,225],"find":[6],"the":[7,28,56,79,86,90,98,105,115,131,145,155,168,187,207,212,217,235,239],"k":[8,132,156],"shortest":[9,133,157],"paths":[10,134,158],"in":[11,85,136,167,211],"time-window":[13,96,139],"network,":[14,97,213],"where":[15,66,153,201],"node":[17,29,42,80,166],"may":[18,74],"have":[19],"some":[20,244],"specific":[21],"time":[22,53,84,87,220],"windows":[23,54,88],"only":[24],"within":[25],"which":[26],"accessible.":[30],"Existing":[31],"research":[32],"assumes":[33],"that":[34],"traveller":[36],"can":[37],"pass":[38,47,77],"through":[39,78,227],"an":[40,125],"accessible":[41],"immediately":[43],"or":[44],"wait":[45],"at":[48,55,61,71,81],"start":[49],"times":[50],"of":[51,89,100,107,181,186,209,234],"future":[52],"node.":[57,91],"This":[58],"paper":[59],"targets":[60],"more":[63],"general":[64],"case":[65],"traveller,":[68],"once":[69],"arriving":[70],"node,":[73],"choose":[75],"any":[82],"discrete":[83],"In":[92],"such":[93],"generalized":[95,138],"degree":[99],"complexity":[101,185],"increases":[102],"significantly,":[103],"as":[104],"size":[106],"solution":[108],"space":[109],"soars":[110],"up":[111],"exponentially.":[112],"By":[113],"mimicking":[114],"natural":[116],"ripple-spreading":[117,127],"phenomenon":[118],"on":[119],"liquid":[121],"surface,":[122],"we":[123],"propose":[124],"effective":[126],"algorithm":[128],"(RSA)":[129],"for":[130,222,238],"problem":[135],"network":[140,169],"(k-SPPGTW).":[141],"Besides":[142],"one-to-one":[143],"k-SPPGTW,":[144,152],"RSA":[146,189,237],"also":[148],"extended":[149],"one-to-all":[151],"all":[154],"from":[159],"given":[161],"source":[162],"every":[164],"other":[165],"need":[170],"be":[172],"found.":[173],"The":[174,183,230],"new":[175],"method":[176],"has":[177],"theoretical":[179],"guarantee":[180],"optimality.":[182],"computational":[184],"reported":[188,236],"just":[191],"0(k\u00d7N":[192],"<sub":[193,197,203],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[194,198,204],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">ATU</sub>":[195],"\u00d7N":[196],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">L</sub>":[199],"),":[200],"N":[202],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">l</sub>":[205],"number":[208],"links":[210],"and":[214,232],"Natu":[215],"average":[218],"simulated":[219],"units":[221],"ripple":[224],"travel":[226],"link.":[229],"effectiveness":[231],"efficiency":[233],"k-SPPGTW":[240],"are":[241],"demonstrated":[242],"by":[243],"preliminary":[245],"experimental":[246],"results.":[247]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}