Dynamic programming based metaheuristics for the dial-a-ride problem
DOI10.1007/S10479-014-1605-7zbMATH Open1331.90015DBLPjournals/anor/RitzingerPH16OpenAlexW2016244040WikidataQ59389543 ScholiaQ59389543MaRDI QIDQ5963101FDOQ5963101
Ulrike Ritzinger, Jakob Puchinger, Richard F. Hartl
Publication date: 4 March 2016
Published in: Annals of Operations Research (Search for Journal in Brave)
Full work available at URL: https://hal.inria.fr/hal-01224565/file/Ritzinger2012a.pdf
Approximation methods and heuristics in mathematical programming (90C59) Dynamic programming (90C39) Transportation, logistics and supply chain management (90B06)
Cites Work
- Title not available (Why is that?)
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
- Matheuristics
- The dial-a-ride problem: Models and algorithms
- Variable neighborhood search for the dial-a-ride problem
- Dynamic Programming Treatment of the Travelling Salesman Problem
- Hybrid column generation and large neighborhood search for the dial-a-ride problem
- Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
- Metaheuristics for bi-level optimization
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- Restricted dynamic programming: a flexible framework for solving realistic VRPs
- A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
- Metaheuristics for the Vehicle Routing Problem and Its Extensions: A Categorized Bibliography
- A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
- Fast local search algorithms for the handicapped persons transportation problem
Cited In (18)
- A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints
- Modeling and optimizing dynamic dial-a-ride problems
- Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem
- Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization
- Ballast water dynamic allocation optimization model and analysis for safe and reliable operation of floating cranes
- Daily aircraft routing for amphibious ready groups
- Critical objective function values in linear sum assignment problems
- An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization
- Benchmarking online dispatch algorithms for emergency medical services
- Tabu search for the real-world carpooling problem
- Comparison of anticipatory algorithms for a dial-a-ride problem
- A vector evaluated evolutionary algorithm with exploitation reinforcement for the dynamic pollution routing problem
- A simheuristic algorithm for time-dependent waste collection management with stochastic travel times
- A fuzzy programming method for modeling demand uncertainty in the capacitated road-rail multimodal routing problem with time windows
- A new approximate dynamic programming algorithm based on an actor–critic framework for optimal control of alkali–surfactant–polymer flooding
- Online spatio-temporal matching in stochastic and dynamic domains
- Typology and literature review for dial-a-ride problems
- Systematic review of the latest scientific publications on the vehicle routing problem
Uses Software
This page was built for publication: Dynamic programming based metaheuristics for the dial-a-ride problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5963101)
