Implementation of connection scan algorithm in tourism intermodal transportation journey planner: a case study

V. Darmawan, Yuh-Wen Chen
{"title":"Implementation of connection scan algorithm in tourism intermodal transportation journey planner: a case study","authors":"V. Darmawan, Yuh-Wen Chen","doi":"10.30656/jsmi.v4i2.2772","DOIUrl":null,"url":null,"abstract":"Accessibility to tourist destinations is an important component in a tourism system, especially for natural tourist destinations located in suburban areas. Good linkage of travel information and physical connections with local transportation services for intercity travel can facilitate more people to travel and promote national tourism destinations. This research takes the popular national tourism destinations and their public transportation service in Taiwan as a research object due to the unavailability of integrated public transport information service. Free Independent Travelers (FIT) demand is growing. This research aims to integrate intermodal public transportation information to support FIT by proposing a seamless way journey planner. In this scenario, the journey planner requires timetable data as input. The Connection Scan Algorithm is used to find the earliest arrival time routes at their destinations. This journey planner is built in PHP language and can complement the official tourism travel information website by Tourism Bureau, MOTC. Hence, the FIT could get the quickest routes to reach the destinations without compiling the public transportation information provided independently.","PeriodicalId":53057,"journal":{"name":"Jurnal Sistem dan Manajemen Industri","volume":" ","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2020-12-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Jurnal Sistem dan Manajemen Industri","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.30656/jsmi.v4i2.2772","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Accessibility to tourist destinations is an important component in a tourism system, especially for natural tourist destinations located in suburban areas. Good linkage of travel information and physical connections with local transportation services for intercity travel can facilitate more people to travel and promote national tourism destinations. This research takes the popular national tourism destinations and their public transportation service in Taiwan as a research object due to the unavailability of integrated public transport information service. Free Independent Travelers (FIT) demand is growing. This research aims to integrate intermodal public transportation information to support FIT by proposing a seamless way journey planner. In this scenario, the journey planner requires timetable data as input. The Connection Scan Algorithm is used to find the earliest arrival time routes at their destinations. This journey planner is built in PHP language and can complement the official tourism travel information website by Tourism Bureau, MOTC. Hence, the FIT could get the quickest routes to reach the destinations without compiling the public transportation information provided independently.
连接扫描算法在旅游多式联运行程规划中的应用研究
旅游目的地的可达性是旅游系统的一个重要组成部分,尤其是对于位于郊区的自然旅游目的地。城际旅行的旅行信息和与当地交通服务的物理连接良好,可以方便更多人旅行,并推广国家旅游目的地。本研究以台湾热门国家旅游目的地及其公共交通服务为研究对象,针对公共交通综合信息服务的不可用性进行研究。免费独立旅行者(FIT)的需求正在增长。本研究旨在整合多式联运公共交通信息,通过提出无缝路线行程规划器来支持FIT。在这种情况下,行程计划器需要时间表数据作为输入。连接扫描算法用于查找到达目的地的最早到达时间路线。该行程规划器是用PHP语言构建的,可以补充交通部旅游局的官方旅游信息网站。因此,FIT可以在不汇编独立提供的公共交通信息的情况下获得到达目的地的最快路线。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
10
审稿时长
12 weeks
×
引用
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学术官方微信