Dynamic parcel pick-up routing problem with prioritized customers and constrained capacity via lower-bound-based rollout approach
From MaRDI portal
Publication:6109553
DOI10.1016/j.cor.2023.106176OpenAlexW4321763979MaRDI QIDQ6109553
Publication date: 4 July 2023
Published in: Computers \& Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.cor.2023.106176
Cites Work
- Unnamed Item
- An anytime multistep anticipatory algorithm for online stochastic combinatorial optimization
- Adaptive granular local search heuristic for a dynamic vehicle routing problem
- A stochastic and dynamic model for the single-vehicle pick-up and delivery problem
- Faster rollout search for the vehicle routing problem with stochastic demands and restocking
- A rollout algorithm framework for heuristic solutions to finite-horizon stochastic dynamic programs
- Rollout algorithms for stochastic scheduling problems
- Rollout sampling approximate policy iteration
- A review of dynamic vehicle routing problems
- Stability of a priority queueing system with customer transfers
- Rollout algorithms for combinatorial optimization
- Vehicle routing with private and shared delivery locations
- Diversion Issues in Real-Time Vehicle Dispatching
- Rollout Event-Triggered Control: Beyond Periodic Control Performance
- Priority queue with customer upgrades
- A Rollout Policy for the Vehicle Routing Problem with Stochastic Demands
- A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane
- Adaptive Routing on the Plane
- Partially dynamic vehicle routing—models and algorithms
- Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching
- Reoptimization Approaches for the Vehicle-Routing Problem with Stochastic Demands
- Rollout Policies for Dynamic Solutions to the Multivehicle Routing Problem with Stochastic Demand and Duration Limits
- Scenario-Based Planning for Partially Dynamic Vehicle Routing with Stochastic Customers
This page was built for publication: Dynamic parcel pick-up routing problem with prioritized customers and constrained capacity via lower-bound-based rollout approach
