Abstract
The problem of finding a global optimum of an unconstrained multimodal function has been the subject of intensive study in recent years, giving rise to valuable advances in solution methods. We examine this problem within the framework of adaptive memory programming (AMP), focusing particularly on AMP strategies that derive from an integration of Scatter Search and Tabu Search. Computational comparisons involving 16 leading methods for multimodal function optimization, performed on a testbed of 64 problems widely used to calibrate the performance of such methods, disclose that our new Scatter Tabu Search (STS) procedure is competitive with the state-of-the-art methods in terms of the average optimality gap achieved.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Addis, B., & Leyffer, S. (2006). A trust-region algorithm for global optimization. Computational Optimization and Applications, 35, 287–304.
Addis, B., Locatelli, M., & Schoen, F. (2005). Local optima smoothing for global optimization. Optimization Methods and Software, 20, 417–437.
Auger, A., & Hansen, N. (2005a). A restart CMA evolution strategy with increasing population size. In Proceedings of 2005 IEEE congress on evolutionary computation (CEC’2005) (pp. 1769–1776).
Auger, A., & Hansen, N. (2005b). Performance evaluation of an advanced local search evolutionary algorithm. In Proceedings of 2005 IEEE congress on evolutionary computation (CEC’2005) (pp. 1777–1784).
Avriel, M. (1976). Nonlinear programming, analysis and methods. Prentice-Hall: Englewood Cliffs.
Ballester, P. J., Stephenson, J., Carter, J. N., & Gallagher, K. (2005). Real-parameter optimization performance study on the CEC-2005 benchmark with SPC-PNX. In Proceedings of 2005 IEEE congress on evolutionary computation (CEC’2005) (pp. 498–505).
Chelouah, R., & Siarry, P. (2005). A hybrid method combining continuous tabu search and Nelder-Mead simplex algorithms for the global optimization of multiminima functions. European Journal of Operational Research, 161, 636–654.
García-Martínez, C., & Lozano, M. (2005). Hybrid real-coded genetic algorithms with female and male differentiation. In Proceedings of 2005 IEEE congress on evolutionary computation (CEC’2005) (pp. 896–903).
Glover, F. (1977). Heuristics for integer programming using surrogate constraints. Decision Sciences, 8, 156–166.
Glover, F. (1994). Tabu search for nonlinear and parametric optimization (with links to genetic algorithms). Discrete Applied Mathematics, 49, 231–255.
Glover, F. (1998). A template for scatter search and path relinking. In J. K. Hao, E. Lutton, E. Ronald, M. Schoenauer, & D. Snyers (Eds.), Lecture notes in computer science : Vol. 1363. Artificial evolution (pp. 13–54). Berlin: Springer.
Glover, F., & Laguna, M. (1997). Tabu search. Dordrecht: Kluwer Academic.
Glover, F., Kuo, C. C., & Dhir, K. S. (1998). Heuristic algorithms for the maximum diversity problem. Journal of Information and Optimization Sciences, 19(1), 109–132.
Glover, F., Laguna, M., & Martí, R. (2000). Fundamentals of scatter search and path relinking. Control and Cybernetics, 29(3), 653–684.
Hansen, N. (2006). Compilation of results on the 2005 CEC benchmark function set (Technical report). CoLAB Institute of Computational Sciences ETH, Zurich.
Hedar, A., & Fukushima, M. (2004). Heuristic pattern search and its hybridization with simulated annealing for nonlinear global optimization. Optimization Methods and Software, 19, 291–308.
Hedar, A., & Fukushima, M. (2006). Tabu search directed by direct search methods for nonlinear global optimization. European Journal of Operational Research, 170(2), 329–349.
Hirsch, M. J., Meneses, C. N., Pardalos, P. M., & Resende, M. G. C. (2007). Global optimization by continuous GRASP. Optimization Letters, 1(2), 201–212.
Huyer, W., & Neumaier, A. (1999). Global optimization by multilevel coordinate search. Journal of Global Optimization, 14, 331–355.
Hvattum, L.-M., & Glover, F. (2007). Finding local optima of high-dimensional functions using direct search methods. Research paper, Molde University College, Molde, Norway.
Johnson, D. S. (2001). A theoretician’s guide to the experimental analysis of algorithms. AT&T Labs Research. http://www.research.att.com/~dsj/.
Laguna, M., & Martí, R. (2003). Scatter search—methodology and implementations in C. Boston: Kluwer Academic.
Laguna, M., & Martí, R. (2005). Experimental testing of advanced scatter search designs for global optimization of multimodal functions. Journal of Global Optimization, 33, 235–255.
Leary, R. H. (2000). Global optimization on funneling landscapes. Journal of Global Optimization, 18(4), 367–383.
Liang, J. J., & Suganthan, P. N. (2005). Dynamic multi-swarm particle swarm optimizer with local search. In Proceedings of 2005 IEEE congress on evolutionary computation (CEC’2005) (pp. 522–528).
Michalewicz, Z. (1996). Genetic algorithms + data structures = evolution programs (3rd ed.). Berlin: Springer.
Molina, D., Herrera, F., & Lozano, M. (2005). Adaptive local search parameters for real-coded memetic algorithms. In Proceedings of 2005 IEEE congress on evolutionary computation (CEC’2005) (pp. 888–895).
Nelder, J. A., & Mead, R. (1965). A simplex method for function minimization. The Computer Journal, 7, 308–313.
Posik, P. (2005). Real-parameter optimization using the mutation step co-evolution. In Proceedings of 2005 IEEE congress on evolutionary computation (CEC’2005) (pp. 872–879).
Qin, A. K., & Suganthan, P. N. (2005). Self-adaptive differential evolution algorithm for numerical optimization. In Proceedings of 2005 IEEE congress on evolutionary computation (CEC’2005) (pp. 1785–1791).
Rego, C. (2005). RAMP: a new metaheuristic framework for combinatorial optimization. In C. Rego & B. Alidaee (Eds.), Metaheuristic optimization via memory and evolution: tabu search and scatter search (pp. 441–460). Dordrecht: Kluwer Academic.
Rego, C., & Alidaee, B. (2005). Metaheuristic optimization via memory and evolution. Boston: Kluwer Academic.
Resende, M. G. C., & Ribeiro, C. C. (2001). Greedy randomized adaptive search procedures. In F. Glover & G. Kochenberger (Eds.), State-of-the-art handbook in metaheuristics (pp. 219–250). Boston: Kluwer Academic.
Rönkkönen, J., Kukkonen, S., & Price, K. V. (2005). Real-parameter optimization with differential evolution. In Proceedings of 2005 IEEE congress on evolutionary computation (CEC’2005) (pp. 506–513).
Sinha, A., Tiwari, S., & Deb, K. (2005). A population-based, steady-state procedure for real-parameter optimization. In Proceedings of 2005 IEEE congress on evolutionary computation (CEC’2005) (pp. 514–521).
Suganthan, P. N., Hansen, N., Liang, J. J., Deb, K., Chen, Y.-P., Auger, A., & Tiwari, S. (2005). Problem definitions and evaluation criteria for the CEC 2005 special session on real-parameter optimization (Technical report). Nanyang technological university of Singapore.
Yuan, B., & Gallagher, M. (2005). Experimental results for the special session on real-parameter optimization at CEC 2005: a simple, continuous EDA. In Proceedings of 2005 IEEE congress on evolutionary computation (CEC’2005) (pp. 1792–1799).
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Duarte, A., Martí, R., Glover, F. et al. Hybrid scatter tabu search for unconstrained global optimization. Ann Oper Res 183, 95–123 (2011). https://doi.org/10.1007/s10479-009-0596-2
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10479-009-0596-2