Local Search with Memory : Benchmarking RTSRoberto
نویسندگان
چکیده
The purpose of this work is that of presenting a version of the Reactive Tabu Search method (RTS) that is suitable for constrained problems, and that of testing RTS on a series of constrained and unconstrained Combinatorial Optimization tasks. The benchmark suite consists of many instances of the N-K model and of the Multiknapsack problem with various sizes and diiculties, deened with portable random number generators. The performance of RTS is compared with that of Repeated Local Minima Search, Simulated Annealing, Genetic Algorithms, and Neural Networks. In addition, the eeects of diierent hashing schemes and of the presence of a simple \aspiration" criterion in the RTS algorithm are investigated.
منابع مشابه
Local Search with Memory: Benchmarking RTS
The purpose of this work is that of presenting a version of the Reactive Tabu Search method (RTS) that is suitable for constrained problems, and that of testing RTS on a series of constrained and unconstrained Combinatorial Optimization tasks. The benchmark suite consists of many instances of the N-K model and of the Knapsack problem with various sizes and difficulties, defined with portable ra...
متن کاملMultiple Sequence Alignment Using Tabu Search
Tabu search is a meta-heuristic approach that is found to be useful in solving combinatorial optimization problems. We implement the adaptive memory features of tabu search to align multiple sequences. Adaptive memory helps the search process to avoid local optima and explores the solution space economically and effectively without getting trapped into cycles. The algorithm is further enhanced ...
متن کاملPredicting Normal People’s Reaction Time based on Hippocampal Local Efficiency During a Memory-Guided Attention Task
Background: There are some convincing shreds of evidence indicating that memory can direct attention. The local efficiency of an area in the brain, as a quantitative feature in a complex network, indicates how the surrounding nodes can transfer the information when a specific node is omitted. This feature is a scale for measuring efficient integration of information in the brain. Objectives:...
متن کاملBenchmarking the (1,4)-CMA-ES With Mirrored Sampling and Sequential Selection on the Noisy BBOB-2010 Testbed [Black-Box Optimization Benchmarking Workshop]
The Covariance-Matrix-Adaptation Evolution-Strategy (CMA-ES) is a robust stochastic search algorithm for optimizing functions defined on a continuous search space R. Recently, mirrored samples and sequential selection have been introduced within CMA-ES to improve its local search performances. In this paper, we benchmark the (1,4m)CMA-ES which implements mirrored samples and sequential selectio...
متن کاملBenchmarking the (1,4)-CMA-ES With Mirrored Sampling and Sequential Selection on the Noiseless BBOB-2010 Testbed [Black-Box Optimization Benchmarking Workshop]
The well-known Covariance Matrix Adaptation Evolution Strategy (CMA-ES) is a robust stochastic search algorithm for optimizing functions defined on a continuous search space R. Recently, mirrored samples and sequential selection have been introduced within CMA-ES to improve its local search performances. In this paper, we benchmark the (1,4m)-CMA-ES which implements mirrored samples and sequent...
متن کامل