Efficient feasibility testing for dial-a-ride problems
type: Item
instance of: scholarly article
title: Efficient feasibility testing for dial-a-ride problems
zbMATH Open document ID: 1010.90006
DOI: 10.1016/S0167-6377(02)00120-7
author: Brady Hunsaker
author: Martin W. P. Savelsbergh
published in: Operations Research Letters
publication date: 2003-04-02T00:00:00Z
Mathematics Subject Classification ID: 90B20
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 1891050
MaRDI profile type: Publication
cites work: A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
cites work: k-interchange procedures for local search in a precedence-constrained routing problem
cites work: Scheduling Large-Scale Advance-Request Dial-A-Ride Systems
cites work: Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling
cites work: Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing
full work available at URL: s0167-6377(02)00120-7
OpenAlex ID: W2040251648
Recommended article: A note on ``Efficient feasibility testing for dial-a-ride problems''
Recommended article: Feasibility Testing for Dial-a-Ride Problems
Recommended article: An effective and fast heuristic for the dial-a-ride problem
Recommended article: Modeling and optimizing dynamic dial-a-ride problems
Recommended article: The dial-a-ride problem: Models and algorithms
Recommended article: Typology and literature review for dial-a-ride problems
Recommended article: The dial-a-ride problem (DARP): variants, modeling issues and algorithms
Recommended article: Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints
Recommended article: A Matheuristic for the Dial-a-Ride Problem
Recommended article: Complexity, algorithmic, and computational aspects of a dial-a-ride type problem
description: scientific article; zbMATH DE number 1891050