Giang Vu Thai, Ngan Nguyen Thi Kim, Hoang Nguyen Ba, Duc Bui Minh
{"title":"一种改进的dijkstra算法寻找河内市公交用户的最小时间路径","authors":"Giang Vu Thai, Ngan Nguyen Thi Kim, Hoang Nguyen Ba, Duc Bui Minh","doi":"10.18173/2354-1059.2021-0049","DOIUrl":null,"url":null,"abstract":"In Hanoi, many roads are congested during rush hour. When going through congested roads, the movement of vehicles is very slow. As a result, traveling over a short and congested road may take more time than traveling over a longer and uncongested road. Therefore, in this paper, we study the problem of finding optimal bus routes that take less time, considering the traffic jams. We extend Dijkstra's algorithm to compute waiting time at bus stations and traveling time of buses. The experimental results show that our algorithm is suitable.","PeriodicalId":17007,"journal":{"name":"Journal of Science Natural Science","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2021-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"AN IMPROVED DIJKSTRA ALGORITHM TO FIND MINIMUM TIME PATHS FOR BUS USERS IN HANOI\",\"authors\":\"Giang Vu Thai, Ngan Nguyen Thi Kim, Hoang Nguyen Ba, Duc Bui Minh\",\"doi\":\"10.18173/2354-1059.2021-0049\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In Hanoi, many roads are congested during rush hour. When going through congested roads, the movement of vehicles is very slow. As a result, traveling over a short and congested road may take more time than traveling over a longer and uncongested road. Therefore, in this paper, we study the problem of finding optimal bus routes that take less time, considering the traffic jams. We extend Dijkstra's algorithm to compute waiting time at bus stations and traveling time of buses. The experimental results show that our algorithm is suitable.\",\"PeriodicalId\":17007,\"journal\":{\"name\":\"Journal of Science Natural Science\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2021-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Journal of Science Natural Science\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.18173/2354-1059.2021-0049\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of Science Natural Science","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.18173/2354-1059.2021-0049","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
AN IMPROVED DIJKSTRA ALGORITHM TO FIND MINIMUM TIME PATHS FOR BUS USERS IN HANOI
In Hanoi, many roads are congested during rush hour. When going through congested roads, the movement of vehicles is very slow. As a result, traveling over a short and congested road may take more time than traveling over a longer and uncongested road. Therefore, in this paper, we study the problem of finding optimal bus routes that take less time, considering the traffic jams. We extend Dijkstra's algorithm to compute waiting time at bus stations and traveling time of buses. The experimental results show that our algorithm is suitable.
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
