Typology and literature review for dial-a-ride problems
From MaRDI portal
Publication:1698288
DOI10.1007/s10479-017-2525-0zbMath1380.90055OpenAlexW2616463222MaRDI QIDQ1698288
An Caris, Kris Braekers, Yves Molenbruch
Publication date: 15 February 2018
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: http://hdl.handle.net/1942/24042
dial-a-rideliterature reviewpatient transportationdemand-responsive transportationreal-life characteristicsrich vehicle routing
Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)
Related Items
New Bounds for Maximizing Revenue in Online Dial-a-Ride, Comparison of anticipatory algorithms for a dial-a-ride problem, Event-based MILP models for ridepooling applications, A hybrid algorithm for the vehicle routing problem with and/or precedence constraints and time windows, Using decomposition-based multi-objective algorithm to solve selective pickup and delivery problems with time windows, Synchronizing transportation of people with reduced mobility through airport terminals, A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem, Scheduling heterogeneous multi-load AGVs with battery constraints, Pickup and delivery problems with autonomous vehicles on rings, A sample average approximation approach for the stochastic dial-a-ride problem on a multigraph with user satisfaction, A branch-and-price algorithm for a routing problem with inbound and outbound requests, The real-time on-demand bus routing problem: the cost of dynamic requests, An integrated ride-matching and vehicle-rebalancing model for shared mobility on-demand services, Trends in passenger transport optimisation, An approximation of the customer waiting time for online restaurants owning delivery system, A column generation algorithm for the demand‐responsive feeder service with mandatory and optional, clustered bus‐stops, Effectiveness of demand and fulfillment control in dynamic fleet management of ride‐sharing systems, The time‐consistent dial‐a‐ride problem, Prepositioning can improve the performance of a dynamic stochastic on-demand public bus system, The static on‐demand bus routing problem: large neighborhood search for a dial‐a‐ride problem with bus station assignment, Using fixed paths to improve branch-and-cut algorithms for precedence-constrained routing problems, Graph representation of the fixed route dial-a-ride problem, Budget-balanced and strategy-proof auctions for ridesharing, A deterministic annealing local search for the electric autonomous dial-a-ride problem, Improved bounds for revenue maximization in time-limited online dial-a-ride, Analyzing the benefits of an integrated mobility system using a matheuristic routing algorithm, Approximate ridesharing of personal vehicles problem, Recovery management for a dial-a-ride system with real-time disruptions, Pickup and delivery problem with incompatibility constraints, Serving rides of equal importance for time-limited dial-a-ride
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem
- A comparison of column-generation approaches to the synchronized pickup and delivery problem
- The dial-A-ride problem with transfers
- Hybrid column generation and large neighborhood search for the dial-a-ride problem
- Non-myopic vehicle and route selection in dynamic DARP with travel time and workload objectives
- An adaptive large neighborhood search heuristic for the share-a-ride problem
- Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
- An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays
- Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
- A note on ``Efficient feasibility testing for dial-a-ride problems
- An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows
- Analysis of the dial-a-ride problem of Hunsaker and Savelsbergh
- Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation
- Local search heuristics for the probabilistic dial-a-ride problem
- A two-stage model for a day-ahead paratransit planning problem
- Dynamic pickup and delivery problems
- The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method
- A new extension of local search applied to the Dial-A-Ride problem
- Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation
- A hybrid genetic algorithm for the heterogeneous dial-a-ride problem
- Efficient feasibility testing for dial-a-ride problems
- On-line dial-a-ride problems under a restricted information model
- Record breaking optimization results using the ruin and recreate principle
- Dynamic transportation of patients in hospitals
- A dial-a-ride problem for client transportation in a health-care organization
- A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem
- Routing by ranking: a link analysis method for the constrained dial-a-ride problem
- The study of a dynamic dial-a-ride problem under time-dependent and stochastic environments
- The dial-a-ride problem: Models and algorithms
- A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints
- A survey on matheuristics for routing problems
- Vehicle routing problems with alternative paths: an application to on-demand transportation
- Variable neighborhood search for the dial-a-ride problem
- A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem
- A heuristic two-phase solution approach for the multi-objective dial-a-ride problem
- A Matheuristic for the Dial-a-Ride Problem
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- Solving the Dial-a-Ride problem using genetic algorithms
- Feasibility Testing for Dial-a-Ride Problems
- A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- Heuristic Algorithms for the Handicapped Persons Transportation Problem
- A Request Clustering Algorithm for Door-to-Door Handicapped Transportation
- A HYBRID GREEDY RANDOMIZED ADAPTIVE SEARCH HEURISTIC TO SOLVE THE DIAL-A-RIDE PROBLEM
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- Online Dial-A-Ride Problem with Time-Windows Under a Restricted Information Model
- Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints
- An Effective Heuristic Algorithm for the Traveling-Salesman Problem
- Algorithmic Applications in Management
- Approximation and Online Algorithms
- On-line single-server dial-a-ride problems
- Dynamic programming based metaheuristics for the dial-a-ride problem
