Advanced modeling approach for computing multicriteria shortest paths in multimodal transportation networks

O. Dib, M. Manier, L. Moalic
{"title":"Advanced modeling approach for computing multicriteria shortest paths in multimodal transportation networks","authors":"O. Dib, M. Manier, L. Moalic","doi":"10.1109/ICITE.2016.7581304","DOIUrl":null,"url":null,"abstract":"Nowadays, the human mobility always happens in a multimodal transportation network. However, the transport system has become more complex. Therefore, building Advanced Travelers Information Systems (ATIS) that provide passengers with pre-trip information on navigating through the network has become a certain need. Since passengers do not only seek a short-time travel but they endeavor to optimize several criteria such as comfort and effort, an efficient routing system should incorporate a multiobjective analysis for both routes and transport modes. We aim in this paper at proposing a new formulation for representing a multimodal network. Based on this formulation, we develop a routing algorithm to compute the entire set of nondominated solutions to go from one place to another. As transport modes, we use railway, Bus, Tram, Metro, Pedestrian, Road and Bike. As optimization criteria, we use travel time, number of changes and walking time. Experimental results have been assessed by solving real life itinerary problems defined on the transport network of the city of Paris and its suburbs. Results indicate that the proposed approach is efficient enough to be integrated within a real world journey-planning system.","PeriodicalId":352958,"journal":{"name":"2016 IEEE International Conference on Intelligent Transportation Engineering (ICITE)","volume":"67 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 IEEE International Conference on Intelligent Transportation Engineering (ICITE)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICITE.2016.7581304","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

Abstract

Nowadays, the human mobility always happens in a multimodal transportation network. However, the transport system has become more complex. Therefore, building Advanced Travelers Information Systems (ATIS) that provide passengers with pre-trip information on navigating through the network has become a certain need. Since passengers do not only seek a short-time travel but they endeavor to optimize several criteria such as comfort and effort, an efficient routing system should incorporate a multiobjective analysis for both routes and transport modes. We aim in this paper at proposing a new formulation for representing a multimodal network. Based on this formulation, we develop a routing algorithm to compute the entire set of nondominated solutions to go from one place to another. As transport modes, we use railway, Bus, Tram, Metro, Pedestrian, Road and Bike. As optimization criteria, we use travel time, number of changes and walking time. Experimental results have been assessed by solving real life itinerary problems defined on the transport network of the city of Paris and its suburbs. Results indicate that the proposed approach is efficient enough to be integrated within a real world journey-planning system.
多式联运网络中多准则最短路径计算的先进建模方法
当今社会,人们的流动总是发生在一个多式联运网络中。然而,交通系统变得更加复杂。因此,建立先进的旅客信息系统(ATIS),为旅客提供出行前的网络导航信息已成为一种必然的需求。由于乘客不仅寻求短时间的旅行,而且还努力优化一些标准,如舒适和努力,一个有效的路线系统应该包括对路线和运输方式的多目标分析。我们的目的是在本文中提出一个新的公式来表示一个多模态网络。基于此公式,我们开发了一种路由算法来计算从一个地方到另一个地方的整个非支配解集。作为交通方式,我们使用铁路,公共汽车,有轨电车,地铁,步行,公路和自行车。以出行时间、换乘次数和步行时间作为优化标准。通过解决巴黎及其郊区交通网络中定义的现实生活路线问题,对实验结果进行了评估。结果表明,所提出的方法是有效的,足以集成到一个现实世界的行程规划系统。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术文献互助群
群 号:481959085
Book学术官方微信