The dial-a-ride problem (DARP): variants, modeling issues and algorithms
From MaRDI portal
(Redirected from Publication:1432014)
Recommendations
Cited in
(70)- Routing by ranking: a link analysis method for the constrained dial-a-ride problem
- Computer-aided complexity classification of dial-a-ride problems
- É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
- An effective and fast heuristic for the dial-a-ride problem
- A dial-a-ride problem for client transportation in a health-care organization
- Modeling and optimizing dynamic dial-a-ride problems
- Surveys in operations research
- A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem
- A column generation and combinatorial Benders decomposition algorithm for the selective dial-a-ride-problem
- The dial-a-ride problem with private fleet and common carrier
- 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 scheme for determining vehicle routes based on Arc-based service network design
- Solving a selective dial-a-ride problem with logic-based Benders decomposition
- 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?)
- Daily aircraft routing for amphibious ready groups
- Modelling and solving the senior transportation problem
- scientific article; zbMATH DE number 1185321 (Why is no real title available?)
- The demand weighted vehicle routing problem
- Impact of soft ride time constraints on the complexity of scheduling in dial-a-ride problems
- Eleven surveys in operations research
- The share-a-ride problem: people and parcels sharing taxis
- Twelve surveys in operations research
- The complexity of the unit stop number problem and its implications to other related problems
- Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
- A risk-constrained time-dependent cash-in-transit routing problem in multigraph under uncertainty
- Tabu search for the real-world carpooling problem
- A two-stage model for a day-ahead paratransit planning problem
- Designing the master schedule for demand-adaptive transit systems
- Complexity and approximation results on the shared transportation problem
- On the shared transportation problem: computational hardness and exact approach
- Measures of dynamism and urgency in logistics
- The dial-A-ride problem with transfers
- Real-time split-delivery pickup and delivery time window problems with transfers
- Interrelated trips in the rural dial-a-ride problem with autonomous vehicles
- Graph representation of the fixed route dial-a-ride problem
- The static on‐demand bus routing problem: large neighborhood search for a dial‐a‐ride problem with bus station assignment
- Mathematical formulations for a 1-full-truckload pickup-and-delivery problem
- An adaptive insertion algorithm for the single-vehicle dial-a-ride problem with narrow time windows
- New notation and classification scheme for vehicle routing problems
- Balanced dynamic multiple travelling salesmen: algorithms and continuous approximations
- An optimization model and a solution algorithm for the many-to-many car pooling problem
- A note on the online interval scheduling secretary problem
- Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints
- An adaptive large neighborhood search heuristic for the share-a-ride problem
- Efficient feasibility testing for dial-a-ride problems
- The pickup and delivery problem with transfers: formulation and a branch-and-cut solution method
- A sample average approximation approach for the stochastic dial-a-ride problem on a multigraph with user satisfaction
- Optimization of occupancy rate in dial-a-ride problems via linear fractional column generation
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- The time‐consistent dial‐a‐ride problem
- Strong cuts from compatibility relations for the dial-a-ride problem
- The school bus routing and scheduling problem with transfers
- A heuristic algorithm for a dial-a-ride problem with time windows, multiple capacities, and multiple objectives
- A column generation approach for location-routing problems with pickup and delivery
- A GRASP with adaptive large neighborhood search for pickup and delivery problems with transshipment
- Mobility allowance shuttle transit (MAST) services: MIP formulation and strengthening with logic constraints
- Health care logistics, emergency preparedness, and disaster relief: new challenges for routing problems with a focus on the austrian situation
- The dial-a-ride problem: Models and algorithms
- Local search heuristics for the probabilistic dial-a-ride problem
- Typology and literature review for dial-a-ride problems
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- A matheuristic for the dial-a-ride problem
- Complexity, algorithmic, and computational aspects of a dial-a-ride type problem
- A truck scheduling problem arising in intermodal container transportation
- A hybrid greedy randomized adaptive search heuristic to solve the dial-a-ride problem
- Revised eight-step feasibility checking procedure with linear time complexity for the dial-a-ride problem (DARP)
- A Two-stage Model for a Day-ahead Paratransit Planning Problem
This page was built for publication: The dial-a-ride problem (DARP): variants, modeling issues and algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1432014)
