This paper presents two solution approaches for taking into account the displacement mode (forward or in reverse) of vehicles during the solution of the shortest path problem. In the first approach, a graph including all aspects of the problem is constructed and a classical shortest path algorithm is used to solve the problem. In the second approach, a more simple graph is constructed, and all the constraints of the problem are considered during the solution of the shortest path problem. This problem is important for routing a fleet of automated vehicles on a one-lane bidirectional graph.