Graph representation of the fixed route dial-a-ride problem

Tal Grinshpoun (), Elad Shufan (), Hagai Ilani (), Vadim Levit () and Haya Brama ()
Additional contact information
Tal Grinshpoun: Ariel University
Elad Shufan: SCE – Shamoon College of Engineering
Hagai Ilani: SCE – Shamoon College of Engineering
Vadim Levit: Ben-Gurion University of the Negev
Haya Brama: Ariel University

Journal of Scheduling, 2023, vol. 26, issue 5, No 6, 479-495

Abstract: 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.

Keywords: Timetabling in transport; DARP; Fixed route; Graph representation; Pruning heuristics; Parallelization (search for similar items in EconPapers)
Date: 2023
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s10951-022-00757-3 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:jsched:v:26:y:2023:i:5:d:10.1007_s10951-022-00757-3

Ordering information: This journal article can be ordered from
http://www.springer.com/journal/10951

DOI: 10.1007/s10951-022-00757-3

Access Statistics for this article

Journal of Scheduling is currently edited by Edmund Burke and Michael Pinedo

More articles in Journal of Scheduling from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().