{"id":"https://openalex.org/W2907051945","doi":"https://doi.org/10.1587/transfun.e102.a.320","title":"Lightweight Computation of Overlaid Traffic Flows by Shortest Origin-Destination Trips","display_name":"Lightweight Computation of Overlaid Traffic Flows by Shortest Origin-Destination Trips","publication_year":2018,"publication_date":"2018-12-31","ids":{"openalex":"https://openalex.org/W2907051945","doi":"https://doi.org/10.1587/transfun.e102.a.320","mag":"2907051945"},"language":"en","primary_location":{"id":"doi:10.1587/transfun.e102.a.320","doi":"https://doi.org/10.1587/transfun.e102.a.320","is_oa":false,"landing_page_url":"https://doi.org/10.1587/transfun.e102.a.320","pdf_url":null,"source":{"id":"https://openalex.org/S166990724","display_name":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences","issn_l":"0916-8508","issn":["0916-8508","1745-1337"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","dongbi-c","jufo-1","norway-1","poland-20","russia-white-list-4"],"host_organization":"https://openalex.org/P4320800604","host_organization_name":"Institute of Electronics, Information and Communication Engineers","host_organization_lineage":["https://openalex.org/P4320800604"],"host_organization_lineage_names":["Institute of Electronics, Information and Communication Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"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/A5037537578","display_name":"Hiroyuki Goto","orcid":"https://orcid.org/0000-0001-5959-645X","observed_orcids":["https://orcid.org/0000-0001-5959-645X","https://orcid.org/0009-0001-7974-4736"]},"institutions":[{"id":"https://openalex.org/I204291657","display_name":"Hosei University","ror":"https://ror.org/00bx6dj65","country_code":"JP","type":"education","lineage":["https://openalex.org/I204291657"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Hiroyuki GOTO","raw_affiliation_strings":["Hosei University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hosei University","institution_ids":["https://openalex.org/I204291657"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5023962257","display_name":"Yohei Kakimoto","orcid":"https://orcid.org/0000-0002-0346-3831","observed_orcids":["https://orcid.org/0000-0002-0346-3831"]},"institutions":[{"id":"https://openalex.org/I204291657","display_name":"Hosei University","ror":"https://ror.org/00bx6dj65","country_code":"JP","type":"education","lineage":["https://openalex.org/I204291657"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yohei KAKIMOTO","raw_affiliation_strings":["Hosei University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hosei University","institution_ids":["https://openalex.org/I204291657"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5016439425","display_name":"Yoichi Shimakawa","orcid":"https://orcid.org/0000-0003-4481-8042","observed_orcids":["https://orcid.org/0000-0003-4481-8042"]},"institutions":[{"id":"https://openalex.org/I204291657","display_name":"Hosei University","ror":"https://ror.org/00bx6dj65","country_code":"JP","type":"education","lineage":["https://openalex.org/I204291657"]}],"countries":["JP"],"is_corresponding":false,"raw_author_name":"Yoichi SHIMAKAWA","raw_affiliation_strings":["Hosei University"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hosei University","institution_ids":["https://openalex.org/I204291657"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I204291657"],"apc_list":null,"apc_paid":null,"fwci":0.2293,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.43791625,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":"E102.A","issue":"1","first_page":"320","last_page":"323"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6079000234603882,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6079000234603882,"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/T10698","display_name":"Transportation Planning and Optimization","score":0.25270000100135803,"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"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.03519999980926514,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/shortest-path","display_name":"shortest path","score":0.6499999761581421},{"id":"https://openalex.org/keywords/road-network","display_name":"road network","score":0.5540000200271606},{"id":"https://openalex.org/keywords/time-complexity","display_name":"time complexity","score":0.4650000035762787}],"concepts":[{"id":"https://openalex.org/C157085824","wikidata":"https://www.wikidata.org/wiki/Q2384809","display_name":"TRIPS architecture","level":2,"score":0.7013784050941467},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6756619811058044},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.6189934611320496},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.5563110709190369},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5464063286781311},{"id":"https://openalex.org/C206588197","wikidata":"https://www.wikidata.org/wiki/Q846574","display_name":"Reuse","level":2,"score":0.5304507613182068},{"id":"https://openalex.org/C26951474","wikidata":"https://www.wikidata.org/wiki/Q629283","display_name":"Priority queue","level":3,"score":0.49419334530830383},{"id":"https://openalex.org/C26713055","wikidata":"https://www.wikidata.org/wiki/Q245962","display_name":"Implementation","level":2,"score":0.44439077377319336},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4128856658935547},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.39099347591400146},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.388729065656662},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3160325288772583},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.28737491369247437},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.28259336948394775},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.24490156769752502},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.2027178406715393},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.14431247115135193},{"id":"https://openalex.org/C548081761","wikidata":"https://www.wikidata.org/wiki/Q180388","display_name":"Waste management","level":1,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","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},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1587/transfun.e102.a.320","doi":"https://doi.org/10.1587/transfun.e102.a.320","is_oa":false,"landing_page_url":"https://doi.org/10.1587/transfun.e102.a.320","pdf_url":null,"source":{"id":"https://openalex.org/S166990724","display_name":"IEICE Transactions on Fundamentals of Electronics Communications and Computer Sciences","issn_l":"0916-8508","issn":["0916-8508","1745-1337"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["anvur-scientific","cwts-core","dongbi-c","jufo-1","norway-1","poland-20","russia-white-list-4"],"host_organization":"https://openalex.org/P4320800604","host_organization_name":"Institute of Electronics, Information and Communication Engineers","host_organization_lineage":["https://openalex.org/P4320800604"],"host_organization_lineage_names":["Institute of Electronics, Information and Communication Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.7250000238418579,"display_name":"Sustainable cities and communities"},{"id":"https://metadata.un.org/sdg/9","score":0.651199996471405,"display_name":"Industry, innovation and infrastructure"}],"study_designs":[],"awards":[{"id":"https://openalex.org/G6560115231","display_name":"Exploiting geometric features of natural terrains to construct terrain models","funder_award_id":"18K01126","funder_id":"https://openalex.org/F4320334764","funder_display_name":"Japan Society for the Promotion of Science"}],"funders":[{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1537256577","https://openalex.org/W1978757752","https://openalex.org/W2028893095","https://openalex.org/W2053456827","https://openalex.org/W2084224084","https://openalex.org/W2095941092","https://openalex.org/W2100586428","https://openalex.org/W2160365857","https://openalex.org/W4240200084"],"related_works":["https://openalex.org/W2598746218","https://openalex.org/W7116273495","https://openalex.org/W2068569672","https://openalex.org/W2258194088","https://openalex.org/W2270850818","https://openalex.org/W1997413504","https://openalex.org/W7095514985","https://openalex.org/W145856648","https://openalex.org/W4312536310","https://openalex.org/W2943413613"],"abstract_inverted_index":{"Given":[0],"a":[1,4,74,78],"network":[2,80],"G(V,E),":[3],"lightweight":[5],"method":[6],"to":[7],"calculate":[8],"overlaid":[9],"origin-destination":[10],"(O-D)":[11],"traffic":[12],"flows":[13],"on":[14],"all":[15],"edges":[16],"is":[17,46,64,89],"developed.":[18],"Each":[19],"O-D":[20],"trip":[21],"shall":[22],"select":[23],"the":[24,58,84],"shortest":[25],"path.":[26],"While":[27],"simple":[28],"implementations":[29],"for":[30],"single-source/all-destination":[31],"and":[32,37,50,55],"all-pair":[33],"trips":[34],"need":[35],"O(L\u00b7n)":[36],"O(L\u00b7n2)":[38],"in":[39,81],"worst-case":[40],"time":[41],"complexity,":[42],"respectively,":[43],"our":[44,87],"technique":[45,88],"executed":[47],"with":[48],"O(m+n)":[49],"O(m+n2),":[51],"where":[52],"n=|V|,":[53],"m=|E|,":[54],"L":[56],"represents":[57],"maximum":[59],"arc":[60],"length.":[61],"This":[62],"improvement":[63],"achieved":[65],"by":[66],"reusing":[67],"outcomes":[68],"of":[69,77,86],"priority":[70],"queue-based":[71],"algorithms.":[72],"Using":[73],"GIS":[75],"dataset":[76],"road":[79],"Tokyo,":[82],"Japan,":[83],"effectiveness":[85],"confirmed.":[90]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2019,"cited_by_count":1}],"updated_date":"2026-10-05T09:50:58.205359","created_date":"2019-01-11T00:00:00"}