The traveling purchaser problem with stochastic prices: exact and approximate algorithms

DOI10.1016/j.ejor.2010.09.012zbMath1208.90147OpenAlexW2076119111MaRDI QIDQ621973

Yanfeng Ouyang, Seungmo Kang

Publication date: 31 January 2011

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejor.2010.09.012

zbMATH Keywords

dynamic programming

Mathematics Subject Classification ID

Stochastic programming (90C15) Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)

Related Items (4)

The bi-objective traveling purchaser problem with deliveries ⋮ The traveling purchaser problem with fast service option ⋮ The traveling purchaser problem and its variants ⋮ Parameterized algorithms and complexity for the traveling purchaser problem and its variants

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A random-key genetic algorithm for the generalized traveling salesman problem
• Solving a generalized traveling salesperson problem with stochastic customers
• A hybrid scatter search for the probabilistic traveling salesman problem
• Diversified local search strategy under scatter search framework for the probabilistic traveling salesman problem
• Runtime reduction techniques for the probabilistic traveling salesman problem with deadlines
• Control of arrivals and departures in a state-dependent input-output system
• Generalized travelling salesman problem through n sets of nodes: The asymmetrical case
• Travelling purchaser problem
• On the solutions of stochastic traveling salesman problems
• A branch and bound algorithm for the traveling purchaser problem
• An efficient composite heuristic for the symmetric generalized traveling salesman problem
• The stochastic traveling salesman problem: finite size scaling and the cavity prediction
• Improved solutions for the traveling purchaser problem.
• The traveling salesman problem and its variations
• A TABU search heuristic for the team orienteering problem
• Solving the probabilistic TSP with ant colony optimization
• Approximate algorithms for the travelling purchaser problem
• Heuristics for the traveling purchaser problem
• Dynamic tabu search strategies for the traveling purchaser problem
• Further results on the probabilistic traveling salesman problem
• Ant colony optimization for the traveling purchaser problem
• Extension of the 2-p-opt and 1-shift algorithms to the heterogeneous probabilistic traveling salesman problem
• Dynamic Programming Treatment of the Travelling Salesman Problem
• A Dynamic Programming Approach to Sequencing Problems
• Generalized Dynamic Programming for Stochastic Combinatorial Optimization
• Locating a cycle in a transportation or a telecommunications network
• Optimal Sequential Assignment
• A Priori Solution of a Traveling Salesman Problem in Which a Random Subset of the Customers Are Visited
• The stochastic knapsack problem
• A Preference Order Dynamic Program for a Stochastic Traveling Salesman Problem
• Technical Note—Analysis of a Preference Order Traveling Salesman Problem
• A Priori Optimization of the Probabilistic Traveling Salesman Problem
• The Dynamic and Stochastic Knapsack Problem with Deadlines
• A Branch-and-Cut Algorithm for the Symmetric Generalized Traveling Salesman Problem
• A Sequential Stochastic Assignment Problem

This page was built for publication: The traveling purchaser problem with stochastic prices: exact and approximate algorithms