A New Path Search Algorithm for Providing Paths among Multiple Origins and One Single Destination

Q4 Computer Science
Liang Zhao, Wenjia Wang
{"title":"A New Path Search Algorithm for Providing Paths among Multiple Origins and One Single Destination","authors":"Liang Zhao, Wenjia Wang","doi":"10.14355/IJCSA.2014.0301.07","DOIUrl":null,"url":null,"abstract":"Route planning services provide directional functionalities allowing people to make transport plan in which such services are now closely interrelated to people’s daily life. Existing route planners such as digital maps only offer the path search services originated from one place which cannot fulfil the increasing needs of people. In this paper, we first describe a new service for digital map that provides route plans for people from different origins towards the same destination for the purpose of group travelling. Since the performance of route planner highly depends on shortest path search algorithms, in this paper, we also introduce our newly proposed path search algorithm, namely, Multi-origins Common Destination algorithm. The initial evaluation results show it outperforms the counterparts.","PeriodicalId":39465,"journal":{"name":"International Journal of Computer Science and Applications","volume":"20 2 1","pages":"29"},"PeriodicalIF":0.0000,"publicationDate":"2014-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Journal of Computer Science and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.14355/IJCSA.2014.0301.07","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Computer Science","Score":null,"Total":0}
引用次数: 3

Abstract

Route planning services provide directional functionalities allowing people to make transport plan in which such services are now closely interrelated to people’s daily life. Existing route planners such as digital maps only offer the path search services originated from one place which cannot fulfil the increasing needs of people. In this paper, we first describe a new service for digital map that provides route plans for people from different origins towards the same destination for the purpose of group travelling. Since the performance of route planner highly depends on shortest path search algorithms, in this paper, we also introduce our newly proposed path search algorithm, namely, Multi-origins Common Destination algorithm. The initial evaluation results show it outperforms the counterparts.
一种新的多起点单目的地路径搜索算法
路线规划服务提供定向功能,允许人们制定交通计划,这些服务现在与人们的日常生活密切相关。现有的路线规划工具,如数字地图,只提供从一个地方出发的路径搜索服务,不能满足人们日益增长的需求。在本文中,我们首先描述了一种新的数字地图服务,它可以为不同来源的人提供前往同一目的地的路线规划。由于路径规划器的性能高度依赖于最短路径搜索算法,本文还介绍了我们新提出的路径搜索算法,即多起点公共目的地算法。初步评价结果表明,该系统优于同类产品。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
International Journal of Computer Science and Applications
International Journal of Computer Science and Applications Computer Science-Computer Science Applications
自引率
0.00%
发文量
0
期刊介绍: IJCSA is an international forum for scientists and engineers involved in computer science and its applications to publish high quality and refereed papers. Papers reporting original research and innovative applications from all parts of the world are welcome. Papers for publication in the IJCSA are selected through rigorous peer review to ensure originality, timeliness, relevance, and readability.
×
引用
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学术官方微信