A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
type: Item
instance of: scholarly article
title: A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
zbMATH Open document ID: 0839.90033
DOI: 10.1007/BF02031946
author: Oli B. G. Madsen
author: Hans F. Ravn
author: Jens Moberg Rygaard
published in: Annals of Operations Research
publication date: 1996-02-26T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B35
Mathematics Subject Classification ID: 90B90
zbMATH DE Number: 847651
zbMATH Keywords: dynamic routing
zbMATH Keywords: static dial-a-ride routing
zbMATH Keywords: scheduling
zbMATH Keywords: time windows
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
cites work: Pickup and Delivery of Partial Loads with “Soft” Time Windows
cites work: An Asymptotic, Probabilistic Analysis of a Routing Problem
description: scientific article; zbMATH DE number 847651