Preprocessing Parallelization for the ALT-Algorithm

Genaro Peque, Junji Urata, Takamasa Iryo

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper, we improve the preprocessing phase of the ALT algorithm through parallelization. ALT is a preprocessing-based, goal-directed speed-up technique that uses A* (A star), Landmarks and Triangle inequality which allows fast computations of shortest paths (SP) in large-scale networks. Although faster techniques such as arc-flags, SHARC, Contraction Hierarchies and Highway Hierarchies already exist, ALT is usually combined with these faster algorithms to take advantage of its goal-directed search to further reduce the SP search computation time and its search space. However, ALT relies on landmarks and optimally choosing these landmarks is NP-hard, hence, no effective solution exists. Since landmark selection relies on constructive heuristics and the current SP search speed-up is inversely proportional to landmark generation time, we propose a parallelization technique which reduces the landmark generation time significantly while increasing its effectiveness.

Original languageEnglish
Title of host publicationComputational Science – ICCS 2018 - 18th International Conference, Proceedings
EditorsJack Dongarra, Haohuan Fu, Valeria V. Krzhizhanovskaya, Michael Harold Lees, Peter M. Sloot, Yong Shi, Yingjie Tian
PublisherSpringer Verlag
Pages89-101
Number of pages13
ISBN (Print)9783319937120
DOIs
Publication statusPublished - 2018
Externally publishedYes
Event18th International Conference on Computational Science, ICCS 2018 - Wuxi, China
Duration: 2018 Jun 112018 Jun 13

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume10862 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference18th International Conference on Computational Science, ICCS 2018
CountryChina
CityWuxi
Period18/6/1118/6/13

Keywords

  • ALT algorithm
  • Large-scale traffic simulation
  • Shortest path search

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Computer Science(all)

Fingerprint Dive into the research topics of 'Preprocessing Parallelization for the ALT-Algorithm'. Together they form a unique fingerprint.

Cite this