Technical Note—Analysis of a Preference Order Traveling Salesman Problem
From MaRDI portal
Publication:3929404
DOI10.1287/opre.29.6.1234zbMath0474.90068OpenAlexW1979315397MaRDI QIDQ3929404
Publication date: 1981
Published in: Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/opre.29.6.1234
stochastic traveling salesmanheuristic toolpreference order dynamic programming solution procedurepreference order traveling salesman problem
Programming involving graphs or networks (90C35) Numerical mathematical programming methods (65K05) Stochastic programming (90C15) Dynamic programming (90C39)
Related Items
Theory and applications of generalized dynamic programming: An overview ⋮ 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 ⋮ A traveling salesman problem with pickups and deliveries and stochastic travel times: an application from chemical shipping ⋮ 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 Solution Strategy for a Class of Nonlinear Knapsack Problems ⋮ Stochastic vehicle routing
