path:寻找多种出行方式的综合系统

Prachya Boonsri, Thanakon Kaewkanha, Jaturon Namwiset, S. Puntheeranurak
{"title":"path:寻找多种出行方式的综合系统","authors":"Prachya Boonsri, Thanakon Kaewkanha, Jaturon Namwiset, S. Puntheeranurak","doi":"10.1109/ICT-ISPC.2016.7519250","DOIUrl":null,"url":null,"abstract":"Public Transportation is a crucial factor for a journey not only the traveler but also people who live in Bangkok. From the variety of routes and many types of transport services that make a trip to Bangkok from one place to another would probably be shown by different ways. Pathly is our proposed algorithm which aims to develop the mobile applications that can suggest the diverse methods for a journey by the public transportation in Bangkok. It can make the appropriate choices considering from each condition and achieve user satisfaction. In our proposed, we implement the K-shortest path algorithm which is Yen's algorithm for finding the diversity of routes. We design and collect all data from the graph database. We kept all data as a graph structure which represents the station as vertex and represents the path between 2 adjacent stations as an edge. Moreover, we make our consideration of 2 significant factors of a journey as time, fare over the trip. Pathly will help users to find the multiple methods to go to anywhere in Bangkok with an appropriate choice.","PeriodicalId":359355,"journal":{"name":"2016 Fifth ICT International Student Project Conference (ICT-ISPC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2016-05-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Pathly: The integrated system for finding diverse journey methods\",\"authors\":\"Prachya Boonsri, Thanakon Kaewkanha, Jaturon Namwiset, S. Puntheeranurak\",\"doi\":\"10.1109/ICT-ISPC.2016.7519250\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Public Transportation is a crucial factor for a journey not only the traveler but also people who live in Bangkok. From the variety of routes and many types of transport services that make a trip to Bangkok from one place to another would probably be shown by different ways. Pathly is our proposed algorithm which aims to develop the mobile applications that can suggest the diverse methods for a journey by the public transportation in Bangkok. It can make the appropriate choices considering from each condition and achieve user satisfaction. In our proposed, we implement the K-shortest path algorithm which is Yen's algorithm for finding the diversity of routes. We design and collect all data from the graph database. We kept all data as a graph structure which represents the station as vertex and represents the path between 2 adjacent stations as an edge. Moreover, we make our consideration of 2 significant factors of a journey as time, fare over the trip. Pathly will help users to find the multiple methods to go to anywhere in Bangkok with an appropriate choice.\",\"PeriodicalId\":359355,\"journal\":{\"name\":\"2016 Fifth ICT International Student Project Conference (ICT-ISPC)\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2016-05-27\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2016 Fifth ICT International Student Project Conference (ICT-ISPC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICT-ISPC.2016.7519250\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2016 Fifth ICT International Student Project Conference (ICT-ISPC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICT-ISPC.2016.7519250","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

公共交通是旅行的一个关键因素,不仅是旅行者,而且是居住在曼谷的人。从曼谷从一个地方到另一个地方旅行的各种路线和许多类型的运输服务可能会以不同的方式显示。path是我们提出的算法,旨在开发移动应用程序,为曼谷的公共交通旅行提供不同的方法建议。它可以从各种情况出发,做出适当的选择,达到用户满意。在我们的提议中,我们实现了k最短路径算法,这是Yen的算法,用于寻找路由的多样性。我们从图形数据库中设计和收集所有数据。我们将所有数据保存为一个图结构,将站点表示为顶点,将两个相邻站点之间的路径表示为边。此外,我们还考虑了旅行的两个重要因素:时间、票价。path将帮助用户找到多种方式去曼谷的任何地方,并进行适当的选择。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Pathly: The integrated system for finding diverse journey methods
Public Transportation is a crucial factor for a journey not only the traveler but also people who live in Bangkok. From the variety of routes and many types of transport services that make a trip to Bangkok from one place to another would probably be shown by different ways. Pathly is our proposed algorithm which aims to develop the mobile applications that can suggest the diverse methods for a journey by the public transportation in Bangkok. It can make the appropriate choices considering from each condition and achieve user satisfaction. In our proposed, we implement the K-shortest path algorithm which is Yen's algorithm for finding the diversity of routes. We design and collect all data from the graph database. We kept all data as a graph structure which represents the station as vertex and represents the path between 2 adjacent stations as an edge. Moreover, we make our consideration of 2 significant factors of a journey as time, fare over the trip. Pathly will help users to find the multiple methods to go to anywhere in Bangkok with an appropriate choice.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信