Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem
type: Item
instance of: scholarly article
title: Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem
zbMATH Open document ID: 1338.90066
author: K. F. Doerner
author: Richard F. Hartl
author: M. Schilde
published in: European Journal of Operational Research
publication date: 2016-06-23T00:00:00Z
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90C15
zbMATH DE Number: 6597464
zbMATH Keywords: dial-a-ride problem
zbMATH Keywords: dynamic stochastic
zbMATH Keywords: time-dependent
zbMATH Keywords: variable neighborhood search
zbMATH Keywords: multiple plan approach
zbMATH Keywords: multiple scenario approach
Wikidata QID: Q40269760
MaRDI profile type: Publication
full work available at URL: j.ejor.2014.03.005
OpenAlex ID: W1981736216
cites work: Optimization for dynamic ride-sharing: a review
cites work: Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
cites work: The dial-a-ride problem: Models and algorithms
cites work: A road timetable\(^{\text{TM}}\) to aid vehicle routing and scheduling
cites work: Search Methodologies
cites work: A new extension of local search applied to the Dial-A-Ride problem
cites work: Efficient feasibility testing for dial-a-ride problems
cites work: Vehicle dispatching with time-dependent travel times
cites work: A network-consistent time-dependent travel time layer for routing optimization problems
cites work: Online vehicle routing and scheduling with dynamic travel times
cites work: Vehicle routing and scheduling with time-varying data: A case study
cites work: Variable neighborhood search
cites work: Ranking paths in stochastic time-dependent networks
cites work: Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
cites work: Variable neighborhood search for the dial-a-ride problem
cites work: Hybrid column generation and large neighborhood search for the dial-a-ride problem
cites work: Vehicle routing and scheduling with dynamic travel times
cites work: The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
cites work: Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
cites work: Ambulance location and relocation problems with time-dependent travel times
cites work: Vehicle routing problem with stochastic travel times including soft time windows and service costs
cites work: The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments
DOI: 10.1016/J.EJOR.2014.03.005
description: scientific article; zbMATH DE number 6597464