In accordance with regulations and requirements, the editorial department's website domain has been changed to arocmag.cn. The original domain (arocmag.com) will be discontinued after Dec. 31st, 2024.
Algorithm Research & Explore
|
2342-2348

Efficient index for route planning in public transportation network

Ma Hui1
Tang Yong2
Liang Ruishi1
1. School of Computer, Zhongshan Institute, University of Electronic Science & Technology of China, Zhongshan Guangdong 528400, China
2. School of Computer, South Normal University, Guangzhou 510631, China

Abstract

TTL is a highly efficient indexing structure for finding an earliest arrival path, or a latest departure path, or a shortest duration path in public transportation networks. TTL uses Time-dependent algorithm as its core algorithm to build index, and is therefore, results in two deficiencies. Firstly, it needed relatively expensive priority queue operations. Secondly, it would generate paths with more transfers. This paper proposed a new indexing structure, TAIL, which used a trip-based method to build index. TTL pre-computed some canonical paths. A query could be answered by matching up the canonical paths, which avoided traversing the entire network. Instead of the graph structure, TAIL used trip array as its input, and generated paths by scanning trips. Initially, TAIL scanned trips starting from the source stop, from which TAIL obtained direct reachable stops. After that, TAIL scanned trips starting from the direct reachable stops, from which TAIL obtained reachable stops within one transfer. Generally, TAIL discovered new reachable stops from scanning the trips starting at the already discovered reachable stops. In order to obtain the earliest arrival paths in the early stage, so as to reduce the number of trip scanning, TAIL did not scan the stops strictly in increasing order of their transfer times. In this way, TAIL avoids valuable priority queue operations, while preserves the entity of a trip. Experiments on real datasets shows that, compared to TTL, TAIL has lower index construction time and its generated path has fewer transfer times.

Foundation Support

国家自然科学基金资助项目(61772211)
广东省高等学校优秀青年教师项目(YQ2015241,YQ2015242)
广东省青年创新人才类项目(2015KQNCX206)
中山市科技计划项目(2015B2307,2016B2158)

Publish Information

DOI: 10.19734/j.issn.1001-3695.2018.02.0088
Publish at: Application Research of Computers Printed Article, Vol. 36, 2019 No. 8
Section: Algorithm Research & Explore
Pages: 2342-2348
Serial Number: 1001-3695(2019)08-021-2342-07

Publish History

[2019-08-05] Printed Article

Cite This Article

马慧, 汤庸, 梁瑞仕. 公交网络路径规划问题中的一种高效索引方法 [J]. 计算机应用研究, 2019, 36 (8): 2342-2348. (Ma Hui, Tang Yong, Liang Ruishi. Efficient index for route planning in public transportation network [J]. Application Research of Computers, 2019, 36 (8): 2342-2348. )

About the Journal

  • Application Research of Computers Monthly Journal
  • Journal ID ISSN 1001-3695
    CN  51-1196/TP

Application Research of Computers, founded in 1984, is an academic journal of computing technology sponsored by Sichuan Institute of Computer Sciences under the Science and Technology Department of Sichuan Province.

Aiming at the urgently needed cutting-edge technology in this discipline, Application Research of Computers reflects the mainstream technology, hot technology and the latest development trend of computer application research at home and abroad in a timely manner. The main contents of the journal include high-level academic papers in this discipline, the latest scientific research results and major application results. The contents of the columns involve new theories of computer discipline, basic computer theory, algorithm theory research, algorithm design and analysis, blockchain technology, system software and software engineering technology, pattern recognition and artificial intelligence, architecture, advanced computing, parallel processing, database technology, computer network and communication technology, information security technology, computer image graphics and its latest hot application technology.

Application Research of Computers has many high-level readers and authors, and its readers are mainly senior and middle-level researchers and engineers engaged in the field of computer science, as well as teachers and students majoring in computer science and related majors in colleges and universities. Over the years, the total citation frequency and Web download rate of Application Research of Computers have been ranked among the top of similar academic journals in this discipline, and the academic papers published are highly popular among the readers for their novelty, academics, foresight, orientation and practicality.


Indexed & Evaluation

  • The Second National Periodical Award 100 Key Journals
  • Double Effect Journal of China Journal Formation
  • the Core Journal of China (Peking University 2023 Edition)
  • the Core Journal for Science
  • Chinese Science Citation Database (CSCD) Source Journals
  • RCCSE Chinese Core Academic Journals
  • Journal of China Computer Federation
  • 2020-2022 The World Journal Clout Index (WJCI) Report of Scientific and Technological Periodicals
  • Full-text Source Journal of China Science and Technology Periodicals Database
  • Source Journal of China Academic Journals Comprehensive Evaluation Database
  • Source Journals of China Academic Journals (CD-ROM Version), China Journal Network
  • 2017-2019 China Outstanding Academic Journals with International Influence (Natural Science and Engineering Technology)
  • Source Journal of Top Academic Papers (F5000) Program of China's Excellent Science and Technology Journals
  • Source Journal of China Engineering Technology Electronic Information Network and Electronic Technology Literature Database
  • Source Journal of British Science Digest (INSPEC)
  • Japan Science and Technology Agency (JST) Source Journal
  • Russian Journal of Abstracts (AJ, VINITI) Source Journals
  • Full-text Journal of EBSCO, USA
  • Cambridge Scientific Abstracts (Natural Sciences) (CSA(NS)) core journals
  • Poland Copernicus Index (IC)
  • Ulrichsweb (USA)