Multistart hooke and jeeves filter method for mixed variable optimization

In this study, we propose an extended version of the Hooke and Jeeves algorithm that uses a simple heuristic to handle integer and/or binary variables and a filter set methodology to handle constraints. This proposal is integrated into a multistart method as a local solver and it is repeatedly called in order to compute different optimal solutions. Then, the best of all stored optimal solutions is selected as the global optimum. The performance of the new method is tested on benchmark problems. Its effectiveness is emphasized by a comparison with other well-known stochastic solvers.This work was financed by FEDER funds through COMPETE (Operational Programme Thematic Factors of Competitiveness) and by portuguese funds through FCT (Foundation for Science and Technology) within the projects FCOMP-01-0124-FEDER-022674 and PEst-C/MAT/UI0013/2011