Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
From MaRDI portal
Publication:443822
DOI10.1007/s00291-010-0229-9zbMath1244.90147DBLPjournals/ors/ParraghCDH12OpenAlexW2102515551WikidataQ59389628 ScholiaQ59389628MaRDI QIDQ443822
Sophie N. Parragh, Jean-François Cordeau, Richard F. Hartl, Karl F. Doerner
Publication date: 13 August 2012
Published in: OR Spectrum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00291-010-0229-9
Linear programming (90C05) Transportation, logistics and supply chain management (90B06) Case-oriented studies in operations research (90B90)
Related Items (15)
The pickup and delivery problem with time windows and scheduled lines ⋮ 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 ⋮ Ambulance routing for disaster response with patient groups ⋮ A hybrid genetic algorithm for the heterogeneous dial-a-ride problem ⋮ The prisoner transportation problem ⋮ Interrelated trips in the rural dial-a-ride problem with autonomous vehicles ⋮ A branch-and-price algorithm for a routing problem with inbound and outbound requests ⋮ Efficient GRASP solution approach for the prisoner transportation problem ⋮ Typology and literature review for dial-a-ride problems ⋮ Making the most of fleets: a profit-maximizing multi-vehicle pickup and delivery selection problem ⋮ A HYBRID GREEDY RANDOMIZED ADAPTIVE SEARCH HEURISTIC TO SOLVE THE DIAL-A-RIDE PROBLEM ⋮ Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports ⋮ A survey on matheuristics for routing problems ⋮ A matheuristic for the truck and trailer routing problem
Cites Work
- Optimization by Simulated Annealing
- Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
- Dynamic pickup and delivery problems
- Variable neighborhood search
- Ejection chains, reference structures and alternating path methods for traveling salesman problems
- Dynamic transportation of patients in hospitals
- A dial-a-ride problem for client transportation in a health-care organization
- The dial-a-ride problem: Models and algorithms
- Resource extension functions: properties, inversion, and generalization to segments
- Static pickup and delivery problems: a classification scheme and survey. (With comments and rejoinder)
- Variable neighborhood search for the dial-a-ride problem
- Drive: Dynamic Routing of Independent Vehicles
- The Shortest Path Problem with Time Windows and Linear Waiting Costs
- A heuristic two-phase solution approach for the multi-objective dial-a-ride problem
- A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
- A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
- The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
- Heuristic Algorithms for the Handicapped Persons Transportation Problem
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- Vehicle Routing Problem with Time Windows
- Branch-and-Price Heuristics: A Case Study on the Vehicle Routing Problem with Time Windows
This page was built for publication: Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints
