Computation and application of the paired combinatorial logit stochastic user equilibrium problem

Computation and application of the paired combinatorial logit stochastic user equilibrium problem
复制标题

DOI:
10.1016/j.cor.2013.08.022
复制
发表时间:
2014-03
期刊:
Comput. Oper. Res.
影响因子:
--
通讯作者:
A. Chen;S. Ryu;Xiangdong Xu;Keechoo Choi
A. Chen;S. Ryu;Xiangdong Xu;Keechoo Choi
中科院分区:
其他
文献类型:
--
作者:
A. Chen;S. Ryu;Xiangdong Xu;Keechoo Choi

文献摘要

被引文献

相似文献

成对组合logit(PCL)模型是近年来发展起来的一种扩展logit模型,用于解决路径选择问题中的重叠问题,同时保持了logit选择概率函数的分析易处理性。然而,开发有效的算法来解决拥挤和现实网络下的PCL模型是相当具有挑战性的,因为它具有高维的解决方案变量以及复杂的目标函数。在本文中,我们研究的PCL随机用户平衡(SUE)问题的计算和应用在拥挤和现实的网络。具体而言,我们开发了一种改进的基于路径的部分线性化算法,通过将线搜索策略的最新进展,以提高所需的计算效率,以确定一个合适的步长,保证收敛解决PCL SUE问题。一个真实的网络在城市的温尼伯,以检查所提出的算法的计算效率和各种线搜索策略的鲁棒性。此外,为了获得PCL SUE模型的实际意义,我们调查的有效性PCL模型如何处理的影响,拥挤,随机性和相似性相比,多项logit随机交通平衡问题和确定性交通平衡问题。
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.