A multi-period TSP with stochastic regular and urgent demands

DOI10.1016/j.ejor.2006.12.040zbMath1144.90006OpenAlexW1975742972MaRDI QIDQ2456410

Guglielmo Lulli, Giovanni Andreatta

Publication date: 18 October 2007

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2006.12.040

zbMATH Keywords

Markov processesRoutinglogistics

Mathematics Subject Classification ID

Traffic problems in operations research (90B20)

Related Items (4)

Efficient techniques for the multi-period vehicle routing problem with time windows within a branch and price framework ⋮ Heuristic algorithms for the 2-period balanced travelling salesman problem in Euclidean graphs ⋮ A multi-objective vehicle routing and scheduling problem with uncertainty in customers' request and priority ⋮ Robust Multiperiod Vehicle Routing Under Customer Order Uncertainty

Cites Work

• Unnamed Item
• Unnamed Item
• Delivery strategies for blood products supplies
• Stochastic vehicle routing
• The two-period travelling salesman problem applied to milk collection in Ireland
• Competitive analysis of a dispatch policy for a dynamic multi-period routing problem
• Vehicle Routing with Stochastic Demands: Properties and Solution Frameworks
• Bounds and Transformations for Discounted Finite Markov Decision Chains
• Approximations of Dynamic Programs, I
• Approximations of Dynamic Programs, II
• Finding Optimal Survey Policies via Adaptive Markov Decision Processes
• A Markov Decision Model and Decomposition Heuristic for Dynamic Vehicle Dispatching
• Contraction Mappings in the Theory Underlying Dynamic Programming
• On Finding the Maximal Gain for Markov Decision Processes
• Markov decision processes

This page was built for publication: A multi-period TSP with stochastic regular and urgent demands