Probabilistic routing algorithm

• Main Author: Ta Hoang, Thuc Khanh
• Other Authors: School of Computer Engineering
• Format: Final Year Project
• Language: English
• Published: 2014
• Subjects: DRNTU::Engineering::Computer science and engineering::Computer systems organization::Special-purpose and application-based systems
• Online Access: http://hdl.handle.net/10356/59268
• Institution: Nanyang Technological University

Over the years, several routing algorithms that select a routine from origin to destination has been studied. Route selection can be based on the route’s distance, ERP fare, or expected travel time based. Besides the purpose of getting a correct route direction, users’ purpose is arriving the destination within a desire time period. If the users considered each minute late costs price, then select the route with higher probability of being on time would reduce the expected cost. The route with shortest distance may not be the route with highest probability of being on time. In addition, the shortest expected travel time route still implies the risk of getting longer traveling time, and users cannot reach the destination on time. Therefore, this project proposed a new routing algorithm which took the probability of being on-time into consideration. Besides the stochastic routing, this report described a collaborating routing mechanism, which can reduce the traffic load in specific roads. In this report, the algorithm design, software design, software implementation, and testing process, conclusion and future improvements were discussed.