Abstract
An algorithm called Enhanced Continuous Tabu Search ECTS is proposed for the global optimization of multiminima functions. It results from an adaptation of combinatorial Tabu Search which aims to follow, as close as possible, Glover’s basic approach. In order to cover a wide domain of possible solutions, our algorithm first performs diversification: it locates the most promising areas, by fitting the size of the neighborhood structure to the objective function and its definition domain. When the most promising areas are located, the algorithm continues the search by intensification within one promising area of the solution space. The efficiency of ECTS is thoroughly tested by using a set of benchmark multimodal functions, of which global and local minima are known. ECTS is compared to other published versions of continuous Tabu Search and to some alternative algorithms like Simulated Annealing.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
R. Battiti and G. Tecchiolli, The reactive tabu search. ORSA J. Comput. 6, 126–140, 1994.
R. Battiti and G. Tecchiolli, The continuous reactive tabu search: Blending Combinatorial Optimization and Stochastic Search for Global Optimization. Ann. Oper. Res. 63, 53–188, 1996.
G.L. Bilbro and W.E. Snyder, Optimization of Functions with Many Minima. IEEE Trans. Syst. Man, and Cybernetics 21, 840–849, 1991.
D. Cvijovic and J. Klinowski, Taboo search. An approach to the Multiple Minima Problem. Science 661, 664–666, 1995.
L.C.W. Dixon and G.P. Szeg, Towards Global Optimization 2. North-Holland, Amsterdam, 1978.
F. Glover, Tabu search, Part I. ORSA J. Comput. 1, 190–206, 1989.
F. Glover, Tabu search, Part II. ORSA J. Comput. 2, 4–32, 1990.
N. Hu, Tabu search method with random moves for globally optimal design. Int. J. Numer. Methods in Eng. 35, 1055–1070, 1992.
K. Schittkowski and W. Hock, Test examples for nonlinear programming codes. Lecture Notes in Economics Math. Syst. 187, Springer, 1981.
K. Schittkowski and W. Hock, More test examples for nonlinear programming codes. Lecture Notes in Economics Math. Syst. 282, Springer, 1987.
P. Siarry and G. Berthiau, Fitting of tabu search to optimize functions of continuous variables. Int. J. Numer. Methods Eng. 40, 2449–2457, 1997.
P. Siarry, G. Berthiau, F. Durbin and J. Haussy, Enhanced simulated annealing for globally minimizing functions of many continuous variables. ACM Trans. Math. Software 23, 209–228, 1997.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1999 Springer Science+Business Media New York
About this chapter
Cite this chapter
Chelouah, R., Siarry, P. (1999). Enhanced Continuous Tabu Search: An Algorithm for Optimizing Multiminima Functions. In: Voß, S., Martello, S., Osman, I.H., Roucairol, C. (eds) Meta-Heuristics. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-5775-3_4
Download citation
DOI: https://doi.org/10.1007/978-1-4615-5775-3_4
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-7646-0
Online ISBN: 978-1-4615-5775-3
eBook Packages: Springer Book Archive