变分不等式
数学优化
迭代法
流量网络
凸优化
计算机科学
正多边形
简单(哲学)
流量(计算机网络)
数学
几何学
计算机安全
认识论
哲学
作者
Sang Quang Nguyen,Clermont Dupuis
出处
期刊:Transportation Science
[Institute for Operations Research and the Management Sciences]
日期:1984-05-01
卷期号:18 (2): 185-202
被引量:404
标识
DOI:10.1287/trsc.18.2.185
摘要
In the presence of several user categories or transportation modes, or when transportation costs on each arc of a network depend on the flows on adjacent arcs, the traffic equilibrium problem may be expressed as a variational problem. Methods for determining traffic equilibria are then adaptations of techniques for solving variational inequalities. In this paper, we present a new convex optimization formulation for the general traffic equilibrium problem, and propose a simple iterative method for calculating traffic equilibria, which essentially involves postoptimizing a linear sub-problem at each iteration. Preliminary computational results are reported.
科研通智能强力驱动
Strongly Powered by AbleSci AI