A Global Stochastic Optimization Method for Large Scale Problems

W. El Alem; A. El Hami; R. Ellaia

Mathematical Modelling of Natural Phenomena (2010)

  • Volume: 5, Issue: 7, page 97-102
  • ISSN: 0973-5348

Abstract

top
In this paper, a new hybrid simulated annealing algorithm for constrained global optimization is proposed. We have developed a stochastic algorithm called ASAPSPSA that uses Adaptive Simulated Annealing algorithm (ASA). ASA is a series of modifications to the basic simulated annealing algorithm (SA) that gives the region containing the global solution of an objective function. In addition, Simultaneous Perturbation Stochastic Approximation (SPSA) method, for solving unconstrained optimization problems, is used to refine the solution. We also propose Penalty SPSA (PSPSA) for solving constrained optimization problems. The constraints are handled using exterior point penalty functions. The combination of both techniques ASA and PSPSA provides a powerful hybrid optimization method. The proposed method has a good balance between exploration and exploitation with very fast computation speed, its performance as a viable large scale optimization method is demonstrated by testing it on a number of benchmark functions with 2 - 500 dimensions. In addition, applicability of the algorithm on structural design was tested and successful results were obtained

How to cite

top

El Alem, W., El Hami, A., and Ellaia, R.. Taik, A., ed. "A Global Stochastic Optimization Method for Large Scale Problems." Mathematical Modelling of Natural Phenomena 5.7 (2010): 97-102. <http://eudml.org/doc/197674>.

@article{ElAlem2010,
abstract = {In this paper, a new hybrid simulated annealing algorithm for constrained global optimization is proposed. We have developed a stochastic algorithm called ASAPSPSA that uses Adaptive Simulated Annealing algorithm (ASA). ASA is a series of modifications to the basic simulated annealing algorithm (SA) that gives the region containing the global solution of an objective function. In addition, Simultaneous Perturbation Stochastic Approximation (SPSA) method, for solving unconstrained optimization problems, is used to refine the solution. We also propose Penalty SPSA (PSPSA) for solving constrained optimization problems. The constraints are handled using exterior point penalty functions. The combination of both techniques ASA and PSPSA provides a powerful hybrid optimization method. The proposed method has a good balance between exploration and exploitation with very fast computation speed, its performance as a viable large scale optimization method is demonstrated by testing it on a number of benchmark functions with 2 - 500 dimensions. In addition, applicability of the algorithm on structural design was tested and successful results were obtained},
author = {El Alem, W., El Hami, A., Ellaia, R.},
editor = {Taik, A.},
journal = {Mathematical Modelling of Natural Phenomena},
keywords = {global optimization; structural optimization; simultaneous perturbation stochastic approximation},
language = {eng},
month = {8},
number = {7},
pages = {97-102},
publisher = {EDP Sciences},
title = {A Global Stochastic Optimization Method for Large Scale Problems},
url = {http://eudml.org/doc/197674},
volume = {5},
year = {2010},
}

TY - JOUR
AU - El Alem, W.
AU - El Hami, A.
AU - Ellaia, R.
AU - Taik, A.
TI - A Global Stochastic Optimization Method for Large Scale Problems
JO - Mathematical Modelling of Natural Phenomena
DA - 2010/8//
PB - EDP Sciences
VL - 5
IS - 7
SP - 97
EP - 102
AB - In this paper, a new hybrid simulated annealing algorithm for constrained global optimization is proposed. We have developed a stochastic algorithm called ASAPSPSA that uses Adaptive Simulated Annealing algorithm (ASA). ASA is a series of modifications to the basic simulated annealing algorithm (SA) that gives the region containing the global solution of an objective function. In addition, Simultaneous Perturbation Stochastic Approximation (SPSA) method, for solving unconstrained optimization problems, is used to refine the solution. We also propose Penalty SPSA (PSPSA) for solving constrained optimization problems. The constraints are handled using exterior point penalty functions. The combination of both techniques ASA and PSPSA provides a powerful hybrid optimization method. The proposed method has a good balance between exploration and exploitation with very fast computation speed, its performance as a viable large scale optimization method is demonstrated by testing it on a number of benchmark functions with 2 - 500 dimensions. In addition, applicability of the algorithm on structural design was tested and successful results were obtained
LA - eng
KW - global optimization; structural optimization; simultaneous perturbation stochastic approximation
UR - http://eudml.org/doc/197674
ER -

References

top
  1. M. S. Arumugam, M. V. C. Rao, A. W. C. Tan. A novel and effective particle swarm optimization like algorithm with extrapolation technique. Applied Soft Computing, 9 (2009), No. 1, 308–320. 
  2. A. Georgieva, I. Jordanov. Global optimization based on novel heuristics, low-discrepancy sequences and genetic algorithms. European Journal of Operational Research, 196 (2009), 413-422. 
  3. W. Gong, Z. Cai, L. Jiang. Enhancing the performance of differential evolution using orthogonal design method. Applied Mathematics and Computation, 206 (2008), No. 1, 56–69. 
  4. Z. Huang, X. Miao, P. Wang. A revised cut-peak function method for box constrained continuous global optimization. Applied Mathematics and Computation194 (2007), No. 1, 224–233. 
  5. D. G. Luenberger. Introduction to linear and nonlinear programming. Addison Wesley, 1973.  
  6. S. Sitarz. Ant algorithms and simulated annealing for multicriteria dynamic programming. Computers and Operations Research, 36 (2009), No. 2, 433–441. 
  7. J. C. Spall. Multivariate stochastic approximation using a simultaneous perturbation gradient approximation. IEEE Transactions on Automatic Control, 37 (1992), No. 3, 332–341. 
  8. J. C. Spall. Adaptive stochastic approximation by the simultaneous perturbation method. IEEE Transactions on Automatic Control, 45 (2000), No. 10, 1839–1853. 
  9. PJM. Van Laarhoven, EHL. Aarts. Simulated annealing: theory and applications. Dordrecht: D. Reidel Publishing Company, Kluwer, 1987.  
  10. L. Wang, K. Chen, Y. S. Ong (Eds). Advances in Natural Computation. Part III, Springer Science & Business Publisher, Changsha, China, 2005.  
  11. C. Wang, Y. Yang, J. Li. A new filled function method for unconstrained global optimization. Journal of Computational and Applied Mathematics, 225 (2009), No. 1, 68–79. 
  12. Y. J. Wang, J. S. Zhang. An efficient algorithm for large scale global optimization of continuous functions. Journal of Computational and Applied Mathematics, 206 (2007), No. 2, 1015–1026. 

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.