Abstract
Hunsaker and Savelsbergh [Operations Research Letters 30, 2002] discussed feasibility testing for a dial-a-ride problem under maximum wait time and maximum ride time constraints. We show that this feasibility test can be expressed as a shortest path problem in vertex-weighted interval graphs, which leads to a simple linear time algorithm.
| Original language | English |
|---|---|
| Place of Publication | Eindhoven |
| Publisher | Technische Universiteit Eindhoven |
| Number of pages | 8 |
| Publication status | Published - 2010 |
Publication series
| Name | BETA publicatie : working papers |
|---|---|
| Volume | 338 |
| ISSN (Print) | 1386-9213 |