The dial-a-ride problem: Models and algorithms
From MaRDI portal
Recommendations
- The dial-a-ride problem (DARP): variants, modeling issues and algorithms
- Modeling and optimizing dynamic dial-a-ride problems
- Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
- Complexity, algorithmic, and computational aspects of a dial-a-ride type problem
- A matheuristic for the dial-a-ride problem
- The time‐consistent dial‐a‐ride problem
- Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- Typology and literature review for dial-a-ride problems
- An effective and fast heuristic for the dial-a-ride problem
Cites work
- scientific article; zbMATH DE number 192876 (Why is no real title available?)
- scientific article; zbMATH DE number 1054963 (Why is no real title available?)
- scientific article; zbMATH DE number 1488066 (Why is no real title available?)
- scientific article; zbMATH DE number 1361564 (Why is no real title available?)
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
- A Request Clustering Algorithm for Door-to-Door Handicapped Transportation
- A Tabu Search Heuristic for the Vehicle Routing Problem
- A dial-a-ride problem for client transportation in a health-care organization
- A dynamic model and parallel tabu search heuristic for real-time ambulance relocation
- A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints
- A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
- A two-phase insertion technique of unexpected customers for a dynamic dial-a-ride problem
- A unified tabu search heuristic for vehicle routing problems with time windows
- Ambulance location and relocation models.
- An effective and fast heuristic for the dial-a-ride problem
- Dynamic vehicle routing: Status and prospects
- Efficient feasibility testing for dial-a-ride problems
- Heuristic Algorithms for the Handicapped Persons Transportation Problem
- Modeling and optimizing dynamic dial-a-ride problems
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- 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
- Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints
- Solving the Dial-a-Ride problem using genetic algorithms
- Technical Note—Optimizing the Schedule for a Fixed Vehicle Path with Convex Inconvenience Costs
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- The dial-a-ride problem (DARP): variants, modeling issues and algorithms
Cited in
(only showing first 100 items - show all)- The real-time on-demand bus routing problem: the cost of dynamic requests
- Optimal charging and repositioning of electric vehicles in a free-floating carsharing system
- Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation
- Reallocation problems with minimum completion time
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- The prisoner transportation problem
- Mathematical models to improve the current practice in a home healthcare unit
- A reduction approach to the two-campus transport problem
- A deterministic annealing local search for the electric autonomous dial-a-ride problem
- The pickup and delivery problem with time windows and scheduling on the edges
- Optimization for dynamic ride-sharing: a review
- Recent models and algorithms for one-to-one pickup and delivery problems
- Dynamic transportation of patients in hospitals
- The rich heterogeneous dial-a-ride problem with trip time prediction
- Multiple plan approach for a dynamic dial-a-ride problem
- On the hardness of the drone delivery problem
- A column generation approach for location-routing problems with pickup and delivery
- An ILP-based local search procedure for the VRP with pickups and deliveries
- Charging station location and fleet sizing for shared autonomous electric vehicles using Benders' decomposition
- Maximizing the number of rides served for time-limited Dial-a-Ride*
- A hybrid genetic algorithm for the heterogeneous dial-a-ride problem
- Local search heuristics for the probabilistic dial-a-ride problem
- An unpaired pickup and delivery problem with time dependent assignment costs: application in air cargo transportation
- Typology and literature review for dial-a-ride problems
- Variable neighborhood search for the dial-a-ride problem
- Special issue on vehicle routing and scheduling: recent trends and advances
- A tabu search heuristic for the dynamic transportation of patients between care units
- Complexity, algorithmic, and computational aspects of a dial-a-ride type problem
- A hybrid greedy randomized adaptive search heuristic to solve the dial-a-ride problem
- Crane scheduling in railway yards: an analysis of computational complexity
- Evaluating a simulated annealing metaheuristic for the heterogeneous on-demand bus routing problem with a novel experimental setup
- Branch and price algorithm for route optimization on customized bus service
- Revised eight-step feasibility checking procedure with linear time complexity for the dial-a-ride problem (DARP)
- Scheduling issues in vehicle routing
- The paired many-to-many pickup and delivery problem: an application
- A genetic column generation algorithm for sustainable spare part delivery: application to the Sydney droppoint network
- A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem
- Adaptive forecast-driven repositioning for dynamic ride-sharing
- Étude comparative de divers modèles pour le problème de transport à la demande
- Vehicle routing problems with alternative paths: an application to on-demand transportation
- The vehicle sharing and task allocation problem: MILP formulation and a heuristic solution approach
- A heuristic two-phase solution approach for the multi-objective dial-a-ride problem
- A ride time-oriented scheduling algorithm for dial-a-ride problems
- Modeling and optimizing dynamic dial-a-ride problems
- Pricing and allocation algorithm designs in dynamic ridesharing system
- 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 hybrid adaptive large neighborhood heuristic for a real-life dial-a-ride problem
- A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem
- Trends in transportation and logistics
- Accelerating value function approximations for dynamic dial-a-ride problems via dimensionality reductions
- An integer \(L\)-shaped algorithm for the dial-a-ride problem with stochastic customer delays
- A branch-and-cut-and-price algorithm for shared mobility considering customer satisfaction
- Optimisation of maintenance routing and scheduling for offshore wind farms
- Solving a selective dial-a-ride problem with logic-based Benders decomposition
- Dynamic courier routing for a food delivery service
- The dial-a-tour problem
- A new VRPPD model and a hybrid heuristic solution approach for e-tailing
- scientific article; zbMATH DE number 1420897 (Why is no real title available?)
- Optimizing Asia-Europe container network: the Suez Canal and Cape of Good Hope routes in a changing world
- An approximation algorithm for vehicle routing with compatibility constraints
- Serving rides of equal importance for time-limited dial-a-ride
- Daily aircraft routing for amphibious ready groups
- The generator distribution problem for base stations during emergency power outage: a branch-and-price-and-cut approach
- The rail-road dial-a-ride problem
- Instance generation tool for on-demand transportation problems
- Pickup and delivery problem with incompatibility constraints
- An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization
- A data-driven matching algorithm for ride pooling problem
- Algorithmic analysis for ridesharing of personal vehicles
- A dynamic tree algorithm for peer-to-peer ridesharing matching
- A data-driven system for cooperative-bus route planning based on generative adversarial network and metric learning
- Benchmarking online dispatch algorithms for emergency medical services
- The multi-commodity one-to-one pickup-and-delivery traveling salesman problem
- Fleet management for autonomous vehicles: online PDP under special constraints
- Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem
- An MDD-Based Lagrangian Approach to the Multicommodity Pickup-and-Delivery TSP
- Rich vehicle routing problems: from a taxonomy to a definition
- Efficient GRASP solution approach for the prisoner transportation problem
- Hybrid column generation and large neighborhood search for the dial-a-ride problem
- The pickup and delivery problem with time windows and scheduled lines
- The complexity of the unit stop number problem and its implications to other related problems
- The EMS vehicle patient transportation problem during a demand surge
- Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
- Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles
- Maximizing rides served for dial-a-ride on the uniform metric
- Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
- Comparison of anticipatory algorithms for a dial-a-ride problem
- Event-based MILP models for ridepooling applications
- Earliest deadline first is a 2-approximation for DARP with time windows
- A hybrid algorithm for the vehicle routing problem with AND/OR precedence constraints and time windows
- The cumulative school bus routing problem: Polynomial‐size formulations
- Euler is standing in line dial-a-ride problems with precedence-constraints
- A concise guide to existing and emerging vehicle routing problem variants
- Complexity and approximation results on the shared transportation problem
- On the shared transportation problem: computational hardness and exact approach
- Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation
- Dynamic pickup and delivery problems
- An exact solution method for the capacitated item-sharing and crowdshipping problem
- Prepositioning can improve the performance of a dynamic stochastic on-demand public bus system
This page was built for publication: The dial-a-ride problem: Models and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2480256)
