Abstract
This study considers a nonlinear optimization problem used to achieve user equilibrium in the network traffic assignment problem. By providing the Karush Kuhn Tucker conditions of this optimization problem, it is converted into a system of differential equations using the Lagrange function. This system is then redefined as a Lagrange neural network, which is proven to be asymptotically and lyapunov stable. Finally, a numerical method are used to demonstrate that the results obtained from this neural network are a solution to the optimization problem and converge to user equilibrium.
Reference28 articles.
1. J.G. Wardrop, "Some theoretical aspects of road traffic research," Proceedings of the Institution of Civil Engineers, Part II, vol. 1, no. 3, pp. 325-378, 1952.
2. M. Frank and P. Wolfe, "An algorithm for quadratic programming," Naval Research Logistics Quarterly, vol. 3, no. 1-2, pp. 95-110, 1956.
3. Y. Sheffi and W. B. Powell, "A survey of transportation network models," Transportation Research Part B: Methodological, vol. 19, no. 5, pp. 381-391, 1985.
4. C. F. Daganzo and Y. Sheffi, "On stochastic models of traffic assignment," Transportation Science, vol. 11, no. 3, pp. 253-274, 1977.
5. M. Beckmann, C. B. McGuire, and C. B. Winsten, "Studies in the economics of transportation," Yale University Press, 1956.