A stochastic local search algorithm for constrained continuous global optimization
This paper presents a new stochastic local search algorithm known as feasible–infeasible search procedure (FISP) for constrained continuous global optimization. The proposed procedure uses metaheuristic strategies for combinatorial optimization as well as combined strategies for exploring continuous...
Saved in:
Published in | International transactions in operational research Vol. 19; no. 6; pp. 825 - 846 |
---|---|
Main Authors | , , |
Format | Journal Article |
Language | English |
Published |
Oxford
Blackwell Publishing Ltd
01.11.2012
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | This paper presents a new stochastic local search algorithm known as feasible–infeasible search procedure (FISP) for constrained continuous global optimization. The proposed procedure uses metaheuristic strategies for combinatorial optimization as well as combined strategies for exploring continuous spaces, which are applied to an efficient process in increasingly refined neighborhoods of current points. We show effectiveness and efficiency of the proposed procedure on a standard set of 13 well‐known test problems. Furthermore, we compare the performance of FISP with SNOPT (sparse nonlinear optimizer) and with few successful existing stochastic algorithms on the same set of test problems. |
---|---|
Bibliography: | ArticleID:ITOR854 istex:607EC671461C97B6D9EF86C9E849896C53B75CA9 ark:/67375/WNG-VTNB5LLT-W CNPq - No. 303097/2008-6; No. 307071/2008-1 FAPERJ/CNPq through PRONEX-Optimization |
ISSN: | 0969-6016 1475-3995 |
DOI: | 10.1111/j.1475-3995.2012.00854.x |