Typology and literature review for dial-a-ride problems
type: Item
instance of: scholarly article
title: Typology and literature review for dial-a-ride problems
zbMATH Open document ID: 1380.90055
author: Yves Molenbruch
author: Kris Braekers
author: An Caris
published in: Annals of Operations Research
publication date: 2018-02-15T00:00:00Z
full work available at URL: http://hdl.handle.net/1942/24042
Mathematics Subject Classification ID: 90B06
Mathematics Subject Classification ID: 90B35
zbMATH DE Number: 6839491
zbMATH Keywords: dial-a-ride
zbMATH Keywords: demand-responsive transportation
zbMATH Keywords: patient transportation
zbMATH Keywords: rich vehicle routing
zbMATH Keywords: real-life characteristics
zbMATH Keywords: literature review
describes a project that uses: VRP
MaRDI profile type: Publication
OpenAlex ID: W2616463222
cites work: A survey on matheuristics for routing problems
cites work: Q2728857
cites work: Dynamic transportation of patients in hospitals
cites work: Dynamic pickup and delivery problems
cites work: A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem
cites work: Q4699387
cites work: A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
cites work: The dial-a-ride problem: Models and algorithms
cites work: The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method
cites work: A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem
cites work: A two-stage model for a day-ahead paratransit planning problem
cites work: A heuristic two-phase solution approach for the multi-objective 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: On-line single-server dial-a-ride problems
cites work: Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh
cites work: Vehicle routing problems with alternative paths: an application to on-demand transportation
cites work: Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation
cites work: A comparison of column-generation approaches to the synchronized pickup and delivery problem
cites work: A HYBRID GREEDY RANDOMIZED ADAPTIVE SEARCH HEURISTIC TO SOLVE THE DIAL-A-RIDE PROBLEM
cites work: An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows
cites work: Routing by ranking: a link analysis method for the constrained dial-a-ride problem
cites work: Feasibility Testing for Dial-a-Ride Problems
cites work: A new extension of local search applied to the Dial-A-Ride problem
cites work: An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays
cites work: Q2759919
cites work: Local search heuristics for the probabilistic dial-a-ride problem
cites work: Efficient feasibility testing for dial-a-ride problems
cites work: Non-myopic vehicle and route selection in dynamic DARP with travel time and workload objectives
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: Approximation and Online Algorithms
cites work: An adaptive large neighborhood search heuristic for the share-a-ride problem
cites work: An Effective Heuristic Algorithm for the Traveling-Salesman Problem
cites work: On-line dial-a-ride problems under a restricted information model
cites work: A hybrid genetic algorithm for the heterogeneous dial-a-ride problem
cites work: The dial-A-ride problem with transfers
cites work: A dial-a-ride problem for client transportation in a health-care organization
cites work: Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation
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: Dynamic programming based metaheuristics for the dial-a-ride problem
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: Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
cites work: Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem
cites work: Record breaking optimization results using the ruin and recreate principle
cites work: A note on ``Efficient feasibility testing for dial-a-ride problems''
cites work: Heuristic Algorithms for the Handicapped Persons Transportation Problem
cites work: A Matheuristic 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
cites work: The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments
cites work: Algorithmic Applications in Management
cites work: Online Dial-A-Ride Problem with Time-Windows Under a Restricted Information Model
DOI: 10.1007/S10479-017-2525-0
description: scientific article; zbMATH DE number 6839491