A multi-period TSP with stochastic regular and urgent demands
From MaRDI portal
Publication:2456410
Recommendations
- On efficient matheuristic algorithms for multi-period stochastic facility location-assignment problems
- scientific article; zbMATH DE number 1195627
- An integer programming approach for the time-dependent TSP
- The two-echelon stochastic multi-period capacitated location-routing problem
- Multi-objective optimization of stochastic demand inventory routing problems with time windows
- Approximation algorithms for VRP with stochastic demands
- The capacitated vehicle routing problem with stochastic demands and time windows
- A stochastic programming approach for the traveling purchaser problem
- A multi-space sampling heuristic for the vehicle routing problem with stochastic demands
Cites work
- A Markov Decision Model and Decomposition Heuristic for Dynamic Vehicle Dispatching
- Approximations of Dynamic Programs, I
- Approximations of Dynamic Programs, II
- Bounds and Transformations for Discounted Finite Markov Decision Chains
- Competitive analysis of a dispatch policy for a dynamic multi-period routing problem
- Contraction Mappings in the Theory Underlying Dynamic Programming
- Delivery strategies for blood products supplies
- Finding Optimal Survey Policies via Adaptive Markov Decision Processes
- scientific article; zbMATH DE number 3148886 (Why is no real title available?)
- scientific article; zbMATH DE number 700091 (Why is no real title available?)
- Markov decision processes
- On Finding the Maximal Gain for Markov Decision Processes
- Stochastic vehicle routing
- The two-period travelling salesman problem applied to milk collection in Ireland
- Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
Cited in
(4)- A multi-objective vehicle routing and scheduling problem with uncertainty in customers' request and priority
- Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework
- Robust multiperiod vehicle routing under customer order uncertainty
- Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs
This page was built for publication: A multi-period TSP with stochastic regular and urgent demands
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2456410)