Development of Optimal Tour Time Model for Tourist Destinations in A City: Application in Pokhara City Network

Q1 Engineering
Purushottam Baral, J. Shrestha
{"title":"Development of Optimal Tour Time Model for Tourist Destinations in A City: Application in Pokhara City Network","authors":"Purushottam Baral, J. Shrestha","doi":"10.3126/tj.v1i1.27585","DOIUrl":null,"url":null,"abstract":"When a tourist visits a city, they tend to visit as many touristic places in the city as possible within their time limit. So, for optimization of their limited time budget and allowing them to spend their maximum time in the destination, this paper proposes a model to find an optimal route for the destination points a tourist is interested into. The computer model developed in this paper makes a sub-tour within the original network and search for an optimal tour route hence giving total travel time and total time required to visit desired destinations, and returning back to the place where you started from. The model enables fast decision support for tourists. The model developed is then applied in network of Pokhara and optimal route is found for a sample set of destinations.","PeriodicalId":55592,"journal":{"name":"Bell Labs Technical Journal","volume":"17 1","pages":""},"PeriodicalIF":0.0000,"publicationDate":"2019-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Bell Labs Technical Journal","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3126/tj.v1i1.27585","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q1","JCRName":"Engineering","Score":null,"Total":0}
引用次数: 1

Abstract

When a tourist visits a city, they tend to visit as many touristic places in the city as possible within their time limit. So, for optimization of their limited time budget and allowing them to spend their maximum time in the destination, this paper proposes a model to find an optimal route for the destination points a tourist is interested into. The computer model developed in this paper makes a sub-tour within the original network and search for an optimal tour route hence giving total travel time and total time required to visit desired destinations, and returning back to the place where you started from. The model enables fast decision support for tourists. The model developed is then applied in network of Pokhara and optimal route is found for a sample set of destinations.
A市旅游目的地最优旅游时间模型的建立&在博卡拉城市网络中的应用
当游客参观一个城市时,他们倾向于在他们的时间限制内尽可能多地参观这个城市的旅游景点。因此,为了优化他们有限的时间预算,使他们在目的地花费最多的时间,本文提出了一个模型来寻找游客感兴趣的目的地的最优路线。本文开发的计算机模型在原网络内进行一次子旅行,并搜索最优的旅行路线,从而给出总旅行时间和到达目标目的地所需的总时间,并返回出发地。该模型可为游客提供快速决策支持。将所建立的模型应用于博卡拉网络,并找到了一组样本目的地的最优路线。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Bell Labs Technical Journal
Bell Labs Technical Journal 工程技术-电信学
自引率
0.00%
发文量
0
审稿时长
6-12 weeks
期刊介绍: The Bell Labs Technical Journal (BLTJ) highlights key research and development activities across Alcatel-Lucent — within Bell Labs, within the company’s CTO organizations, and in cross-functional projects and initiatives. It publishes papers and letters by Alcatel-Lucent researchers, scientists, and engineers and co-authors affiliated with universities, government and corporate research labs, and customer companies. Its aim is to promote progress in communications fields worldwide; Bell Labs innovations enable Alcatel-Lucent to deliver leading products, solutions, and services that meet customers’ mission critical needs.
×
引用
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学术官方微信