C-logit stochastic user equilibrium model: formulations and solution algorithm

Zhong Zhou, A. Chen, S. Bekhor
{"title":"C-logit stochastic user equilibrium model: formulations and solution algorithm","authors":"Zhong Zhou, A. Chen, S. Bekhor","doi":"10.1080/18128600903489629","DOIUrl":null,"url":null,"abstract":"This article considers the stochastic user equilibrium (SUE) problem with the route choice model based on the C-logit function. The C-logit model has a simple closed-form analytical probability expression and requires relatively lower calibration efforts and represents a more realistic route choice behaviour compared with the multinomial logit model. This article proposes two versions of the C-logit SUE model that captures the route similarity using different attributes in the commonality factors. The two versions differ with respect to the independence assumption between cost and flow. The corresponding stochastic traffic equilibrium models are called the length-based and congestion-based C-logit SUE models, respectively. To formulate the length-based C-logit SUE model, an equivalent mathematical programming formulation is proposed. For the congestion-based C-logit SUE model, we provide two equivalent variational inequality formulations. To solve the proposed formulations, a new self-adaptive gradient projection algorithm is developed. The proposed formulations and new solution algorithm are tested in two well-known networks. Numerical results demonstrate the validity of the formulations and solution algorithm.","PeriodicalId":49416,"journal":{"name":"Transportmetrica","volume":"8 1","pages":"17 - 41"},"PeriodicalIF":0.0000,"publicationDate":"2012-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1080/18128600903489629","citationCount":"147","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Transportmetrica","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1080/18128600903489629","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 147

Abstract

This article considers the stochastic user equilibrium (SUE) problem with the route choice model based on the C-logit function. The C-logit model has a simple closed-form analytical probability expression and requires relatively lower calibration efforts and represents a more realistic route choice behaviour compared with the multinomial logit model. This article proposes two versions of the C-logit SUE model that captures the route similarity using different attributes in the commonality factors. The two versions differ with respect to the independence assumption between cost and flow. The corresponding stochastic traffic equilibrium models are called the length-based and congestion-based C-logit SUE models, respectively. To formulate the length-based C-logit SUE model, an equivalent mathematical programming formulation is proposed. For the congestion-based C-logit SUE model, we provide two equivalent variational inequality formulations. To solve the proposed formulations, a new self-adaptive gradient projection algorithm is developed. The proposed formulations and new solution algorithm are tested in two well-known networks. Numerical results demonstrate the validity of the formulations and solution algorithm.
C-logit随机用户均衡模型:公式和求解算法
本文用基于C-logit函数的路径选择模型研究随机用户均衡问题。与多项logit模型相比,C-logit模型具有简单的闭式解析概率表达式,需要相对较少的校准工作,并且代表了更现实的路线选择行为。本文提出了两个版本的C-logit SUE模型,该模型使用公共因素中的不同属性来捕获路由相似度。这两个版本的不同之处在于成本和流量之间的独立性假设。相应的随机交通均衡模型分别称为基于长度的和基于拥塞的C-logit SUE模型。为了建立基于长度的C-logit SUE模型,提出了等效的数学规划公式。对于基于拥塞的C-logit SUE模型,我们提供了两个等价的变分不等式表达式。为了求解上述公式,提出了一种新的自适应梯度投影算法。在两个知名网络中对所提出的公式和新的求解算法进行了验证。数值结果验证了公式和求解算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Transportmetrica
Transportmetrica 工程技术-运输科技
自引率
0.00%
发文量
0
审稿时长
>12 weeks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信