Local search with memory: Benchmarking RTS

DOI10.1007/BF01719249MaRDI QIDQ1908991zbMATH OpenFDO

Authors Roberto Battiti, Giampietro Tecchiolli

Publication date 7 March 1996

Published in OR Spektrum (Search for Journal in Brave)

zbMATH Keywords

simulated annealinggenetic algorithmsneural networksmultiknapsack problemreactive tabu search methodrepeated local minima search

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Recommendations

• The Reactive Tabu Search
• Tabu Search—Part I
• scientific article; zbMATH DE number 1054674
• Tabu Search—Part II

Cites work

• scientific article; zbMATH DE number 44282 (Why is no real title available?)
• scientific article; zbMATH DE number 41891 (Why is no real title available?)
• scientific article; zbMATH DE number 3473265 (Why is no real title available?)
• scientific article; zbMATH DE number 3497315 (Why is no real title available?)
• scientific article; zbMATH DE number 3639144 (Why is no real title available?)
• scientific article; zbMATH DE number 194544 (Why is no real title available?)
• An exact search for the solution of the surrogate dual of the 0-1 bidimensional knapsack problem
• Bounding the probability of success of stochastic methods for global optimization
• Correlated and uncorrelated fitness landscapes and how to tell the difference
• Dynamic tabu list management using the reverse elimination method
• Hashing vectors for tabu search
• On the stability of the travelling salesman problem algorithm of Hopfield and Tank
• Optimization by simulated annealing
• Probabilistic asymptotic properties of some combinatorial optimization problems
• Simulated annealing and tabu search in the long run: A comparison on QAP tasks
• Tabu Search—Part I
• Tabu Search—Part II
• Tabu search techniques. A tutorial and an application to neural networks
• The Reactive Tabu Search
• The parallel genetic algorithm as function optimizer
• ``Neural computation of decisions in optimization problems

Cited in

(14)

• Memory and learning in metaheuristics
• The multidimensional 0-1 knapsack problem: an overview.
• Reactive tabu search and sensor selection in active structural acoustic control problems
• Metaheuristics: A bibliography
• An ant colony optimization approach for the multidimensional knapsack problem
• An efficient tabu search approach for the 0-1 multidimensional knapsack problem
• The multidimensional 0-1 knapsack problem -- bounds and computational aspects
• Problems of discrete optimization: challenges and main approaches to solve them
• An analysis of parameter adaptation in reactive tabu search
• Simulated annealing and tabu search in the long run: A comparison on QAP tasks
• A Modified Binary Particle Swarm Optimization for Knapsack Problems
• 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
• The method of global equilibrium search

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

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