J. of Global Optimization, vol. 48, pp. 289-310, 2010
ABSTRACTGlobal optimization seeks a minimum or maximum of a multimodal function over a discrete or continuous domain. In this paper, we propose a hybrid heuristic - based on the CGRASP and GENCAN methods - for finding approximate solutions for continuous global optimization problems subject to box constraints. Experimental results illustrate the relative effectiveness of CGRASP-GENCAN on a set of benchmark multimodal test functions.
PDF file of full paper
Mauricio G.C. Resende's Home PageLast modified: 21 September 2010