The dial-a-ride problem: Models and algorithms
type: Item
instance of: scholarly article
title: The dial-a-ride problem: Models and algorithms
zbMATH Open document ID: 1157.90353
author: Jean-François Cordeau
author: G. Laporte
published in: Annals of Operations Research
publication date: 2008-03-31T00:00:00Z
Mathematics Subject Classification ID: 90B20
Mathematics Subject Classification ID: 90B50
Mathematics Subject Classification ID: 90C90
zbMATH DE Number: 5255848
zbMATH Keywords: dial-a-ride problem
zbMATH Keywords: survey
zbMATH Keywords: static and dynamic pickup and delivery problems
MaRDI profile type: Publication
full work available at URL: s10479-007-0170-8
OpenAlex ID: W1980402561
cites work: Q4699387
cites work: Ambulance location and relocation models.
cites work: Modeling and optimizing dynamic dial-a-ride problems
cites work: A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
cites work: The dial-a-ride problem (DARP): variants, modeling issues and algorithms
cites work: A unified tabu search heuristic for vehicle routing problems with time windows
cites work: A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem
cites work: A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
cites work: Technical Note—Optimizing the Schedule for a Fixed Vehicle Path with Convex Inconvenience Costs
cites work: A Tabu Search Heuristic for the Vehicle Routing Problem
cites work: A dynamic model and parallel tabu search heuristic for real-time ambulance relocation
cites work: Efficient feasibility testing for dial-a-ride problems
cites work: A Request Clustering Algorithm for Door-to-Door Handicapped Transportation
cites work: Solving the Dial-a-Ride problem using genetic algorithms
cites work: A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
cites work: A dial-a-ride problem for client transportation in a health-care organization
cites work: Q4495163
cites work: Q4039765
cites work: Dynamic vehicle routing: Status and prospects
cites work: Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
cites work: The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
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
cites work: Q4350083
cites work: Heuristic Algorithms for the Handicapped Persons Transportation Problem
cites work: An effective and fast heuristic for the dial-a-ride problem
cites work: Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints
cites work: A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints
DOI: 10.1007/S10479-007-0170-8
Recommended article: The dial-a-ride problem (DARP): variants, modeling issues and algorithms
Recommended article: Modeling and optimizing dynamic dial-a-ride problems
Recommended article: Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
Recommended article: Complexity, algorithmic, and computational aspects of a dial-a-ride type problem
Recommended article: A Matheuristic for the Dial-a-Ride Problem
Recommended article: The time‐consistent dial‐a‐ride problem
Recommended article: Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints
Recommended article: A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
Recommended article: Typology and literature review for dial-a-ride problems
Recommended article: An effective and fast heuristic for the dial-a-ride problem
description: scientific article