Models and algorithms for the heterogeneous dial-a-ride problem with driver-related constraints

DOI10.1007/S00291-010-0229-9zbMATH Open1244.90147DBLPjournals/ors/ParraghCDH12OpenAlexW2102515551WikidataQ59389628 ScholiaQ59389628MaRDI QIDQ443822FDOQ443822

Authors: Sophie N. Parragh, Jean-François Cordeau, K. F. Doerner, Richard F. Hartl 

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

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

zbMATH Keywords

column generationvariable neighborhood searchdial-a-ride-problempassenger transportation

Mathematics Subject Classification ID

Linear programming (90C05) Case-oriented studies in operations research (90B90) Transportation, logistics and supply chain management (90B06)

Cites Work

• Optimization by simulated annealing
• A Branch-and-Cut Algorithm for the Dial-a-Ride Problem
• Ejection chains, reference structures and alternating path methods for traveling salesman problems
• The Vehicle Routing Problem with Time Windows: Minimizing Route Duration
• Variable neighborhood search
• A New Optimization Algorithm for the Vehicle Routing Problem with Time Windows
• Vehicle Routing Problem with Time Windows
• Thermodynamical approach to the travelling salesman problem: An efficient simulation algorithm
• Dynamic pickup and delivery problems
• Dynamic transportation of patients in hospitals
• 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
• A heuristic two-phase solution approach for the multi-objective dial-a-ride problem
• Heuristic Algorithms for the Handicapped Persons Transportation Problem
• Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
• Branch-and-Price Heuristics: A Case Study on the Vehicle Routing Problem with Time Windows
• A dial-a-ride problem for client transportation in a health-care organization
• The shortest path problem with time windows and linear waiting costs

Cited In (25)

• Impact of soft ride time constraints on the complexity of scheduling in dial-a-ride problems
• Efficient GRASP solution approach for the prisoner transportation problem
• 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
• 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
• MILP models of a patient transportation problem
• The dial-a-ride problem: Models and algorithms
• 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
• Drop-and-pull container drayage with flexible assignment of work break for vehicle drivers
• A survey on matheuristics for routing problems

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)