- 期刊
- OpenAccess
A New Path Search Algorithm for Providing Paths among Multiple Origins and One Single Destination
並列摘要
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 map sonly offer the path search services originated from one place which cannot fulfill the increasing needs of people. In this paper, we first described 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 the shortest path search algorithms, in this paper, weal so introduced our newly proposed path search algorithm, namely, Multi‐origins Common Destination algorithm. The initial evaluation results showed that it out performs the counterparts.
延伸閱讀
- Kavitha, J., & Palaniammal, S. (2014). Efficient Path Selection and Data Transmission Using Queue in Open Shortest Path First. International Journal of Computer Science and Application, 3(4), 139-144. https://doi.org/10.14355/ijcsa.2014.0304.01
- 呂其錞 (2014). Finding Shortest Paths Considering the Requirements of Users [master's thesis, National Tsing Hua University]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0016-2912201413551016
- 陳品均（2013）。The Research and Application of D++ Algorithm for Dynamic Path-Planning〔博士論文，國立交通大學〕。華藝線上圖書館。https://doi.org/10.6842/NCTU.2013.00412
- Tam, W. Y. (2006). Quality of service routing with path information aggregation [master's thesis, The University of Hong Kong]. Airiti Library. https://www.airitilibrary.com/Article/Detail?DocID=U0029-1812201200013606
- 莊國賢（2010）。A hyper-heuristic algorithm for optimizing customized learning paths〔碩士論文，國立暨南國際大學〕。華藝線上圖書館。https://doi.org/10.6837/NCNU.2010.00107