Local search with memory: Benchmarking RTS

DOI10.1007/BF01719249zbMath0843.90094MaRDI QIDQ1908991

Roberto Battiti, Giampietro Tecchiolli

Publication date: 7 March 1996

Published in: OR Spektrum (Search for Journal in Brave)

zbMATH Keywords

neural networkssimulated annealinggenetic algorithmsmultiknapsack problemreactive tabu search methodrepeated local minima search

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Related Items (12)

Simulated annealing and tabu search in the long run: A comparison on QAP tasks ⋮ Problems of discrete optimization: challenges and main approaches to solve them ⋮ Strategies with memories: Local search in an application oriented environment. Applied local search -- a prologue ⋮ The continuous reactive tabu search: Blending combinatorial optimization and stochastic search for global optimization ⋮ Metaheuristics: A bibliography ⋮ A Modified Binary Particle Swarm Optimization for Knapsack Problems ⋮ The multidimensional 0-1 knapsack problem: an overview. ⋮ The method of global equilibrium search ⋮ An ant colony optimization approach for the multidimensional knapsack problem ⋮ Memory and Learning in Metaheuristics ⋮ An efficient tabu search approach for the 0-1 multidimensional knapsack problem ⋮ The multidimensional 0-1 knapsack problem -- bounds and computational aspects

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Optimization by Simulated Annealing
• Correlated and uncorrelated fitness landscapes and how to tell the difference
• ``Neural computation of decisions in optimization problems
• Probabilistic asymptotic properties of some combinatorial optimization problems
• On the stability of the travelling salesman problem algorithm of Hopfield and Tank
• Tabu search techniques. A tutorial and an application to neural networks
• The parallel genetic algorithm as function optimizer
• An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem
• Simulated annealing and tabu search in the long run: A comparison on QAP tasks
• Bounding the probability of success of stochastic methods for global optimization
• Dynamic tabu list management using the reverse elimination method
• Hashing vectors for tabu search
• Tabu Search—Part I
• Tabu Search—Part II
• The Reactive Tabu Search

This page was built for publication: Local search with memory: Benchmarking RTS