Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Finding a route with shortest travel time according to the traffic condition can help travelers to make better route choice decisions. , the shortest travel time based on FCD (floating car data) which is used to assess overall traffic conditions is proposed. To better fit FCD and road map, a new map matching algorithm which fully considers distance factor, direction factor, and accessibility factor is designed to map all GPS (Global Positioning System) points to roads. A mixed graph structure is constructed and a route analysis algorithm of shortest travel time which considers the dynamic edge ight is designed. By comparing with other map matching algorithms, the proposed method has a higher accuracy. The comparison results show that the shortest travel time path is longer than the shortest distance path, but it costs less traveling time. The implementation of the route choice based on the shortest travel time method can be used to guide people’s travel by selecting the space-time dependent optimal path.
['Jingwei Shen', 'Yifang Ban']
I am writing a research paper on a idea Route Choice of the Shortest Travel Time Based on Floating Car Data
[{"from": "human", "value": "I am writing a research paper on a idea Route Choice of the Shortest Travel Time Based on Floating Car Data"}, {"from": "gpt", "value": "Thats a unique idea.You should consider the following idea to enhance your idea so that it would impact uniquely: Finding a route with shortest travel time according to the traffic condition can help travelers to make better route choice decisions. , the shortest travel time based on FCD (floating car data) which is used to assess overall traffic conditions is proposed. To better fit FCD and road map, a new map matching algorithm which fully considers distance factor, direction factor, and accessibility factor is designed to map all GPS (Global Positioning System) points to roads. A mixed graph structure is constructed and a route analysis algorithm of shortest travel time which considers the dynamic edge ight is designed. By comparing with other map matching algorithms, the proposed method has a higher accuracy. The comparison results show that the shortest travel time path is longer than the shortest distance path, but it costs less traveling time. The implementation of the route choice based on the shortest travel time method can be used to guide people\u2019s travel by selecting the space-time dependent optimal path."}]