基于地理信息系统的最优公交寻路算法

ShuGuang Li, YanMing Su
{"title":"基于地理信息系统的最优公交寻路算法","authors":"ShuGuang Li, YanMing Su","doi":"10.1109/ITSC.2003.1252767","DOIUrl":null,"url":null,"abstract":"The paper proposes a new description of the transit network within the framework of GIS. The shortest path judgment criterion of passenger route choice is presented. A path finding algorithm for transit network is proposed to handle the special characteristics of transit networks, and passenger travel psychology. The algorithm takes into account the overall level of services and the passenger route choice criterion to determine the shortest path and transfer points between the random two bus stops.","PeriodicalId":123155,"journal":{"name":"Proceedings of the 2003 IEEE International Conference on Intelligent Transportation Systems","volume":"98 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-12-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Optimal transit path finding algorithm based on geographic information system\",\"authors\":\"ShuGuang Li, YanMing Su\",\"doi\":\"10.1109/ITSC.2003.1252767\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The paper proposes a new description of the transit network within the framework of GIS. The shortest path judgment criterion of passenger route choice is presented. A path finding algorithm for transit network is proposed to handle the special characteristics of transit networks, and passenger travel psychology. The algorithm takes into account the overall level of services and the passenger route choice criterion to determine the shortest path and transfer points between the random two bus stops.\",\"PeriodicalId\":123155,\"journal\":{\"name\":\"Proceedings of the 2003 IEEE International Conference on Intelligent Transportation Systems\",\"volume\":\"98 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-12-19\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 2003 IEEE International Conference on Intelligent Transportation Systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ITSC.2003.1252767\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 2003 IEEE International Conference on Intelligent Transportation Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ITSC.2003.1252767","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

本文提出了一种新的GIS框架下的交通网络描述方法。提出了客运路线选择的最短路径判断准则。针对公交网络的特点和乘客的出行心理,提出了一种公交网络寻径算法。该算法综合考虑整体服务水平和乘客路线选择准则,确定随机两个公交站点之间的最短路径和换乘点。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Optimal transit path finding algorithm based on geographic information system
The paper proposes a new description of the transit network within the framework of GIS. The shortest path judgment criterion of passenger route choice is presented. A path finding algorithm for transit network is proposed to handle the special characteristics of transit networks, and passenger travel psychology. The algorithm takes into account the overall level of services and the passenger route choice criterion to determine the shortest path and transfer points between the random two bus stops.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信