Technical Note—Analysis of a Preference Order Traveling Salesman Problem

DOI10.1287/OPRE.29.6.1234MaRDI QIDQ3929404zbMATH OpenOpenAlexFDO

Authors Moshe Sniedovich

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

zbMATH Keywords

heuristic toolpreference order dynamic programming solution procedurepreference order traveling salesman problemstochastic traveling salesman

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Stochastic programming (90C15) Programming involving graphs or networks (90C35) Dynamic programming (90C39)

Cited in

(9)

• Theory and applications of generalized dynamic programming: An overview
• Stochastic vehicle routing
• 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 generalized variable neighborhood search heuristic for the capacitated vehicle routing problem with stochastic service times
• A cutting plane method for risk-constrained traveling salesman problem with random arc costs
• Routing optimization with time windows under uncertainty
• A Solution Strategy for a Class of Nonlinear Knapsack Problems
• The traveling purchaser problem with stochastic prices: exact and approximate algorithms

This page was built for publication: Technical Note—Analysis of a Preference Order Traveling Salesman Problem

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