• Journal of Korean Society of Transportation
• /
• v.20 no.1
• /
• pp.77-90
• /
• 2002

Network expansion has been an inevitable method for most traffic equilibrium assignments to consider intersection movements such as intersection delays. The drawback of network expansion is that because it dramatically increases network sizes to emulate possible directional movements as corresponding links, not only is complexities for building network amplified, but computational performance is shrunk. This paper Proposes a new variational inequality formulation for a user-optimal traffic equilibrium assignment model to explicitly consider directional delays without building expanded network structures. In the formulation, directional delay functions are directly embedded into the objective function, thus any modification of networks is not required. By applying a vine-based shortest Path algorithm into the diagonalization algorithm to solve the problem, it is additionally demonstrated that various loop-related movements such as U-Turn, P-Turn, etc., which are frequently witnessed near urban intersections, can also be imitated by blocking some turning movements of intersections. The proposed formulation expects to augment computational performance through reduction of network-building complexities.