VEHICLE ROUTE ASSIGNMENT WITH CONSIDERATION OF CROSSING AND MERGING IN GRID ROAD NETWORK

Abstract

In this paper, we compare four routing systems with respect to traffic crossing and merging at intersections. Right turn generates more crossings at intersections than left turn in general and the crossings (and mergings) obstruct smooth traffic and make journey times longer. This paper analyzes some routing systems in terms of travel times for movement demands, paths of them, and crossings and mergings of paths. When there are plural shortest paths among origin and destination pairs in a grid road network, we assume four routing systems: left turn, right turn, outer turn, and minimum crossing and merging assignment. The four routing systems are compared by a scheduling problem to minimize the maximum arrival time for a set of origin-destination pairs. In the scheduling problem, fixed times for safety passing at intersections and proper inter-vehicle distance on links are set as constraint conditions. The results show the right turn system is the worst and minimum crossing and merging assignment system is the best in terms of the averages of maximum arrival times through numerical experiments using problem instances.