Derivative-Free Filter Simulated Annealing Method for Constrained Continuous Global Optimization

In this paper, a simulated-annealing-based method called Filter Simulated Annealing (FSA) method is proposed to deal with the constrained global optimization problem. The considered problem is reformulated so as to take the form of optimizing two functions, the objective function and the constraint violation function. Then, the FSA method is applied to solve the reformulated problem. The FSA method invokes a multi-start diversification scheme in order to achieve an efficient exploration process. To deal with the considered problem, a filter-set-based procedure is built in the FSA structure. Finally, an intensification scheme is applied as a final stage of the proposed method in order to overcome the slow convergence of SA-based methods. The computational results obtained by the FSA method are promising and show a superior performance of the proposed method, which is a point-to-point method, against population-based methods.

[1]  Masao Fukushima,et al.  Minimizing multimodal functions by simplex coding genetic algorithm , 2003, Optim. Methods Softw..

[2]  K. Deb.  An Efficient Constraint Handling Method for Genetic Algorithms , 2000 .

[3]  Carlos Artemio Coello-Coello,et al.  Theoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art , 2002 .

[4]  Tao Wang,et al.  Tuning Strategies in Constrained Simulated Annealing for Nonlinear Global Optimization , 2000, Int. J. Artif. Intell. Tools.

[5]  Masao Fukushima,et al.  Heuristic pattern search and its hybridization with simulated annealing for nonlinear global optimization , 2004, Optim. Methods Softw..

[6]  Emile H. L. Aarts,et al.  Simulated Annealing: Theory and Applications , 1987, Mathematics and Its Applications.

[7]  Masao Fukushima,et al.  Tabu Search directed by direct search methods for nonlinear global optimization , 2006, Eur. J. Oper. Res..

[8]  Carl Tim Kelley,et al.  Iterative methods for optimization , 1999, Frontiers in applied mathematics.

[9]  Der-San Chen,et al.  Continuous optimization by a variant of simulated annealing , 1996, Comput. Optim. Appl..

[10]  Zbigniew Michalewicz,et al.  Evolutionary Algorithms for Constrained Parameter Optimization Problems , 1996, Evolutionary Computation.

[11]  Rafael Martí,et al.  Scatter Search: Diseño Básico y Estrategias avanzadas , 2002, Inteligencia Artif..

[12]  John A. Nelder,et al.  A Simplex Method for Function Minimization , 1965, Comput. J..

[13]  Yixin Chen,et al.  OPTIMAL ANYTIME SEARCH FOR CONSTRAINED NONLINEAR PROGRAMMING , 2001 .

[14]  Carlos A. Coello Coello,et al.  THEORETICAL AND NUMERICAL CONSTRAINT-HANDLING TECHNIQUES USED WITH EVOLUTIONARY ALGORITHMS: A SURVEY OF THE STATE OF THE ART , 2002 .

[15]  Carlos F. Torres,et al.  Global Optimization of Gas Allocation to a Group of Wells in Artificial Lift Using Nonlinear Constrained Programming , 2002 .

[16]  Yixin Chen,et al.  Optimal Anytime Constrained Simulated Annealing for Constrained Global Optimization , 2000, CP.

[17]  Sven Leyffer,et al.  Nonlinear programming without a penalty function , 2002, Math. Program..

[18]  Masao Fukushima,et al.  Hybrid simulated annealing and direct search method for nonlinear unconstrained global optimization , 2002, Optim. Methods Softw..

[19]  Marc Schoenauer,et al.  ASCHEA: new results using adaptive segregational constraint handling , 2002, Proceedings of the 2002 Congress on Evolutionary Computation. CEC'02 (Cat. No.02TH8600).

[20]  Charles Audet,et al.  A Pattern Search Filter Method for Nonlinear Programming without Derivatives , 2001, SIAM J. Optim..

[21]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[22]  D. Balmer.  Theoretical and Computational Aspects of Simulated Annealing , 1991 .

[23]  Carlos A. Coello Coello,et al.  Constraint-handling in genetic algorithms through the use of dominance-based tournament selection , 2002, Adv. Eng. Informatics.

[24]  Klaus Schittkowski,et al.  More test examples for nonlinear programming codes , 1981 .

[25]  Robert L. Smith,et al.  Simulated annealing for constrained global optimization , 1994, J. Glob. Optim..

[26]  Zbigniew Michalewicz,et al.  Evolutionary Algorithms, Homomorphous Mappings, and Constrained Parameter Optimization , 1999, Evolutionary Computation.

[27]  Xin Yao,et al.  Stochastic ranking for constrained evolutionary optimization , 2000, IEEE Trans. Evol. Comput..

[28]  C. T. Kelley,et al.  Detection and Remediation of Stagnation in the Nelder--Mead Algorithm Using a Sufficient Decrease Condition , 1999, SIAM J. Optim..

[29]  Klaus Schittkowski,et al.  Test examples for nonlinear programming codes , 1980 .

[30]  Rafael Martí,et al.  Experimental Testing of Advanced Scatter Search Designs for Global Optimization of Multimodal Functions , 2005, J. Glob. Optim..

[31]  Emile H. L. Aarts,et al.  Selected Topics in Simulated Annealing , 2002 .

[32]  F. Schoen.  TWO-PHASE METHODS FOR GLOBAL OPTIMIZATION , 2002 .

[33]  Rafael Martí.  Multi-Start Methods , 2003, Handbook of Metaheuristics.

[34]  Carlos A. Coello Coello,et al.  A simple multimembered evolution strategy to solve constrained optimization problems , 2005, IEEE Transactions on Evolutionary Computation.