Samenvatting
The traffic assignment problem in a traffic flow network is considered. A network of the problem is defined by a set of arcs connecting nodes, origin-destination (OD) pairs and unilateral paths connecting the OD pairs. By means of a graph theoretical approach, fundamental equations for the so-called equal-cost assignment have been derived in Vector-matrix forms, and new algorithms are constructed based on these fundamental equations.