Efficient feasibility testing for dial-a-ride problems

Authors:
Brady Hunsaker;Martin Savelsbergh
Affiliations:
Department of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332-0205, USA;Department of Industrial and Systems Engineering, Georgia Institute of Technology, Atlanta, GA 30332-0205, USA
Venue:
Operations Research Letters
Year:
2002

Citing 0
Cited 8

The Trip Scheduling Problem

Transportation Science
Feasibility testing for dial-a-ride problems

AAIM'10 Proceedings of the 6th international conference on Algorithmic aspects in information and management
Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports

Computers and Operations Research
A Q-based framework for demand bus simulation

CIS'04 Proceedings of the First international conference on Computational and Information Science
Multiagent-Based demand bus simulation for shanghai

MMAS'04 Proceedings of the First international conference on Massively Multi-Agent Systems
A note on "Efficient feasibility testing for dial-a-ride problems"

Operations Research Letters
Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh

Operations Research Letters
Determining the Viability of a Demand-Responsive Transport System under Varying Demand Scenarios

Proceedings of the Sixth ACM SIGSPATIAL International Workshop on Computational Transportation Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

Dial-a-ride systems involve dispatching a vehicle to satisfy demands from a set of customers who call a vehicle-operating agency requesting that an item be picked up from a specific location and delivered to a specific destination. Dial-a-ride problems differ from other routing and scheduling problems, in that they typically involve service-related constraints. It is common to have maximum wait time constraints and maximum ride time constraints. In the presence of maximum wait time and maximum ride time restrictions, it is not clear how to efficiently determine, given a sequence of pickups and deliveries, whether a feasible schedule exists. We demonstrate that this, in fact, can be done in linear time.