A dynamic traveling salesman problem with stochastic arc costs

DOI10.1287/OPRE.2014.1301MaRDI QIDQ2942707zbMATH OpenOpenAlexFDO

Authors Alejandro Toriello, William B. Haskell, Michael Poremba

Publication date 11 September 2015

Published in Operations Research (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1287/opre.2014.1301

zbMATH Keywords

traveling salesman problemstochastic vehicle routingsemi-infinite linear programapproximate dynamic program

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Dynamic programming (90C39) Semi-infinite programming (90C34)

Recommendations

• New policies for the dynamic traveling salesman problem
• An approximate dynamic programming approach for the vehicle routing problem with stochastic demands
• scientific article; zbMATH DE number 7368819
• Rollout policies for dynamic solutions to the multivehicle routing problem with stochastic demand and duration limits
• Analysis of a rollout approach to sequencing problems with stochastic routing applications

Cited in

(20)

• Dynamic node packing
• A progressive hedging method for the multi-path travelling salesman problem with stochastic travel times
• Relationship between least squares Monte Carlo and approximate linear programming
• A sampling algorithm based on supervised learning for a dynamic traveling salesman problem
• Network-based approximate linear programming for discrete optimization
• Theory and application of reciprocal transformation of “path problem” and “time float problem”
• A customized genetic algorithm for bi-objective routing in a dynamic network
• A polyhedral approach to online bipartite matching
• scientific article; zbMATH DE number 7368819 (Why is no real title available?)
• Application of element decomposing method for solving traveling salesman problems
• A cutting plane method for risk-constrained traveling salesman problem with random arc costs
• A Polyhedral Approach to Online Bipartite Matching
• New policies for the dynamic traveling salesman problem
• Deep Q-learning for same-day delivery with vehicles and drones
• Dynamic traveling salesman problem with stochastic release dates
• The covering Canadian traveller problem
• A bi-criteria moving-target travelling salesman problem under uncertainty
• Decomposition-based exact algorithms for risk-constrained traveling salesman problems with discrete random arc costs
• Semi-infinite relaxations for the dynamic knapsack problem with stochastic item sizes
• Solving dynamic traveling salesman problem using dynamic Gaussian process regression

This page was built for publication: A dynamic traveling salesman problem with stochastic arc costs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2942707)