Local search with memory: Benchmarking RTS

DOI10.1007/BF01719249zbMATH Open0843.90094MaRDI QIDQ1908991FDOQ1908991

Roberto Battiti, Giampietro Tecchiolli

Publication date: 7 March 1996

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

Recommendations

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

zbMATH Keywords

simulated annealinggenetic algorithmsneural networksmultiknapsack problemreactive tabu search methodrepeated local minima search

Mathematics Subject Classification ID

Combinatorial optimization (90C27)

Cites Work

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

Cited In (13)

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

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)