A Preference Order Dynamic Program for a Stochastic Traveling Salesman Problem

DOI10.1287/OPRE.26.6.1033MaRDI QIDQ3853464zbMATH OpenOpenAlexFDO

Authors 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

implicit enumerationtraveling salesman problemstochastic travel timespreference order dynamic programmingbranch-and-bound strategy

Mathematics Subject Classification ID

Dynamic programming (90C39)

Cited in

(21)

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

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

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