The dynamic multiperiod vehicle routing problem with probabilistic information
From MaRDI portal
(Redirected from Publication:337038)
Recommendations
Cites work
- A Stochastic and Dynamic Vehicle Routing Problem in the Euclidean Plane
- A review of dynamic vehicle routing problems
- A stochastic and dynamic routing policy using branching processes with state dependent immigration
- Adaptive granular local search heuristic for a dynamic vehicle routing problem
- Algorithms for the Vehicle Routing and Scheduling Problems with Time Window Constraints
- An Exact Algorithm for the Capacitated Vehicle Routing Problem Based on a Two-Commodity Network Flow Formulation
- Competitive analysis for dynamic multiperiod uncapacitated routing problems
- Dynamic pickup and delivery problems
- Integer Programming Formulation of Traveling Salesman Problems
- Optimal solutions for routing problems with profits
- The capacitated team orienteering and profitable tour problems
- The dynamic multi-period vehicle routing problem
- The orienteering problem
- The period vehicle routing problem and its extensions
Cited in
(17)- Dynamic vehicle routing with priority classes of stochastic demands
- A probabilistic approach to pickup and delivery problems with time window uncertainty
- Dynamic multi-period vehicle routing with touting
- Stochastic dynamic vehicle routing in the light of prescriptive analytics: a review
- Biased‐randomized iterated local search for a multiperiod vehicle routing problem with price discounts for delivery flexibility
- Multi-period capacitated facility location under delayed demand satisfaction
- Value function approximation for dynamic multi-period vehicle routing
- The dynamic dispatch waves problem for same-day delivery
- The dynamic multi-period vehicle routing problem
- Robust multiperiod vehicle routing under customer order uncertainty
- Competition and cooperation in pickup and multiple delivery problems
- Management policies in a dynamic multi period routing problem
- Horizontal combinations of online and offline approximate dynamic programming for stochastic dynamic vehicle routing
- The in‐house logistics routing problem
- Multi-period vehicle routing problem with due dates
- Competitive analysis for dynamic multiperiod uncapacitated routing problems
- A dynamic multi-period general routing problem arising in postal service and parcel delivery systems
This page was built for publication: The dynamic multiperiod vehicle routing problem with probabilistic information
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q337038)