{"id":"https://openalex.org/W4294084455","doi":"https://doi.org/10.17485/ijst/v15i31.1342","title":"Solving Shortest Route Using Dynamic Programming Problem","display_name":"Solving Shortest Route Using Dynamic Programming Problem","publication_year":2022,"publication_date":"2022-08-21","ids":{"openalex":"https://openalex.org/W4294084455","doi":"https://doi.org/10.17485/ijst/v15i31.1342"},"language":"en","primary_location":{"id":"doi:10.17485/ijst/v15i31.1342","doi":"https://doi.org/10.17485/ijst/v15i31.1342","is_oa":true,"landing_page_url":"https://doi.org/10.17485/ijst/v15i31.1342","pdf_url":"https://sciresol.s3.us-east-2.amazonaws.com/IJST/Articles/2022/Issue-31/IJST-2021-1342.pdf","source":{"id":"https://openalex.org/S2764746358","display_name":"Indian Journal of Science and Technology","issn_l":"0974-5645","issn":["0974-5645","0974-6846"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","norway-1"],"host_organization":"https://openalex.org/P4322615647","host_organization_name":"Indian Society for Education and Environment","host_organization_lineage":["https://openalex.org/P4322615647"],"host_organization_lineage_names":["Indian Society for Education and Environment"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Indian Journal Of Science And Technology","raw_type":"journal-article"},"volume":null,"type":"article","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://sciresol.s3.us-east-2.amazonaws.com/IJST/Articles/2022/Issue-31/IJST-2021-1342.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5020899901","display_name":"Tadios Kiros Kenea","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I42869670","display_name":"Arba Minch University","ror":"https://ror.org/00ssp9h11","country_code":"ET","type":"education","lineage":["https://openalex.org/I42869670"]}],"countries":["ET"],"is_corresponding":true,"raw_author_name":"Tadios Kiros Kenea","raw_affiliation_strings":["Department Of Mathematics, Arbaminch University, Arbaminch, Ethiopia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department Of Mathematics, Arbaminch University, Arbaminch, Ethiopia","institution_ids":["https://openalex.org/I42869670"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5020899901"],"corresponding_institution_ids":["https://openalex.org/I42869670"],"apc_list":null,"apc_paid":null,"fwci":0.1891,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.45152838,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":88,"max":93},"biblio":{"volume":"15","issue":"31","first_page":"1527","last_page":"1531"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.7651000022888184,"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"}},"topics":[{"id":"https://openalex.org/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.7651000022888184,"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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.1582999974489212,"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/T12709","display_name":"Optimization and Mathematical Programming","score":0.07029999792575836,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/traveling-salesman-problem","display_name":"traveling salesman problem","score":0.9610000252723694},{"id":"https://openalex.org/keywords/shortest-path","display_name":"shortest path","score":0.8119999766349792},{"id":"https://openalex.org/keywords/dynamic-programming","display_name":"dynamic programming","score":0.9210000038146973},{"id":"https://openalex.org/keywords/recursive-equations","display_name":"recursive equations","score":0.8569999933242798},{"id":"https://openalex.org/keywords/route-optimization","display_name":"route optimization","score":0.5979999899864197}],"concepts":[{"id":"https://openalex.org/C175859090","wikidata":"https://www.wikidata.org/wiki/Q322212","display_name":"Travelling salesman problem","level":2,"score":0.8770255446434021},{"id":"https://openalex.org/C37404715","wikidata":"https://www.wikidata.org/wiki/Q380679","display_name":"Dynamic programming","level":2,"score":0.6873505115509033},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6613316535949707},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.6021490693092346},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5627263784408569},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5214666128158569},{"id":"https://openalex.org/C106472803","wikidata":"https://www.wikidata.org/wiki/Q291440","display_name":"2-opt","level":3,"score":0.4608473479747772},{"id":"https://openalex.org/C4331618","wikidata":"https://www.wikidata.org/wiki/Q7836034","display_name":"Traveling purchaser problem","level":4,"score":0.4513697326183319},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.41918420791625977},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2830444574356079},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.17178642749786377},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.06943604350090027}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.17485/ijst/v15i31.1342","doi":"https://doi.org/10.17485/ijst/v15i31.1342","is_oa":true,"landing_page_url":"https://doi.org/10.17485/ijst/v15i31.1342","pdf_url":"https://sciresol.s3.us-east-2.amazonaws.com/IJST/Articles/2022/Issue-31/IJST-2021-1342.pdf","source":{"id":"https://openalex.org/S2764746358","display_name":"Indian Journal of Science and Technology","issn_l":"0974-5645","issn":["0974-5645","0974-6846"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","norway-1"],"host_organization":"https://openalex.org/P4322615647","host_organization_name":"Indian Society for Education and Environment","host_organization_lineage":["https://openalex.org/P4322615647"],"host_organization_lineage_names":["Indian Society for Education and Environment"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Indian Journal Of Science And Technology","raw_type":"journal-article"},{"id":"pmh:oai:ikprress.org:article/6448","doi":null,"is_oa":true,"landing_page_url":"https://ikprress.org/index.php/AJOMCOR/article/view/6448","pdf_url":null,"source":{"id":"https://openalex.org/S2764593711","display_name":"Asian journal of mathematics and computer research","issn_l":"2395-4205","issn":["2395-4205","2395-4213"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2395-4213","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:HAL:hal-05185801v1","doi":null,"is_oa":false,"landing_page_url":"https://hal.science/hal-05185801v1","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4405252976","host_organization_name":"Centre pour la Communication Scientifique Directe","host_organization_lineage":["https://openalex.org/I4405252976"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Asian Journal of Mathematics and Computer Research, 2021, 28 (2), pp.27-33","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:zenodo.org:13377934","doi":null,"is_oa":true,"landing_page_url":"https://doi.org/10.17485/IJST/v15i31.1342","pdf_url":null,"source":{"id":"https://openalex.org/S4306400562","display_name":"Zenodo (CERN European Organization for Nuclear Research)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I67311998","host_organization_name":"European Organization for Nuclear Research","host_organization_lineage":["https://openalex.org/I67311998"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Indian Journal of Science and Technology, 15(31), 1527-1531, (2022-08-12)","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.17485/ijst/v15i31.1342","doi":"https://doi.org/10.17485/ijst/v15i31.1342","is_oa":true,"landing_page_url":"https://doi.org/10.17485/ijst/v15i31.1342","pdf_url":"https://sciresol.s3.us-east-2.amazonaws.com/IJST/Articles/2022/Issue-31/IJST-2021-1342.pdf","source":{"id":"https://openalex.org/S2764746358","display_name":"Indian Journal of Science and Technology","issn_l":"0974-5645","issn":["0974-5645","0974-6846"],"is_oa":true,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","norway-1"],"host_organization":"https://openalex.org/P4322615647","host_organization_name":"Indian Society for Education and Environment","host_organization_lineage":["https://openalex.org/P4322615647"],"host_organization_lineage_names":["Indian Society for Education and Environment"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Indian Journal Of Science And Technology","raw_type":"journal-article"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4294084455.pdf","grobid_xml":"https://content.openalex.org/works/W4294084455.grobid-xml"},"referenced_works_count":16,"referenced_works":["https://openalex.org/W1481919380","https://openalex.org/W1545070306","https://openalex.org/W1553971664","https://openalex.org/W2020446780","https://openalex.org/W2033097611","https://openalex.org/W2048674295","https://openalex.org/W2067957566","https://openalex.org/W2086345724","https://openalex.org/W2147255464","https://openalex.org/W2159495578","https://openalex.org/W2169690805","https://openalex.org/W2324585138","https://openalex.org/W3093633678","https://openalex.org/W3099289621","https://openalex.org/W4407591777","https://openalex.org/W6815694111"],"related_works":["https://openalex.org/W4399321233","https://openalex.org/W2363253429","https://openalex.org/W3089295236","https://openalex.org/W1174337165","https://openalex.org/W2184101507","https://openalex.org/W2522671694","https://openalex.org/W4317904492","https://openalex.org/W2352092555","https://openalex.org/W3196507412","https://openalex.org/W1971483538"],"abstract_inverted_index":{"Objective:-":[0],"To":[1],"determine":[2,22,96],"the":[3,23,35,110,137,141],"shortest":[4,24,97],"distance":[5,25],"in":[6,26,44,83,99],"salesman":[7,27,37,81,149,153],"of":[8,28,34,80,116,128,143],"dynamic":[9,29,40,84,100,138],"programming":[10,30,41,85,101,105,139],"problem.":[11,31,102,150],"Method:-":[12],"Recursive":[13],"equation":[14,93,145,177],"and":[15,53,59,73,90,159,165],"arrow":[16,68],"drawing":[17,69],"methods":[18,56],"are":[19,125],"used":[20],"to":[21,61,88,95,107,131,146,157,161],"An":[32],"implementation":[33],"traveling":[36,148],"problem":[38,86,112,154],"using":[39,163],"is":[42,71,155],"presented":[43],"this":[45],"study":[46],"which":[47],"generates":[48],"optimal":[49,63],"answer.":[50],"Findings:-":[51],"Forward":[52],"backward":[54,91,166],"recursive":[55,92,144,167],"take":[57],"time":[58],"complex":[60],"find":[62],"solution":[64],"(shortest":[65],"distance)":[66],"but":[67],"method":[70,94],"useful":[72],"simple":[74],"for":[75],"solving":[76],"several":[77],"different":[78],"types":[79],"problems":[82,118],"compared":[87],"forward":[89,164],"route":[98],"Novelty:-":[103],"Dynamic":[104,170],"allows":[106],"break":[108],"up":[109],"given":[111],"into":[113],"a":[114,126],"number":[115,127],"sub":[117],"or":[119],"stages.":[120],"At":[121],"each":[122],"stage":[123],"there":[124],"decision":[129],"alternatives":[130],"be":[132],"called":[133],"as":[134],"states.":[135],"So":[136],"uses":[140],"idea":[142],"solve":[147,162],"The":[151],"Traveling":[152],"easy":[156],"understand":[158],"difficult":[160],"equation.":[168],"Keywords:":[169],"programming;":[171],"Salesman":[172],"problem;":[173],"Operation":[174],"research;":[175],"Recursion":[176]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":1}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2022-09-01T00:00:00"}