A Preference Order Dynamic Program for a Stochastic Traveling Salesman Problem

DOI10.1287/opre.26.6.1033zbMath0419.90080OpenAlexW2088665172MaRDI QIDQ3853464

Edward P. C. Kao

Publication date: 1978

Published in: Operations Research (Search for Journal in Brave)

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

zbMATH Keywords

traveling salesman problemimplicit enumerationstochastic travel timespreference order dynamic programmingbranch-and-bound strategy

Mathematics Subject Classification ID

Dynamic programming (90C39)

Related Items (21)

Uncertain multiobjective traveling salesman problem ⋮ The Steiner traveling salesman problem with online advanced edge blockages ⋮ Target-level criterion in Markov decision processes ⋮ Data-driven approaches for emissions-minimized paths in urban areas ⋮ Theory and applications of generalized dynamic programming: An overview ⋮ A robust optimization approach to dispatching technicians under stochastic service times ⋮ Interactive procedure for a multiobjective stochastic discrete dynamic problem ⋮ Routing optimization with time windows under uncertainty ⋮ A generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times ⋮ The traveling purchaser problem with stochastic prices: exact and approximate algorithms ⋮ Risky traveling salesman problem ⋮ Some comments on preference order dynamic programming models ⋮ The orienteering problem with stochastic travel and service times ⋮ A traveling salesman problem with pickups and deliveries and stochastic travel times: an application from chemical shipping ⋮ Dynamic journeying under uncertainty ⋮ Scatter search for the stochastic travel-time vehicle routing problem with simultaneous pick-ups and deliveries ⋮ A cutting plane method for risk-constrained traveling salesman problem with random arc costs ⋮ A two-stage vehicle routing model for large-scale bioterrorism emergencies ⋮ A Solution Strategy for a Class of Nonlinear Knapsack Problems ⋮ Stochastic vehicle routing ⋮ Robust Data-Driven Vehicle Routing with Time Windows

This page was built for publication: A Preference Order Dynamic Program for a Stochastic Traveling Salesman Problem