| Summary: | 碩士 === 國立臺灣大學 === 土木工程學研究所 === 101 === “All roads lead to Rome.” Because of the developing of transportation, we usually have a lot of way that we can pick to reach a destination. With the choices increasing, which way should we choose become another problem. There are kinds of route guidance program in the market. Whatever “pre-trip route guiding” or “en-route route guiding,” most of them use the length of path to make a decision. However we can usually found out that the route it provides always in a traffic jam.
To solve the problem that traditional route guidance programs usually pick out the shortest route but not the best route, this study replaces the spacing cost with traveling-time cost to build a time-dependent A* route planning system which can match highway characteristic. This program based on A* Algorithm and uses VD and ETC data as data sources. It also contain time-dependent backward algorithm to fit different travel planning demands. Users just input origin, destination, and expectation departure/arrival time, system will output recommend route and total traveling time.
This study verify that A* Algorithm can limit route-searching direction to find a satisfactory route within a short time. While the road network coming huge and complex, it can efficaciously saving calculating time. This study also verify that backward algorithm get the same result as forward algorithm, though backward algorithm take more time to solve the problem.
|
|---|
