Future paths for integer programming and links to artificial intelligence
Computers and Operations Research - Special issue: Applications of integer programming
Adaptation in natural and artificial systems
Adaptation in natural and artificial systems
Modern heuristic techniques for combinatorial problems
An introduction to genetic algorithms
An introduction to genetic algorithms
P-Complete Approximation Problems
Journal of the ACM (JACM)
Fortran subroutines for computing approximate solutions of weighted MAX-SAT problems using GRASP
Discrete Applied Mathematics
Tabu Search
QAPLIB – A Quadratic Assignment ProblemLibrary
Journal of Global Optimization
| Hi-index | 0.00 |
We describe the Enhanced Evolutionary Tabu Search (EE-TS) local search technique. The EE-TS metaheuristic technique combines Reactive Tabu Search with evolutionary computing elements proven to work well in multimodal search spaces. An initial set of solutions is generated using a stochastic heuristic operator based on Restricted Candidate List. Reactive Tabu Search is augmented with selection and recombination operators that preserve common traits between solutions while maintaining a diverse set of good solutions. EE-TS performance is applied to the Quadratic Assignment Problem using problem instances from the QAPLIB. The results show that EE-TS compares favorably against other known techniques. In most cases, EE-TS was able to find the known optimal solutions in fewer iterations. We conclude by describing the main benefits and limitations of EE-TS.