Traffic assignment over a network can be carried out for the condition that all drivers will choose their routes so that no driver acting individually can reduce his travel cost by switching over to an alternative route. An equilibrium point is defined as a set of total flows satisfying this criterion. This is a game-theoretic problem and it will be assumed that all the players have completed information about the roadway and traffic conditions at any instant. It is assumed that the travel cost on a link is a function of the total traffic flow on the link. This paper investigates the properties of the equilibrium situation for various types of cost functions with capacity restrictions. (a) for the covering abstract of the symposium, please see irrd abstract no. 224453.
Samenvatting