Skip to main content
SpringerLink
Log in

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

  • Published:
Journal of Global Optimization Aims and scope Submit manuscript

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. E. Aarts J. Korst (2000) Selected topics in simulated annealing C.C. Ribeiro P. Hansen (Eds) Essays and Surveys in Metaheuristics. Kluwer Academic Publishers Boston, MA

    Google Scholar 

  2. Audet, C. and Dennis Jr., J.E. (2004), A pattern search filter method for nonlinear programming without derivatives, SIAM Journal on Optimization (to appear).

  3. Chen, Y.X. (2001), Optimal anytime search for constrained nonlinear programming, M.Sc. Thesis, Department of Computer Science, University of Illinois.

  4. C.A. Coello Coello (2002) ArticleTitleTheoretical and numerical constraint-handling techniques used with evolutionary algorithms: a survey of the state of the art Computer Methods in Applied Mechanics and Engineering 191 1245–1287 Occurrence Handle10.1016/S0045-7825(01)00323-1

    Article  Google Scholar 

  5. C.A. Coello Coello E.M. Montes (2002) ArticleTitleConstraint-handling in genetic algorithms through the use of dominance-based tournament selection Advanced Engineering Informatics 16 193–203 Occurrence Handle10.1016/S1474-0346(02)00011-3

    Article  Google Scholar 

  6. K. Deb (2000) ArticleTitleAn efficient constraint handling method for genetic algorithms Computer Methods in Applied Mechanics and Engineering 186 311–338 Occurrence Handle10.1016/S0045-7825(99)00389-8

    Article  Google Scholar 

  7. R. Fletcher S. Leyffer (2002) ArticleTitleNonlinear programming without a penalty function Mathematical Programming 91 239–269 Occurrence Handle10.1007/s101070100244

    Article  Google Scholar 

  8. C.A. Floudas P.M. Pardalos C.S. Adjiman W.R. Esposito Z. Gumus S.T. Harding J.L. Klepeis C.A. Meyer C.A. Schweiger (Eds) (1999) Handbook of Test Problems for Local and Global Optimization Kluwer Academic Publishers Boston, MA

    Google Scholar 

  9. Hamida, S.B. and Schoenauer, M. (2002), ASCHEA: new rsults using adaptive segregational constraint handling, In: Proceedings of the Congress on Evolutionary Computation (CEC2002), Piscataway, New Jersey, IEEE Service Center, pp. 884–889.

  10. A. Hedar M. Fukushima (2002) ArticleTitleHybrid simulated annealing and direct search method for nonlinear unconstrained global optimization Optimization Methods and Software 17 891–912 Occurrence Handle10.1080/1055678021000030084

    Article  Google Scholar 

  11. A. Hedar M. Fukushima (2003) ArticleTitleMinimizing multimodal functions by simplex coding genetic algorithm Optimization Methods and Software 18 265–282 Occurrence Handle10.1080/1055678031000098773a

    Article  Google Scholar 

  12. A. Hedar M. Fukushima (2004) ArticleTitleHeuristic pattern search and its hybridization with simulated annealing for nonlinear global optimization Optimization Methods and Software 19 291–308 Occurrence Handle10.1080/10556780310001645189

    Article  Google Scholar 

  13. Hedar, A. and Fukushima, M. (2005), Tabu search directed by direct search methods for nonlinear global optimization, European Journal of Operational Research (to appear).

  14. W. Hock K. Schittkowski (1981) Test Examples for Nonlinear Programming Codes Springer-Verlag Berlin, Heidelberg

    Google Scholar 

  15. C.T. Kelley (1999) ArticleTitleDetection and remediation of stagnation in the Nelder–Mead algorithm using a sufficient decrease condition SIAM Journal on Optimization 10 43–55 Occurrence Handle10.1137/S1052623497315203

    Article  Google Scholar 

  16. C.T. Kelley (1999) Iterative Methods for Optimization SIAM Philadelphia, PA

    Google Scholar 

  17. S. Kirkpatrick C.D. Gelatt SuffixJr M.P. Vecchi (1983) ArticleTitleOptimisation by simulated annealing Science 220 671–680

    Google Scholar 

  18. S. Koziel Z. Michalewicz (1999) ArticleTitleEvolutionary algorithms, homomorphous mappings, and constrained parameter optimization Evolutionary Computation 7 IssueID1 19–44

    Google Scholar 

  19. P.J. Laarhoven (1988) Theoretical and Computational Aspects of Simulated Annealing Stichting Mathematisch Centrum Amsterdam

    Google Scholar 

  20. P.J. Laarhoven E.H. Aarts (1987) Simulated Annealing: Theory and Applications D. Reidel Publishing Company Dordrecht, Holland

    Google Scholar 

  21. Laguna, M. and Martí, R. (2002), Experimental testing of advanced scatter search designs for global optimization of multimodal functions, Journal of Global Optimization (to appear).

  22. M. Laguna R. Martí (2003) Scatter Search: Methodology and Implementations in C Kluwer Academic Publishers Boston

    Google Scholar 

  23. R. Martí (2002) Multi-start methods F. Glover G. Kochenberger (Eds) Handbook of MetaHeuristics. Kluwer Academic Publishers Boston, MA 355–368

    Google Scholar 

  24. R. Martí J.M. Moreno (2003) ArticleTitleMétodos multi-arranque Inteligencia Artificial 19 49–60

    Google Scholar 

  25. Montes, E.M. and Coello Coello, C.A. (2003), A simple multimembered evolution strategy to solve constrained optimization problems, Technical Report EVOCINV-04-2003, Evolutionary Computation Group at CINVESTAV, Sección de Computación, Departamento de Ingeniería Eléctrica, CINVESTAV-IPN, México D.F., México.

  26. Z. Michalewicz M. Schoenauer (1996) ArticleTitleEvolutionary algorithms for constrained parameter optimization problems Evolutionary Computation 4 IssueID1 1–32

    Google Scholar 

  27. J.A. Nelder R. Mead (1965) ArticleTitleA simplex method for function minimization The Computer Journal 7 308–313

    Google Scholar 

  28. H.E. Romeijn R.L. Smith (1994) ArticleTitleSimulated annealing for global constrained optimization Journal of Global Optimization 5 101–126 Occurrence Handle10.1007/BF01100688

    Article  Google Scholar 

  29. T.P. Runarsson X. Yao (2000) ArticleTitleStochastic ranking for constrained evolutionary optimization IEEE Transactions on Evolutionary Computation 4 IssueID3 284–294 Occurrence Handle10.1109/4235.873238

    Article  Google Scholar 

  30. F. Schoen (2002) Two phase methods for global optimization P.M. Pardalos H.E. Romeijn (Eds) Handbook of Global Optimization Kluwer Academic Publishers Boston, MA 151–178

    Google Scholar 

  31. Wah, B.W. and Chen, Y.X. (2000), Optimal anytime constrained simulated annealing for constrained global optimization, In: Dechter, R. (ed.), LNCS 1894, Springer-Verlag, pp. 425–440.

  32. B.W. Wah T. Wang (2000) ArticleTitleTuning strategies of constrained simulated annealing for nonlinear global optimization International Journal on Artificial Intelligence Tools 9 IssueID1 3–25 Occurrence Handle10.1142/S0218213000000033

    Article  Google Scholar 

  33. Wang, T. (2000), Global optimization of constrained nonlinear programming, Ph.D. Thesis, Department of Computer Science, University of Illinois.

  34. P.P. Wang D.S. Chen (1996) ArticleTitleContinuous optimization by a variant of simulated annealing Computational Optimization and Applications 6 59–71 Occurrence Handle10.1007/BF00248009

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Applied Mathematics and Physics, Graduate School of Informatics, Kyoto University, Kyoto, 606-8501, Japan

    Abdel-Rahman Hedar & Masao Fukushima

Authors
  1. Abdel-Rahman Hedar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Masao Fukushima
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Masao Fukushima.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Hedar, AR., Fukushima, M. Derivative-Free Filter Simulated Annealing Method for Constrained Continuous Global Optimization. J Glob Optim 35, 521–549 (2006). https://doi.org/10.1007/s10898-005-3693-z

Download citation

  • Received:

  • Accepted:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10898-005-3693-z

Keywords

Search

Navigation