期刊
COMPUTERS & OPERATIONS RESEARCH
卷 43, 期 -, 页码 68-77出版社
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2013.08.022
关键词
Logit; Paired combinatorial logit; Stochastic user equilibrium; Traffic assignment; Partial linearization; Line search
类别
资金
- National Science Foundation (NSF) CAREER
- United States, the Oriental Scholar Professorship Program
- Shanghai Ministry of Education in China
- National Research Foundation of Korea
- Korea Government (MEST) [NRF-2010-0029443]
The paired combinatorial logit (PCL) model is one of the recent extended logit models adapted to resolve the overlapping problem in the route choice problem, while keeping the analytical tractability of the logit choice probability function. However, the development of efficient algorithms for solving the PCL model under congested and realistic networks is quite challenging, since it has large-dimensional solution variables as well as a complex objective function. In this paper, we examine the computation and application of the PCL stochastic user equilibrium (SUE) problem under congested and realistic networks. Specifically, we develop an improved path-based partial linearization algorithm for solving the PCL SUE problem by incorporating recent advances in line search strategies to enhance the computational efficiency required to determine a suitable stepsize that guarantees convergence. A real network in the city of Winnipeg is applied to examine the computational efficiency of the proposed algorithm and the robustness of various line search strategies. In addition, in order to acquire the practical implications of the PCL SUE model, we investigate the effectiveness of how the PCL model handles the effects of congestion, stochasticity, and similarity in comparison with the multinomial logit stochastic traffic equilibrium problem and the deterministic traffic equilibrium problem. Published by Elsevier Ltd.
作者
我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。
推荐
暂无数据