Speeding up the Passenger Assignment Problem in transit planning by the Direct Link Network representation

计算机科学 水准点(测量) 代表(政治) 网络规划与设计 最短路径问题 数学优化 公共交通 元启发式 过境(卫星) 计算 运筹学 理论计算机科学 计算机网络 算法 图形 数学 运输工程 工程类 政治 政治学 法学 大地测量学 地理
作者
Dilay Aktaş,Evert Vermeir,Pieter Vansteenwegen
出处
期刊:Computers & Operations Research [Elsevier BV]
卷期号:167: 106647-106647
标识
DOI:10.1016/j.cor.2024.106647
摘要

When designing a public transport network with the passenger travel time in mind, the passenger assignment problem (PAP) needs to be addressed explicitly. It is a complex problem on its own and even the simplest version requires determination of the shortest path for all demand pairs in the network. It is typically treated as a subproblem of larger problems by public transport planners, such as the transit network design problem (TNDP). In the TNDP, bi-level optimization models and/or metaheuristics are used where the PAP is solved when evaluating a line plan. In doing so, the PAP is often addressed by representing the transit network with a so-called 'Change-and-Go' (CNG) network with dummy transfer nodes in order to model transfer penalties as part of the passenger travel time. Then, in order to solve the PAP, the all-pairs shortest path problem needs to be solved for this CNG network representation. In this paper, we present a much more efficient network representation, 'Direct Link Network' (DLN), where additional edges are added instead of additional nodes. We compare the theoretical complexity of both representations and the computation time required to solve the PAP by using CNG and DLN on the most commonly used benchmark networks and also several real-life networks. The results show that with the DLN representation, the PAP can be solved multiple times faster than with CNG. Consequently, DLN can significantly speed up all TNDP algorithms that solve the PAP multiple times when designing a public transport network.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
PDF的下载单位、IP信息已删除 (2025-6-4)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
诚心的扬关注了科研通微信公众号
刚刚
2秒前
嗨嗨害完成签到,获得积分10
3秒前
吧啦吧啦完成签到,获得积分10
3秒前
4秒前
5秒前
zero完成签到,获得积分10
6秒前
小二郎应助momo采纳,获得10
7秒前
hh完成签到 ,获得积分10
7秒前
大大完成签到 ,获得积分10
7秒前
7秒前
量子星尘发布了新的文献求助10
9秒前
YI发布了新的文献求助10
9秒前
Stardust完成签到 ,获得积分10
10秒前
zero发布了新的文献求助10
10秒前
共享精神应助果粒多采纳,获得10
11秒前
ali应助史念薇采纳,获得10
13秒前
15秒前
海城好人完成签到,获得积分10
15秒前
16秒前
默默完成签到,获得积分10
16秒前
维尼完成签到,获得积分20
16秒前
18秒前
文档发布了新的文献求助10
19秒前
19秒前
科目三应助Loik采纳,获得10
20秒前
21秒前
21秒前
23秒前
23秒前
果粒多发布了新的文献求助10
24秒前
26秒前
28秒前
李泽雄完成签到,获得积分10
29秒前
gsq发布了新的文献求助30
29秒前
momo发布了新的文献求助10
29秒前
wdy111应助学习鱼采纳,获得20
31秒前
31秒前
G哟X完成签到 ,获得积分10
32秒前
33秒前
高分求助中
A new approach to the extrapolation of accelerated life test data 1000
ACSM’s Guidelines for Exercise Testing and Prescription, 12th edition 500
‘Unruly’ Children: Historical Fieldnotes and Learning Morality in a Taiwan Village (New Departures in Anthropology) 400
Indomethacinのヒトにおける経皮吸収 400
Phylogenetic study of the order Polydesmida (Myriapoda: Diplopoda) 370
基于可调谐半导体激光吸收光谱技术泄漏气体检测系统的研究 350
Robot-supported joining of reinforcement textiles with one-sided sewing heads 320
热门求助领域 (近24小时)
化学 材料科学 医学 生物 工程类 有机化学 生物化学 物理 内科学 纳米技术 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 冶金 细胞生物学 免疫学
热门帖子
关注 科研通微信公众号,转发送积分 3989297
求助须知:如何正确求助?哪些是违规求助? 3531418
关于积分的说明 11253893
捐赠科研通 3270097
什么是DOI,文献DOI怎么找? 1804884
邀请新用户注册赠送积分活动 882087
科研通“疑难数据库(出版商)”最低求助积分说明 809158