Graph representation of the fixed route dial-a-ride problem: Journal of Scheduling

T. Grinshpoun, E. Shufan, H. Ilani, V. Levit, H. Brama

Research output: Contribution to journalArticlepeer-review

Abstract

The fixed route dial-a-ride problem (FRDARP) is a variant of the famous dial-a-ride problem, in which all the requests are chosen between terminals that are located along a fixed route. A reduction to the shortest path problem enables finding an optimal solution for FRDARP in polynomial time. However, the basic graph construction ends up with a huge graph, which makes the reduction impractical due to its memory consumption. To this end, we propose several pruning heuristics that enable us to considerably reduce the size of the graph through its dynamic construction. Additionally, we utilize the special features of the problem to apply parallelization to the graph traversal process. Our experiments show that each of the proposed heuristics on its own improves the practical solvability of FRDARP. Moreover, using them together is considerably more efficient than any single heuristic. Finally, the experiments confirm the efficiency of our suggested parallelization policy. © 2022, The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature.
Original languageEnglish
Pages (from-to)479-495
Number of pages17
JournalJournal of Scheduling
Volume26
Issue number5
DOIs
StatePublished - 25 Oct 2022

Keywords

  • Graph theory
  • % reductions
  • DARP
  • Dial-a-ride problem
  • Fixed route
  • Graph representation
  • Parallelizations
  • Pruning heuristic
  • Shortest path problem
  • Timetabling
  • Timetabling in transport
  • Polynomial approximation
  • Parallelization
  • Pruning heuristics

Fingerprint

Dive into the research topics of 'Graph representation of the fixed route dial-a-ride problem: Journal of Scheduling'. Together they form a unique fingerprint.

Cite this