Dynamic tabu search strategies for the traveling purchaser problem

DOI10.1007/BF02125457zbMath0851.90133OpenAlexW2160968871MaRDI QIDQ1919843

Stefan Voß

Publication date: 28 July 1996

Published in: Annals of Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02125457

zbMATH Keywords

simulated annealingtabu searchtraveling purchaser problemdynamic strategiescancellation sequence methodreverse elimination methodmetastrategy

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35)

Related Items

The bi-objective traveling purchaser problem with deliveries, The multi-vehicle traveling purchaser problem with pairwise incompatibility constraints and unitary demands: a branch-and-price approach, Ant colony optimization for the traveling purchaser problem, The traveling purchaser problem, with multiple stacks and deliveries: a branch-and-cut approach, An effective matheuristic for the capacitated total quantity discount problem, Solving the asymmetric traveling purchaser problem, Metaheuristics: A bibliography, The traveling purchaser problem with fast service option, A GRASP/Path‐Relinking algorithm for the traveling purchaser problem, The traveling purchaser problem with stochastic prices: exact and approximate algorithms, Improved heuristics for the traveling purchaser problem., The traveling purchaser problem and its variants, An experimental analysis of evolutionary heuristics for the biobjective traveling purchaser problem, A heuristic approach for the travelling purchaser problem, Models for a traveling purchaser problem with additional side-constraints, Defining tabu list size and aspiration criterion within tabu search methods, The traveling purchaser problem with budget constraint, Heuristics for single-pass welding task sequencing, Transgenetic algorithm for the traveling purchaser problem, Effective Algorithms for a Bounded Version of the Uncapacitated TPP, Advanced greedy algorithms and surrogate constraint methods for linear and quadratic knapsack and covering problems, Heuristics for the traveling purchaser problem

Uses Software

• Tabu search

Cites Work

• Unnamed Item
• Unnamed Item
• Heuristics for the capacitated plant location model
• Travelling purchaser problem
• Approximate algorithms for the travelling purchaser problem
• Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches
• A user's guide to tabu search
• Dynamic tabu list management using the reverse elimination method
• Large-scale controlled rounding using tabu search with strategic oscillation
• Technical Note—On the Cancellation Sequence Method of Tabu Search
• Tabu Search—Part I
• Tabu Search—Part II
• Capacitated clustering problems by hybrid simulated annealing and tabu search
• An Effective Heuristic Algorithm for the Traveling-Salesman Problem