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

DOI10.1007/s10951-022-00757-3zbMath1527.90039MaRDI QIDQ6090221

Elad Shufan, Vadim E. Levit, Tal Grinshpoun, Haya Brama, Hagai Ilani

Publication date: 14 November 2023

Published in: Journal of Scheduling (Search for Journal in Brave)

zbMATH Keywords

parallelizationgraph representationDARPpruning heuristicsfixed routetimetabling in transport

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Approximation methods and heuristics in mathematical programming (90C59)

Cites Work

• Unnamed Item
• A reduction approach to the two-campus transport problem
• A note on ``Efficient feasibility testing for dial-a-ride problems
• Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh
• Depth-first search is inherently sequential
• Parallel depth first search. I: Implementation
• Typology and literature review for dial-a-ride problems
• Efficient feasibility testing for dial-a-ride problems
• Efficient feasibility testing for request insertion in the pickup and delivery problem with transfers
• The dial-a-ride problem: Models and algorithms
• An empirical study of phase transitions in binary constraint satisfaction problems
• A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem
• Computer-Aided Complexity Classification of Dial-a-Ride Problems
• Technical Note—Optimizing the Schedule for a Fixed Vehicle Path with Convex Inconvenience Costs
• Timing problems and algorithms: Time decisions for sequences of activities

This page was built for publication: Graph representation of the fixed route dial-a-ride problem