The dial-a-ride problem: Models and algorithms
From MaRDI portal
Publication:2480256
DOI10.1007/s10479-007-0170-8zbMath1157.90353OpenAlexW1980402561MaRDI QIDQ2480256
Jean-François Cordeau, Gilbert Laporte
Publication date: 31 March 2008
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10479-007-0170-8
Applications of mathematical programming (90C90) Management decision making, including multiple objectives (90B50) Traffic problems in operations research (90B20)
Related Items
The pickup and delivery problem with time windows and scheduled lines, An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization, A dynamic tree algorithm for peer-to-peer ridesharing matching, Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem, Algorithmic analysis for ridesharing of personal vehicles, The complexity of the unit stop number problem and its implications to other related problems, Rich vehicle routing problems: from a taxonomy to a definition, Comparison of anticipatory algorithms for a dial-a-ride problem, Event-based MILP models for ridepooling applications, A hybrid adaptive large neighborhood heuristic for a real-life dial-a-ride problem, Daily aircraft routing for amphibious ready groups, Simulated annealing heuristic for the general share-a-ride problem, A hybrid algorithm for the vehicle routing problem with and/or precedence constraints and time windows, Complexity and approximation results on the shared transportation problem, The dial-A-ride problem with transfers, 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, Solving a selective dial-a-ride problem with logic-based Benders decomposition, 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, An adaptive large neighborhood search heuristic for the pickup and delivery problem with time windows and scheduled lines, Vehicle routing problems with alternative paths: an application to on-demand transportation, Variable neighborhood search for the dial-a-ride problem, Special issue on vehicle routing and scheduling: recent trends and advances, Quota travelling salesman problem with passengers, incomplete ride and collection time optimization by ant-based algorithms, Synchronizing transportation of people with reduced mobility through airport terminals, The prisoner transportation problem, Mathematical models to improve the current practice in a home healthcare unit, A data-driven matching algorithm for ride pooling problem, Pickup and delivery problems with autonomous vehicles on rings, Trends in transportation and logistics, A stochastic model for a vehicle in a dial-a-ride system, A concise guide to existing and emerging vehicle routing problem variants, Interrelated trips in the rural dial-a-ride problem with autonomous vehicles, An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows, The vehicle sharing and task allocation problem: MILP formulation and a heuristic solution approach, The real-time on-demand bus routing problem: the cost of dynamic requests, Exact Approach for Integrated Delivery Optimization of E-Commerce and Online-to-Offline Parcels, 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, Graph representation of the fixed route dial-a-ride problem, Étude comparative de divers modèles pour le problème de transport à la demande, Complexity, algorithmic, and computational aspects of a dial-a-ride type problem, Reallocation problems with minimum completion time, Algorithmic Analysis for Ridesharing of Personal Vehicles, An unpaired pickup and delivery problem with time dependent assignment costs: application in air cargo transportation, A genetic column generation algorithm for sustainable spare part delivery: application to the Sydney droppoint network, Efficient GRASP solution approach for the prisoner transportation problem, A deterministic annealing local search for the electric autonomous dial-a-ride problem, Typology and literature review for dial-a-ride problems, An ILP-based local search procedure for the VRP with pickups and deliveries, The cumulative school bus routing problem: Polynomial‐size formulations, Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation, Crane scheduling in railway yards: an analysis of computational complexity, Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints, A simulation study of an on‐demand transportation system, Local search heuristics for the probabilistic dial-a-ride problem, A lexicographic approach for the bi-objective selective pickup and delivery problem with time windows and paired demands, Minimizing the maximal ergonomic burden in intra-hospital patient transportation, A reduction approach to the two-campus transport problem, Dynamic courier routing for a food delivery service, An inverse optimization approach for a capacitated vehicle routing problem, Recent Models and Algorithms for One-to-One Pickup and Delivery Problems, A column generation approach for location-routing problems with pickup and delivery, Benchmarking online dispatch algorithms for emergency medical services, Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem, Optimisation of maintenance routing and scheduling for offshore wind farms, Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles, Optimization for dynamic ride-sharing: a review, New mixed integer-programming model for the pickup-and-delivery problem with transshipment, A HYBRID GREEDY RANDOMIZED ADAPTIVE SEARCH HEURISTIC TO SOLVE THE DIAL-A-RIDE PROBLEM, 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, Dynamic transportation of patients in hospitals, The EMS vehicle patient transportation problem during a demand surge, A tabu search heuristic for the dynamic transportation of patients between care units, A comparison of two meta-heuristics for the pickup and delivery problem with transshipment, A heuristic two-phase solution approach for the multi-objective dial-a-ride problem, Taxi-sharing: parameterized complexity and approximability of the dial-a-ride problem with money as an incentive, Pricing and allocation algorithm designs in dynamic ridesharing system, Dynamic programming based metaheuristics for the dial-a-ride problem, Distribution of waiting time for dynamic pickup and delivery problems, Scheduling issues in vehicle routing, A new VRPPD model and a hybrid heuristic solution approach for e-tailing, Fleet management for autonomous vehicles using flows in time-expanded networks, An approximation algorithm for vehicle routing with compatibility constraints, A Hybrid Tabu Search and Constraint Programming Algorithm for the Dynamic Dial-a-Ride Problem, An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP, An exact solution method for the capacitated item-sharing and crowdshipping problem, An optimization model and a solution algorithm for the many-to-many car pooling problem, Dynamic pickup and delivery problems, Fleet management for autonomous vehicles: Online PDP under special constraints, The multi-commodity one-to-one pickup-and-delivery traveling salesman problem, Recovery management for a dial-a-ride system with real-time disruptions, Optimal charging and repositioning of electric vehicles in a free-floating carsharing system, Pickup and delivery problem with incompatibility constraints, The paired many-to-many pickup and delivery problem: an application, Serving rides of equal importance for time-limited dial-a-ride
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The dial-a-ride problem (DARP): variants, modeling issues and algorithms
- Efficient feasibility testing for dial-a-ride problems
- Ambulance location and relocation models.
- A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
- Dynamic vehicle routing: Status and prospects
- 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
- A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints
- An effective and fast heuristic for the dial-a-ride problem
- Modeling and Optimizing Dynamic Dial-a-Ride Problems
- Technical Note—Optimizing the Schedule for a Fixed Vehicle Path with Convex Inconvenience Costs
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- Solving the Dial-a-Ride problem using genetic algorithms
- Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: I. Scheduling
- Optimizing Single Vehicle Many-to-Many Operations with Desired Delivery Times: II. Routing
- 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 unified tabu search heuristic for vehicle routing problems with time windows
- A Tabu Search Heuristic for the Vehicle Routing Problem
- A Request Clustering Algorithm for Door-to-Door Handicapped Transportation
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints
- A dynamic model and parallel tabu search heuristic for real-time ambulance relocation
