Dynamic programming based metaheuristics for the dial-a-ride problem
From MaRDI portal
Publication:5963101
Recommendations
- A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
- Hybrid column generation and large neighborhood search for the dial-a-ride problem
- A matheuristic for the dial-a-ride problem
- A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem
- An effective and fast heuristic for the dial-a-ride problem
Cites work
- scientific article; zbMATH DE number 1452992 (Why is no real title available?)
- A restricted dynamic programming heuristic algorithm for the time dependent traveling salesman problem
- A two-stage hybrid algorithm for pickup and delivery vehicle routing problems with time windows
- An Optimal Algorithm for the Traveling Salesman Problem with Time Windows
- Dynamic Programming Treatment of the Travelling Salesman Problem
- Fast local search algorithms for the handicapped persons transportation problem
- Hybrid column generation and large neighborhood search for the dial-a-ride problem
- Matheuristics
- Metaheuristics for bi-level optimization
- Metaheuristics for the Vehicle Routing Problem and Its Extensions: A Categorized Bibliography
- Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
- Models and branch‐and‐cut algorithms for pickup and delivery problems with time windows
- Restricted dynamic programming: a flexible framework for solving realistic VRPs
- The dial-a-ride problem: Models and algorithms
- Variable neighborhood search for the dial-a-ride problem
Cited in
(24)- An ALNS algorithm for the static dial-a-ride problem with ride and waiting time minimization
- Comparison of anticipatory algorithms for a dial-a-ride problem
- A simheuristic algorithm for time-dependent waste collection management with stochastic travel times
- A vector evaluated evolutionary algorithm with exploitation reinforcement for the dynamic pollution routing problem
- Ballast water dynamic allocation optimization model and analysis for safe and reliable operation of floating cranes
- A hybrid tabu search and constraint programming algorithm for the dynamic dial-a-ride problem
- A Dynamic Programming Solution of the Large-Scale Single-Vehicle Dial-A-Ride Problem with Time Windows
- Systematic review of the latest scientific publications on the vehicle routing problem
- A fast heuristic for solving a large-scale static dial-a-ride problem under complex constraints
- Daily aircraft routing for amphibious ready groups
- Adaptive large neighborhood search for the time-dependent profitable dial-a-ride problem
- New optimization guidance for dynamic dial-a-ride problems
- Modeling and optimizing dynamic dial-a-ride problems
- A fuzzy programming method for modeling demand uncertainty in the capacitated road-rail multimodal routing problem with time windows
- A matheuristic for the dial-a-ride problem
- 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
- Tabu search for the real-world carpooling problem
- Revisiting dynamic programming for precedence-constrained traveling salesman problem and its time-dependent generalization
- Typology and literature review for dial-a-ride problems
- Critical objective function values in linear sum assignment problems
- A dial-a-ride problem for client transportation in a health-care organization
- Metaheuristics for the dynamic stochastic dial-a-ride problem with expected return transports
- Benchmarking online dispatch algorithms for emergency medical services
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)
