In this paper we present tatonnement models for calculating static Wardropian user equilibria on congested networks with fully general demand and cost structures. We present both a qualitative analysis of stability and numerical studies which show that such an approach provides a reliable means for determining static user equilibria. We also describe circumstances for which these models depict day-to-day adjustments from one realizable disequilibrium state to another and how these adjustment processes differ depending on the “quality” of the information being provided by (abstract) traveler information systems. Specifically, we demonstrate that such dynamic adjustment processes settle down to equilibria both when information is complete and when it is incomplete.

The equilibrium network design problem can be formulated as a mathematical program with variational inequality constraints. We know this problem is nonconvex; hence, it is difficult to solve for a globally optimal solution. In this paper we propose a simulated annealing algorithm for the equilibrium network design problem. We demonstrate the ability of this algorithm to determine a globally optimal solution for two different networks. One of these describes an actual city in the midwestern United States.

No abstract

No abstract

No abstract