Optimal Navigation in Regular Transport Networks with Minor Traffic Congestion

Questions of the organization of movement in transport networks are considered. The emphasis is placed on the most simple and cheap solutions. Optimal nodal navigation in a network with insignificant traffic jams is sought. It is proved that, for a square grid, the fastest movement to the origin of coordinates will be obtained when the route tends to the coordinate diagonals with subsequent winding on them.