The Driver´s Shortest Path Decision-Making Model and its Algorithm Study Based on Grey Number Superiority Relationship

The problem of choosing the shortest path with uncertain information is important for a driver choosing driving routes. This article delves into the problem of choosing models for driving routes in reality. According to us, with uncertain information, such choosing behavior reflects the issue of deciding the shortest path based on grey number superiority relationship. With the help of thoughts and the theoretical methods of grey system, we propose judging rules for grey number superiority relationship, and prove that such relationship is a totally ordered one. We then build a shortest path decision model based on the grey number superiority relationship, and design grey Dijkstra (G-D) algorithm, which can effectively solve the problem of choosing the shortest path