Abstract
Several papers in the scientific literature use metaheuristics to solve continuous global optimization. To perform this task, some metaheuristics originally proposed for solving combinatorial optimization problems, such as Greedy Randomized Adaptive Search Procedure (GRASP), Tabu Search and Simulated Annealing, among others, have been adapted to solve continuous global optimization problems. Proposed by Hirsch et al., the Continuous-GRASP (C-GRASP) is one example of this group of metaheuristics. The C-GRASP is an adaptation of GRASP proposed to solve continuous global optimization problems under box constraints. It is simple to implement, derivative-free and widely applicable method. However, according to Hedar, due to its random construction, C-GRASP may fail to detect promising search directions especially in the vicinity of minima, which may result in a slow convergence. To minimize this problem, in this paper we propose a set of methods to direct the search on C-GRASP, called Directed Continuous-GRASP (DC-GRASP). The proposal is to combine the ability of C-GRASP to diversify the search over the space with some efficient local search strategies to accelerate its convergence. We compare the DC-GRASP with the C-GRASP and other metaheuristics from literature on a set of standard test problems whose global minima are known. Computational results show the effectiveness and efficiency of the proposed methods, as well as their ability to accelerate the convergence of the C-GRASP.
Similar content being viewed by others
Notes
We also tried to compare with New C-GRASP solution, but our implementation of New C-GRASP did not reproduce the results presented in the Hirsch et al. work (Hirsch et al. 2010). For some functions, we did not even found a solution.
References
Aiex, R.M., Resende, M.G.C., Ribeiro, C.C.: Tttplots: a perl program to create time-to-target plots. In: AT&T Labs Research Technical Report: TD-6HT7EL. http://www2.research.att.com/mgcr/tttplots (2005). Acessed 10 January 2014
Battiti, R., Tecchiolli, G.: Parallel biased search for combinatorial optimization: genetic algorithms and TABU. Microproc. Microsyst. 16, 365–367 (1992)
Battiti, R., Tecchiolli, G.: The reactive tabu search. ORSA J. Comput. 6, 26–140 (1994)
Battiti, R., Tecchiolli, G.: The continuous reactive tabu search: blending combinatorial optimization and stochastic search for global optimization. Ann. Oper. Res. 63, 153–188 (1996)
Bazarra, M.S., Sherali, H.D., Shetty, C.M.: Nonlinear Programming: Theory and Algorithms, 2nd edn. Wiley, New York (1989)
Feo, T.A., Resende, M.G.C.: Greedy randomized adaptive search procedures. J. Glob. Optim. 6, 109–133 (1995)
Festa, P., Resende, M.G.C.: GRASP: an annotated bibliography. In: Ribeiro, C.C., Hansen, P. (eds.) Essays and Surveys on Metaheuristics, pp. 325–367. Kluwer Academic Publishers, Boston (2002)
Festa, P., Resende, M.G.C.: An annotated bibliography of GRASP—part I: algorithms. Int. Trans. Oper. Res. 16(1), 1–24 (2009a)
Festa, P., Resende, M.G.C.: An annotated bibliography of GRASP—part I: applications. Int. Trans. Oper. Res. 16(2), 131–172 (2009b)
Hedar, A.R.: Studies on Metaheuristics for Continuous Global Optimization Problems. Kyoto, Japan, [Ph.D. thesis]. University Kyoto, Kyoto (2004), 148 pp
Hedar, A.R., Fukushima, M.: Minimizing multimodal functions by simplex coding genetic algorithms. Optim. Methods Softw. 18, 265–282 (2003)
Hedar, A.R., Fukushima, M.: Heuristic pattern search and its hybridization with simulated annealing for nonlinear global optimization. Optim. Methods Softw. 19, 291–308 (2004)
Hedar, A.R., Fukushima, M.: Tabu search directed by direct search methods for nonlinear global optimization. Eur. J. Oper. Res. 170, 329–349 (2006)
Hirsch, M.J., Meneses, C.N., Pardalos, P.M., Resende, M.G.C.: Global optimization by continuous GRASP. Optim. Lett. 1, 201–212 (2007)
Hirsch, M.J., Meneses, C.N., Pardalos, P.M., Ragle, M., Resende, M.G.C.: A continuous GRASP to determine the relationship between drugs and adverse reactions. In: Data Mining, Systems Analysis e Optimization in Medicine. AIP Conference Proceedings, vol. 952, pp. 106–121 (2008)
Hirsch, M.J., Pardalos, P.M., Resende, M.G.C.: Speeding up continuous GRASP. Eur. J. Oper. Res. 205, 507–521 (2010)
Laguna, M., Martí, R.: Experimental testing of advanced Scatter Search designs for global optimization of multimodal functions. J. Glob. Optim. 33, 235–255 (2005)
Liu, D.C., Nocedal, J.: On the limited memory method for large scale optimization. Math. Progr. 45, 503–528 (1989)
L-BFGS algorithm for multivariate optimization. http://www.alglib.net/optimization/lbfgs.php. Accessed on 7 April 2011
Matsumoto, M., Nishimura, T.: Mersenne twister: a 623-dimensionally equidistributed uniform pseudo-random number generator. ACM Trans. Model. Comput. Simul. 8, 3–30 (1998)
Michalewicz, Z., Nazhiyath, G.: Genocop III: A co-evolutionary algorithm for numerical optimization problems with nonlinear constraints. In: IEEE International Conference on Artificial on Evolutionary Computation, Australia. Proceedings of IEEE International Conference on Evolutionary Computation. IEEE Press, vol. 1, pp. 647–651 (1995)
Mladenović, N., Dražić, M., Kovačevic-Vujčić, V., Čangalović, M.: General variable neighborhood search for the continuous optimization. Eur. J. Oper. Res. 191, 753–770 (2008)
Nocedal, J.: Updating Quasi-Newton Matrices with Limited Storage. Math. Comput. 35, 773–782 (1980)
Socha, K., Dorigo, M.: Ant colony optimization for continuous domains. Eur. J. Oper. Res. 185, 1155–1173 (2008)
Suganthan, P.N., Hansen, N., Liang, J.J., Deb, K., Chen, Y.P., Auger, A., Tiwari, S.: Problem definitions and evaluation criteria for the CEC 2005 special session on real parameter optimization. Technical Report (2005)
Xavier-de-Souza, S., Suykens, J.A.K., Vandewalle, J., Bollé, D.: Coupled Simulated Annealing. IEEE Trans. Syst. Man Cybern. Part B: Cybern. 40, 320–335 (2010)
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
de Araújo, T.M.U., Andrade, L.M.M.S., Magno, C. et al. DC-GRASP: directing the search on continuous-GRASP. J Heuristics 22, 365–382 (2016). https://doi.org/10.1007/s10732-014-9278-6
Received:
Revised:
Accepted:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s10732-014-9278-6