A TRAFFIC ASSIGNMENT METHOD BY SIMPLIFING NETWORK REPRESENTATION OF MESH SUBAREAS

Abstract

This paper presents and discusses a traffic assignment method by simplifing network representation, in which the assignment calculation is performed alternately with the simplified network over the entire study area and with the detailed (or real life) network in each of the divided mesh area. The aims of developement of this method are to reduce the computation time in the assignment and to attain high accuracy in estimation results. It is concluded through some numerical examples that the estimation errors for the simplified entire network and for the detailed network in each mesh are not significant if the degree of congestion is high and the number of iterations in incremental assignment is large.