An Improved Tabu Search (ITS) Algorithm Based on Open Cover Theory for Global Extremums

Authors:
Kemal Yüksek;Serhat Cakaloglu
Affiliations:
Department of Computer Engineering, Istanbul Kultur University, Istanbul, Turkiye;Department of Computer Engineering, Istanbul Kultur University, Istanbul, Turkiye
Venue:
MLDM '09 Proceedings of the 6th International Conference on Machine Learning and Data Mining in Pattern Recognition
Year:
2009

Citing 6
Cited 0

Applying tabu search to the job-shop scheduling problem

Annals of Operations Research - Special issue on Tabu search
Metastrategy simulated annealing and tabu search algorithms for the vehicle routing problem

Annals of Operations Research - Special issue on Tabu search
Tabu search

Modern heuristic techniques for combinatorial problems
Parallel Tabu Search for Real-Time Vehicle Routing and Dispatching

Transportation Science
A Simplex-Based Tabu Search Method for Capacitated Network Design

INFORMS Journal on Computing
A fast tabu search algorithm for the group shop scheduling problem

Advances in Engineering Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this study, a new improved Tabu Search (ITS) algorithm with an open-cover approach is presented for solving global optimization of multimodal functions which have continuous or discrete variables. The method uses open sets covering the wide domain of possible solutions which are constructed by a specific metric. Instead of dealing with individual elements, these special open sets are considered. To demonstrate the speed and memory effectiveness of ITS applied to continuous global optimization are tested in detail by using classical multimodal functions for which minima are known. It has been point out that, ITS collects both the advantages of Tabu Search and Genetic algorithms together. So, the speed, flexibility, applicability have been improved.