{"id":"https://openalex.org/W2547842526","doi":"https://doi.org/10.1109/ic3ina.2015.7377742","title":"Finding alternative paths in city bus networks","display_name":"Finding alternative paths in city bus networks","publication_year":2015,"publication_date":"2015-10-01","ids":{"openalex":"https://openalex.org/W2547842526","doi":"https://doi.org/10.1109/ic3ina.2015.7377742","mag":"2547842526"},"language":"en","primary_location":{"id":"doi:10.1109/ic3ina.2015.7377742","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ic3ina.2015.7377742","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 International Conference on Computer, Control, Informatics and its Applications (IC3INA)","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/A5052144407","display_name":"Viet-Khoa Vo-Ho","orcid":"https://orcid.org/0000-0003-0277-7094"},"institutions":[{"id":"https://openalex.org/I47265099","display_name":"Ho Chi Minh City University of Technology","ror":"https://ror.org/04qva2324","country_code":"VN","type":"education","lineage":["https://openalex.org/I123565023","https://openalex.org/I47265099"]}],"countries":["VN"],"is_corresponding":true,"raw_author_name":"Khoa D. Vo","raw_affiliation_strings":["Faculty of Computer Science & Engineering, HCMC University of Technology, Ho Chi Minh City, Vietnam"],"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science & Engineering, HCMC University of Technology, Ho Chi Minh City, Vietnam","institution_ids":["https://openalex.org/I47265099"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5101475544","display_name":"Tran Vu Pham","orcid":"https://orcid.org/0000-0001-7580-1521"},"institutions":[{"id":"https://openalex.org/I47265099","display_name":"Ho Chi Minh City University of Technology","ror":"https://ror.org/04qva2324","country_code":"VN","type":"education","lineage":["https://openalex.org/I123565023","https://openalex.org/I47265099"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Tran Vu Pham","raw_affiliation_strings":["Faculty of Computer Science & Engineering, HCMC University of Technology, Ho Chi Minh City, Vietnam"],"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science & Engineering, HCMC University of Technology, Ho Chi Minh City, Vietnam","institution_ids":["https://openalex.org/I47265099"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102296653","display_name":"Huynh Tuong Nguyen","orcid":null},"institutions":[{"id":"https://openalex.org/I47265099","display_name":"Ho Chi Minh City University of Technology","ror":"https://ror.org/04qva2324","country_code":"VN","type":"education","lineage":["https://openalex.org/I123565023","https://openalex.org/I47265099"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Huynh Tuong Nguyen","raw_affiliation_strings":["Faculty of Computer Science & Engineering, HCMC University of Technology, Ho Chi Minh City, Vietnam"],"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science & Engineering, HCMC University of Technology, Ho Chi Minh City, Vietnam","institution_ids":["https://openalex.org/I47265099"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022449896","display_name":"Nghia Nguyen","orcid":"https://orcid.org/0000-0002-5983-665X"},"institutions":[{"id":"https://openalex.org/I47265099","display_name":"Ho Chi Minh City University of Technology","ror":"https://ror.org/04qva2324","country_code":"VN","type":"education","lineage":["https://openalex.org/I123565023","https://openalex.org/I47265099"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Nghia Nguyen","raw_affiliation_strings":["Faculty of Computer Science & Engineering, HCMC University of Technology, Ho Chi Minh City, Vietnam"],"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science & Engineering, HCMC University of Technology, Ho Chi Minh City, Vietnam","institution_ids":["https://openalex.org/I47265099"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5073243218","display_name":"Tr\u1ea7n V\u0103n Ho\u00e0i","orcid":"https://orcid.org/0000-0002-0602-4287"},"institutions":[{"id":"https://openalex.org/I47265099","display_name":"Ho Chi Minh City University of Technology","ror":"https://ror.org/04qva2324","country_code":"VN","type":"education","lineage":["https://openalex.org/I123565023","https://openalex.org/I47265099"]}],"countries":["VN"],"is_corresponding":false,"raw_author_name":"Tran Van Hoai","raw_affiliation_strings":["Faculty of Computer Science & Engineering, HCMC University of Technology, Ho Chi Minh City, Vietnam"],"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science & Engineering, HCMC University of Technology, Ho Chi Minh City, Vietnam","institution_ids":["https://openalex.org/I47265099"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5052144407"],"corresponding_institution_ids":["https://openalex.org/I47265099"],"apc_list":null,"apc_paid":null,"fwci":0.3946,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.69672598,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"34","last_page":"39"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10847","display_name":"Advanced Optical Network Technologies","score":0.9970999956130981,"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.9970999956130981,"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/T11106","display_name":"Data Management and Algorithms","score":0.9950000047683716,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.989799976348877,"subfield":{"id":"https://openalex.org/subfields/3313","display_name":"Transportation"},"field":{"id":"https://openalex.org/fields/33","display_name":"Social Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.7401472330093384},{"id":"https://openalex.org/keywords/floyd\u2013warshall-algorithm","display_name":"Floyd\u2013Warshall algorithm","score":0.5561062693595886},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.54046630859375},{"id":"https://openalex.org/keywords/yens-algorithm","display_name":"Yen's algorithm","score":0.511242151260376},{"id":"https://openalex.org/keywords/public-transport","display_name":"Public transport","score":0.4777590334415436},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4545899033546448},{"id":"https://openalex.org/keywords/k-shortest-path-routing","display_name":"K shortest path routing","score":0.4542853832244873},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4523320496082306},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.42887288331985474},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.41305676102638245},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3980448842048645},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.323405385017395},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3153156042098999},{"id":"https://openalex.org/keywords/dijkstras-algorithm","display_name":"Dijkstra's algorithm","score":0.21602460741996765},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.09111258387565613}],"concepts":[{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.7401472330093384},{"id":"https://openalex.org/C186065694","wikidata":"https://www.wikidata.org/wiki/Q1047576","display_name":"Floyd\u2013Warshall algorithm","level":5,"score":0.5561062693595886},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.54046630859375},{"id":"https://openalex.org/C119971455","wikidata":"https://www.wikidata.org/wiki/Q8052172","display_name":"Yen's algorithm","level":5,"score":0.511242151260376},{"id":"https://openalex.org/C539828613","wikidata":"https://www.wikidata.org/wiki/Q178512","display_name":"Public transport","level":2,"score":0.4777590334415436},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4545899033546448},{"id":"https://openalex.org/C70266271","wikidata":"https://www.wikidata.org/wiki/Q6343044","display_name":"K shortest path routing","level":4,"score":0.4542853832244873},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4523320496082306},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.42887288331985474},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.41305676102638245},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3980448842048645},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.323405385017395},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3153156042098999},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.21602460741996765},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.09111258387565613},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C22212356","wikidata":"https://www.wikidata.org/wiki/Q775325","display_name":"Transport engineering","level":1,"score":0.0},{"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.1109/ic3ina.2015.7377742","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ic3ina.2015.7377742","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2015 International Conference on Computer, Control, Informatics and its Applications (IC3INA)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities","score":0.800000011920929}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1483103748","https://openalex.org/W1587851010","https://openalex.org/W1977943748","https://openalex.org/W1984407615","https://openalex.org/W2007478492","https://openalex.org/W2011282943","https://openalex.org/W2048848130","https://openalex.org/W2052955852","https://openalex.org/W2078948975","https://openalex.org/W2101923813","https://openalex.org/W2102611762","https://openalex.org/W2110861948","https://openalex.org/W2118840184","https://openalex.org/W2169528473","https://openalex.org/W4285719527"],"related_works":["https://openalex.org/W2360981904","https://openalex.org/W4293054712","https://openalex.org/W2597144308","https://openalex.org/W1617152041","https://openalex.org/W2347245430","https://openalex.org/W2354846196","https://openalex.org/W2368964068","https://openalex.org/W2391130892","https://openalex.org/W2383519316","https://openalex.org/W2348761196"],"abstract_inverted_index":{"Finding":[0],"alternative":[1,39,57,80,114,145],"paths":[2,58,146],"to":[3,7,18,34,37,100,109],"follow":[4],"is":[5,17,46,74,94,107],"essential":[6],"travelers":[8],"in":[9,89],"dense":[10],"city":[11,21],"bus":[12,22],"networks.":[13],"A":[14],"simple":[15],"method":[16],"transform":[19],"the":[20,35,43,67,111,123],"networks":[23],"into":[24],"directed":[25],"graph":[26,36,45],"and":[27,49],"then":[28],"apply":[29],"a":[30,61,85,91,141],"standard":[31],"K-shortest-path":[32,52,87],"algorithm":[33],"find":[38],"paths.":[40,81,115],"However,":[41],"as":[42,96],"constructed":[44],"often":[47],"massive":[48],"complex,":[50],"classical":[51],"algorithms":[53],"usually":[54],"search":[55],"for":[56],"that":[59,137,147],"share":[60],"large":[62],"proportion":[63],"of":[64,127,144],"links":[65],"with":[66],"shortest":[68],"path.":[69],"For":[70],"traveling":[71],"purpose,":[72],"there":[73,138],"not":[75],"much":[76],"difference":[77],"among":[78,113],"these":[79],"We":[82],"therefore":[83],"develop":[84],"constrained":[86],"algorithm,":[88],"which":[90],"dissimilarity":[92,105],"measurement":[93,106],"used":[95],"an":[97],"additional":[98],"constraint,":[99],"tackle":[101],"this":[102],"issue.":[103],"This":[104],"proposed":[108],"measure":[110],"diversity":[112],"Some":[116],"experiments":[117],"have":[118],"been":[119],"conducted":[120],"based":[121],"on":[122],"public":[124],"transport":[125],"network":[126],"Ho":[128],"Chi":[129],"Minh":[130],"City":[131],"(HCMC).":[132],"The":[133],"empirical":[134],"results":[135],"show":[136],"exist":[139],"only":[140],"small":[142],"set":[143],"are":[148],"indeed":[149],"distinguishable":[150],"from":[151],"each":[152],"other.":[153]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}