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

DOI10.1016/J.EJOR.2010.09.012MaRDI QIDQ621973zbMATH OpenOpenAlexFDO

Authors Seungmo Kang, Yanfeng Ouyang

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

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

Recommendations

• A stochastic programming approach for the traveling purchaser problem
• The traveling purchaser problem and its variants
• scientific article; zbMATH DE number 1405785
• Algorithms for a stochastic selective travelling salesperson problem
• Parameterized algorithms and complexity for the traveling purchaser problem and its variants
• Traveling salesman problems with profits and stochastic customers
• A branch and bound algorithm for the traveling purchaser problem
• Publication:3479820
• A heuristic approach for the travelling purchaser problem
• The traveling purchaser problem with budget constraint

Cites work

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

Cited in

(6)

• A stochastic programming approach for the traveling purchaser problem
• The traveling purchaser problem with fast service option
• Parameterized algorithms for the Traveling Purchaser problem with additional constraints
• The traveling purchaser problem and its variants
• The bi-objective traveling purchaser problem with deliveries
• Parameterized algorithms and complexity for the traveling purchaser problem and its variants

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

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