A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
type: Item
instance of: scholarly article
title: A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
zbMATH Open document ID: 0632.90087
DOI: 10.1080/01966324.1986.10737198
author: Jacques Desrosiers
author: Yvan Dumas
author: François Soumis
published in: American Journal of Mathematical and Management Sciences
publication date: 1986-01-01T00:00:00Z
Mathematics Subject Classification ID: 90C39
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 4029300
zbMATH Keywords: routing
zbMATH Keywords: scheduling
zbMATH Keywords: single-vehicle dial-a-ride problem
zbMATH Keywords: time window constraints
zbMATH Keywords: precedence and capacity constraints
zbMATH Keywords: forward dynamic programming
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1080/01966324.1986.10737198
OpenAlex ID: W2037992565
cites work: The Traveling Salesman Problem: A Survey
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
description: scientific article