.png){kind=icon}
返回
An algorithm for the stochastic user equilibrium problem
.png){kind=icon}
PRE
AI
DOI：10.1016/0191-2615(95)00026-7.png)
.png){kind=icon}
原文求助.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
In this paper we present a new algorithm for the approximate solution of the legit-based stochastic user equilibrium problem. The main advantage of this algorithm is that it provides route flows explicitly, of particular interest in the evaluation of route guidance and information systems; in previously proposed methods for the stochastic user equilibrium problem, only link flows are provided. The proposed algorithm alternates between two main phases. In the subproblem phase, profitable routes are generated. In the restricted master problem phase, a descent method is used to solve the restriction to the original problem to the subset of the total set of routes generated so far. We present and evaluate alternative strategies for generating routes algorithmically, and discuss the possibility of utilizing such strategies for reducing the inherent problem of overlapping route flows in legit-based traffic models. Copyright (C) 1996 Elsevier Science Ltd.
Keyword:
TRAFFIC ASSIGNMENT MODEL
SIMPLICIAL DECOMPOSITION
NETWORKS
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
6.3
论文数:
3.5K
被引数:
1.9W
机构
暂无机构信息
引用论文
Responses of riparian plants to habitat changes following restoration of channelized streams.png)
Ecohydrology
EcohydrologyIF0
PREAI
分享收藏分享收藏分享收藏
查看更多内容