{"title":"Shortest paths and probabilities on time-dependent graphs — Applications to transport networks","authors":"Sébastien Félix, J. Galtier","doi":"10.1109/ITST.2011.6060121","DOIUrl":null,"url":null,"abstract":"In this paper, we focus on time-dependent graphs which seem to be a good way to model transport networks. In the first part, we remind some notations and techniques related to time-dependent graphs. In the second one, we introduce new algorithms to take into account the notion of probability related to paths in order to guarantee travelling times with a certain accuracy. We also discuss different probabilistic models and show the links between them.","PeriodicalId":220290,"journal":{"name":"2011 11th International Conference on ITS Telecommunications","volume":"23 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 11th International Conference on ITS Telecommunications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITST.2011.6060121","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2
Abstract
In this paper, we focus on time-dependent graphs which seem to be a good way to model transport networks. In the first part, we remind some notations and techniques related to time-dependent graphs. In the second one, we introduce new algorithms to take into account the notion of probability related to paths in order to guarantee travelling times with a certain accuracy. We also discuss different probabilistic models and show the links between them.
京公网安备 11010802042870号
京ICP备2023020795号-1
分享
求助内容：
应助结果提醒方式：
扫码关注我们
