{"id":"https://openalex.org/W76834408","doi":"https://doi.org/10.20965/jaciii.2008.p0546","title":"Optimal Route Based on Dynamic Programming for Road Networks","display_name":"Optimal Route Based on Dynamic Programming for Road Networks","publication_year":2008,"publication_date":"2008-11-20","ids":{"openalex":"https://openalex.org/W76834408","doi":"https://doi.org/10.20965/jaciii.2008.p0546","mag":"76834408"},"language":"en","primary_location":{"id":"doi:10.20965/jaciii.2008.p0546","doi":"https://doi.org/10.20965/jaciii.2008.p0546","is_oa":true,"landing_page_url":"https://doi.org/10.20965/jaciii.2008.p0546","pdf_url":null,"source":{"id":"https://openalex.org/S4511983","display_name":"Journal of Advanced Computational Intelligence and Intelligent Informatics","issn_l":"1343-0130","issn":["1343-0130","1883-8014"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","doaj","dongbi-d","jufo-1","poland-20","russia-white-list-3"],"host_organization":"https://openalex.org/P4324309662","host_organization_name":"Fuji Technology Press Ltd.","host_organization_lineage":["https://openalex.org/P4324309662"],"host_organization_lineage_names":["Fuji Technology Press Ltd."],"type":"journal"},"license":"cc-by-nd","license_id":"https://openalex.org/licenses/cc-by-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Advanced Computational Intelligence and Intelligent Informatics","raw_type":"journal-article"},"volume":null,"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.20965/jaciii.2008.p0546","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111587589","display_name":"Manoj Kanta Mainali","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Manoj Kanta Mainali","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5100774583","display_name":"Kaoru Shimada","orcid":"https://orcid.org/0000-0002-4747-9595","observed_orcids":["https://orcid.org/0000-0002-4747-9595"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kaoru Shimada","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037937808","display_name":"Shingo Mabu","orcid":"https://orcid.org/0000-0002-8759-8337","observed_orcids":["https://orcid.org/0000-0002-8759-8337"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Shingo Mabu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5013008417","display_name":"Kotaro Hirasawa","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kotaro Hirasawa","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":22.0726,"has_fulltext":false,"cited_by_count":37,"citation_normalized_percentile":{"value":0.99140879,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":88,"max":98},"biblio":{"volume":"12","issue":"6","first_page":"546","last_page":"553"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.8461999893188477,"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"}},"topics":[{"id":"https://openalex.org/T10698","display_name":"Transportation Planning and Optimization","score":0.8461999893188477,"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/T10524","display_name":"Traffic control and management","score":0.06109999865293503,"subfield":{"id":"https://openalex.org/subfields/2207","display_name":"Control and Systems 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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.04349999874830246,"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/optimal-route-search","display_name":"optimal route search","score":0.7129999995231628},{"id":"https://openalex.org/keywords/road-network","display_name":"road network","score":0.9409999847412109},{"id":"https://openalex.org/keywords/q-methodology","display_name":"Q methodology","score":0.6190000176429749},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"dynamic programming","score":0.8650000095367432},{"id":"https://openalex.org/keywords/origin-destination-pairs","display_name":"origin-destination pairs","score":0.7080000042915344},{"id":"https://openalex.org/keywords/travel-time","display_name":"travel time","score":0.7639999985694885},{"id":"https://openalex.org/keywords/dijkstra-algorithm-comparison","display_name":"Dijkstra algorithm comparison","score":0.8100000023841858}],"concepts":[{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.7570272088050842},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7432657480239868},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.7040375471115112},{"id":"https://openalex.org/C173870130","wikidata":"https://www.wikidata.org/wiki/Q8548","display_name":"Dijkstra's algorithm","level":4,"score":0.6784484386444092},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5948013663291931},{"id":"https://openalex.org/C2985733770","wikidata":"https://www.wikidata.org/wiki/Q1233007","display_name":"Travel time","level":2,"score":0.5680260062217712},{"id":"https://openalex.org/C2776291640","wikidata":"https://www.wikidata.org/wiki/Q2912517","display_name":"Value (mathematics)","level":2,"score":0.5293087959289551},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3826407790184021},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.3088156580924988},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2050042748451233},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.12144231796264648},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C22212356","wikidata":"https://www.wikidata.org/wiki/Q775325","display_name":"Transport engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.20965/jaciii.2008.p0546","doi":"https://doi.org/10.20965/jaciii.2008.p0546","is_oa":true,"landing_page_url":"https://doi.org/10.20965/jaciii.2008.p0546","pdf_url":null,"source":{"id":"https://openalex.org/S4511983","display_name":"Journal of Advanced Computational Intelligence and Intelligent Informatics","issn_l":"1343-0130","issn":["1343-0130","1883-8014"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","doaj","dongbi-d","jufo-1","poland-20","russia-white-list-3"],"host_organization":"https://openalex.org/P4324309662","host_organization_name":"Fuji Technology Press Ltd.","host_organization_lineage":["https://openalex.org/P4324309662"],"host_organization_lineage_names":["Fuji Technology Press Ltd."],"type":"journal"},"license":"cc-by-nd","license_id":"https://openalex.org/licenses/cc-by-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Advanced Computational Intelligence and Intelligent Informatics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.20965/jaciii.2008.p0546","doi":"https://doi.org/10.20965/jaciii.2008.p0546","is_oa":true,"landing_page_url":"https://doi.org/10.20965/jaciii.2008.p0546","pdf_url":null,"source":{"id":"https://openalex.org/S4511983","display_name":"Journal of Advanced Computational Intelligence and Intelligent Informatics","issn_l":"1343-0130","issn":["1343-0130","1883-8014"],"is_oa":true,"is_in_doaj":true,"is_core":true,"listed_in":["cwts-core","doaj","dongbi-d","jufo-1","poland-20","russia-white-list-3"],"host_organization":"https://openalex.org/P4324309662","host_organization_name":"Fuji Technology Press Ltd.","host_organization_lineage":["https://openalex.org/P4324309662"],"host_organization_lineage_names":["Fuji Technology Press Ltd."],"type":"journal"},"license":"cc-by-nd","license_id":"https://openalex.org/licenses/cc-by-nd","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Journal of Advanced Computational Intelligence and Intelligent Informatics","raw_type":"journal-article"},"sustainable_development_goals":[],"sustainable_development_goals_aurora":[{"display_name":"Sustainable cities and communities","score":0.7099999785423279,"id":"https://metadata.un.org/sdg/11"}],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W32403112","https://openalex.org/W1501936286","https://openalex.org/W1671669295","https://openalex.org/W1980516134","https://openalex.org/W1993157704","https://openalex.org/W2000687208","https://openalex.org/W2061632451","https://openalex.org/W2065474496","https://openalex.org/W2113772484","https://openalex.org/W2135810626","https://openalex.org/W2137073837","https://openalex.org/W2144050074","https://openalex.org/W2152324445","https://openalex.org/W2169528473"],"related_works":["https://openalex.org/W2136382602","https://openalex.org/W1692264585","https://openalex.org/W1574078913","https://openalex.org/W1973816112","https://openalex.org/W2167011587","https://openalex.org/W2596265630","https://openalex.org/W2552732283","https://openalex.org/W1534287687","https://openalex.org/W1563155280","https://openalex.org/W1989648672"],"abstract_inverted_index":{"One":[0],"of":[1,5,52,162,172,221],"the":[2,6,13,17,38,59,70,79,84,90,94,98,102,109,121,149,154,156,169,173,187,194,201,206,215,218,222],"main":[3],"functions":[4],"traffic":[7],"navigation":[8],"systems":[9],"is":[10,76,133],"to":[11,16,36,67,83,101,126,136,153,166],"find":[12,137,160],"optimal":[14,39,43,71,99,146,179],"route":[15,40,100,180],"destination.":[18,129],"In":[19,164],"this":[20],"paper,":[21],"we":[22],"propose":[23],"an":[24,177],"iterative":[25],"Q":[26,30,56,74,95,111,117,190,195,207],"value":[27,75,112],"updating":[28],"algorithm,":[29],"method,":[31],"based":[32],"on":[33,214],"dynamic":[34],"programming":[35],"search":[37,68],"and":[41,200],"its":[42],"traveling":[44,60,81,151,170,219],"time":[45,61,82,152,171,220],"for":[46,69],"a":[47,87,127,138],"given":[48],"Origin-Destination":[49],"(OD)":[50],"pair":[51],"road":[53,174,223],"networks.":[54],"The":[55,73,116,130],"method":[57,118,132,158,196,208],"uses":[58],"information":[62],"available":[63],"at":[64,113],"adjacent":[65],"intersections":[66],"route.":[72],"defined":[77],"as":[78],"minimum":[80,110],"destination":[85,103],"when":[86,168,217],"vehicle":[88],"takes":[89],"next":[91],"intersection.":[92,115],"When":[93],"values":[96],"converge,":[97],"can":[104,159,181,209],"be":[105,182],"determined":[106],"by":[107],"choosing":[108],"each":[114],"gives":[119],"us":[120],"solutions":[122],"from":[123],"multiple":[124,145],"origins":[125],"single":[128,139],"proposed":[131,157],"not":[134],"restricted":[135],"solution,":[140],"but,":[141],"if":[142],"there":[143],"exist":[144],"routes":[147],"with":[148,186,197],"identical":[150],"destination,":[155],"all":[161],"it.":[163],"addition":[165],"that,":[167],"sections":[175,224],"changes,":[176],"alternative":[178],"found":[183],"easily":[184],"starting":[185],"already":[188],"obtained":[189],"values.":[191],"We":[192],"compared":[193],"Dijkstra":[198],"algorithm":[199],"simulation":[202],"results":[203],"showed":[204],"that":[205],"give":[210],"better":[211],"performances,":[212],"depending":[213],"situations,":[216],"changes.":[225]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":4}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2016-06-24T00:00:00"}