Dynamic tabu list management using the reverse elimination method

DOI10.1007/BF02022561zbMath0775.90290MaRDI QIDQ2366993

Frank Dammeyer, Stefan Voß

Publication date: 16 August 1993

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

Mathematics Subject Classification ID

90C27: Combinatorial optimization

90-08: Computational methods for problems pertaining to operations research and mathematical programming

Related Items

Heuristic algorithms for the maximum diversity problem, Une approche hybride pour le sac à dos multidimensionnel en variables 0–1, Defining tabu list size and aspiration criterion within tabu search methods, A Modified Binary Particle Swarm Optimization for Knapsack Problems, Two meta-heuristics for parallel machine scheduling with job splitting to minimize total tardiness, Solving multidimensional knapsack problems with generalized upper bound constraints using critical event tabu search, The multidimensional 0-1 knapsack problem -- bounds and computational aspects, Genetic algorithms and tabu search: Hybrids for optimization, Global optimization and multi knapsack: a percolation algorithm., The multidimensional 0-1 knapsack problem: an overview., Tabu search and finite convergence, Solving zero-one mixed integer programming problems using tabu search, An efficient tabu search approach for the 0-1 multidimensional knapsack problem, An iterated ``hyperplane exploration approach for the quadratic knapsack problem, Computational experiment of critical event tabu search for the general integer multidimensional knapsack problem, Improved results on the 0--1 multidimensional knapsack problem, Heuristics for the generalised assignment problem: Simulated annealing and tabu search approaches, Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue, Local search with memory: Benchmarking RTS, Dynamic tabu search strategies for the traveling purchaser problem, Genetic and hybrid algorithms for graph coloring, A user's guide to tabu search, \(\text{MA}\mid\text{PM}\): memetic algorithms with population management, Solving the multidimensional multiple-choice knapsack problem by constructing convex hulls, Extension of Reverse Elimination Method Through a Dynamic Management of the Tabu List, Modeling multiple plant sourcing decisions

Uses Software

• Tabu search

Cites Work

• A simulated annealing approach to the multiconstraint zero-one knapsack problem
• Tabu search techniques. A tutorial and an application to neural networks
• An efficient preprocessing procedure for the multidimensional 0-1 knapsack problem
• The tabu search metaheuristic: How we used it
• Tabu search for the multilevel generalized assignment problem
• A user's guide to tabu search
• Large-scale controlled rounding using tabu search with strategic oscillation
• Efficient algorithms for solving multiconstraint zero-one knapsack problems to optimality
• New Greedy-Like Heuristics for the Multidimensional 0-1 Knapsack Problem
• Technical Note—On the Cancellation Sequence Method of Tabu Search