.png){kind=icon}
返回
A self-adaptive gradient projection algorithm for the nonadditive traffic equilibrium problem
.png){kind=icon}
PRE
AI
DOI：10.1016/j.cor.2011.02.018.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Gradient projection (GP) algorithm has been shown as an efficient algorithm for solving the traditional traffic equilibrium problem with additive route costs. Recently, GP has been extended to solve the nonadditive traffic equilibrium problem (NaTEP), in which the cost incurred on each route is not just a simple sum of the link costs on that route. However, choosing an appropriate stepsize, which is not known a priori, is a critical issue in GP for solving the NaTEP. Inappropriate selection of the stepsize can significantly increase the computational burden, or even deteriorate the convergence. In this paper, a self-adaptive gradient projection (SAGP) algorithm is proposed. The self-adaptive scheme has the ability to automatically adjust the stepsize according to the information derived from previous iterations. Furthermore, the SAGP algorithm still retains the efficient flow update strategy that only requires a simple projection onto the nonnegative orthant. Numerical results are also provided to illustrate the efficiency and robustness of the proposed algorithm. Published by Elsevier Ltd.
Keyword:
Traffic equilibrium problem
Nonadditive route cost
Gradient projection algorithm
Self-adaptive scheme
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
C
IF:
4.3
论文数:
6.5K
被引数:
1.8W
机构
引用论文
.png){kind=icon}
Solving non-additive traffic assignment problems: A descent method for co-coercive variational inequalities解决非加性交通分配问题: 共同强制变分不等式的下降方法
PREAI
分享收藏分享收藏
查看更多内容