Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
From MaRDI portal
(Redirected from Publication:443822)
Recommendations
- A hybrid algorithm for the multi-depot heterogeneous dial-a-ride problem
- The dial-a-ride problem (DARP): variants, modeling issues and algorithms
- Hybrid column generation and large neighborhood search for the dial-a-ride problem
- Solution of the Dial-a-Ride Problem with multi-dimensional capacity constraints
- The dial-a-ride problem: Models and algorithms
Cites work
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- A dial-a-ride problem for client transportation in a health-care organization
- A heuristic two-phase solution approach for the multi-objective dial-a-ride problem
- Branch-and-Price Heuristics: A Case Study on the Vehicle Routing Problem with Time Windows
- DRIVE: Dynamic routing of independent vehicles
- Dynamic pickup and delivery problems
- Dynamic transportation of patients in hospitals
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- Heuristic Algorithms for the Handicapped Persons Transportation Problem
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- Optimization by simulated annealing
- Resource extension functions: properties, inversion, and generalization to segments
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- The dial-a-ride problem: Models and algorithms
- The shortest path problem with time windows and linear waiting costs
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Variable neighborhood search
- Variable neighborhood search for the dial-a-ride problem
- Vehicle Routing Problem with Time Windows
Cited in
(25)- Impact of soft ride time constraints on the complexity of scheduling in dial-a-ride problems
- Integrating stochastic time-dependent travel speed in solution methods for the dynamic dial-a-ride problem
- Rich vehicle routing problems: from a taxonomy to a definition
- Efficient GRASP solution approach for the prisoner transportation problem
- The pickup and delivery problem with time windows and scheduled lines
- Models and algorithms for reliability-oriented dial-a-ride with autonomous electric vehicles
- Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
- Event-based MILP models for ridepooling applications
- Multi-directional local search for a bi-objective dial-a-ride problem in patient transportation
- Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem
- Ambulance routing for disaster response with patient groups
- Interrelated trips in the rural dial-a-ride problem with autonomous vehicles
- A matheuristic for the truck and trailer routing problem
- A sample average approximation approach for the stochastic dial-a-ride problem on a multigraph with user satisfaction
- The prisoner transportation problem
- A branch-and-price algorithm for a routing problem with inbound and outbound requests
- Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects
- The rich heterogeneous dial-a-ride problem with trip time prediction
- The dial-a-ride problem: Models and algorithms
- MILP models of a patient transportation problem
- A hybrid genetic algorithm for the heterogeneous dial-a-ride problem
- Typology and literature review for dial-a-ride problems
- A hybrid greedy randomized adaptive search heuristic to solve the dial-a-ride problem
- A survey on matheuristics for routing problems
- Drop-and-pull container drayage with flexible assignment of work break for vehicle drivers
This page was built for publication: Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q443822)
