Shuffled complex evolution approach for effective and efficient global minimization

  • Q. Y. Duan
  • V. K. Gupta
  • S. Sorooshian
Contributed Papers

Abstract

The degree of difficulty in solving a global optimization problem is in general dependent on the dimensionality of the problem and certain characteristics of the objective function. This paper discusses five of these characteristics and presents a strategy for function optimization called the shuffled complex evolution (SCE) method, which promises to be robust, effective, and efficient for a broad class of problems. The SCE method is based on a synthesis of four concepts that have proved successful for global optimization: (a) combination of probabilistic and deterministic approaches; (b) clustering; (c) systematic evolution of a complex of points spanning the space, in the direction of global improvement; and (d) competitive evolution. Two algorithms based on the SCE method are presented. These algorithms are tested by running 100 randomly initiated trials on eight test problems of differing difficulty. The performance of the two algorithms is compared to that of the controlled random search CRS2 method presented by Price (1983, 1987) and to a multistart algorithm based on the simplex method presented by Nelder and Mead (1965).

Key Words

Numerical optimization global search efficiency effectiveness complex of points random search competitive evolution 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Dixon, L. C. W., andSzegö, G. P., Editors,Toward Global Optimization 2, North-Holland, Amsterdam, Holland, 1978.Google Scholar
  2. 2.
    Dixon, L. C. W., andSzegö, G. P.,The Global Optimization Problem: An Introduction, Toward Global Optimization 2, Edited by L. C. W. Dixon and G. P. Szegö, North-Holland, Amsterdam, Holland, pp. 1–15, 1978.Google Scholar
  3. 3.
    Torn, A., andZilinskas, A.,Global Optimization, Springer-Verlag, Berlin, Germany, 1989.Google Scholar
  4. 4.
    Sorooshian, S., Gupta, V. K., andFulton, J. L.,Evaluation of Maximum-Likelihood Parameter Estimation Techniques for Conceptual Rainfall-Runoff Models: Influence of Calibration Data Variability and Length on Model Credibility, Water Resources Research, Vol. 19, pp. 251–259, 1983.Google Scholar
  5. 5.
    Gupta, V. K., andSorooshian, S.,Uniqueness and Observability of Conceptual Rainfall-Runoff Model Parameters: The Percolation Process Examined, Water Resources Research, Vol. 19, pp. 269–276, 1983.Google Scholar
  6. 6.
    Gupta, V. K., andSorooshian, S.,The Automatic Calibration of Conceptual Catchment Models Using Derivative-Based Optimization Algorithms, Water Resources Research, Vol. 21, pp. 473–486, 1985.Google Scholar
  7. 7.
    Duan, Q., Sorooshian, S., andGupta, V. K.,Effective and Efficient Global Optimization for Conceptual Rainfall-Runoff Models, Water Resources Research, Vol. 28, pp. 1015–1031, 1992.Google Scholar
  8. 8.
    Gomulka, J.,Deterministic Versus Probabilistic Approaches to Global Optimization, Toward Global Optimization 2, Edited by L. C. W. Dixon and G. P. Szegö, North-Holland, Amsterdam, Holland, pp. 19–29, 1978.Google Scholar
  9. 9.
    Becker, R. W., andLago, G. V.,A Global Optimization Algorithm, Proceedings of the 8th Allerton Conference on Circuits and Systems Theory, Monticello, Illinois, pp. 3–12, 1970.Google Scholar
  10. 10.
    Törn, A.,A Search Clustering Approach to Global Optimization, Toward Global Optimization 2, Edited by L. C. W. Dixon and G. P. Szegö, North-Holland, Amsterdam, Holland, pp. 49–62, 1978.Google Scholar
  11. 11.
    Rinnooy-Kan, A. H. G., andTimmer, G. T.,Stochastic Global Optimization Methods, Part 1: Clustering Methods, Mathematical Programming, Vol. 39, pp. 27–56, 1987.Google Scholar
  12. 12.
    Price, W. L.,A Controlled Random Search Procedure for Global Optimization, Toward Global Optimization 2, Edited by L. C. W. Dixon and G. P. Szegö, North-Holland, Amsterdam, Holland, pp. 71–84, 1978.Google Scholar
  13. 13.
    Price, W. L.,Global Optimization by Controlled Random Search, Journal of Optimization Theory and Applications, Vol. 40, pp. 333–348, 1983.Google Scholar
  14. 14.
    Price, W. L.,Global Optimization Algorithms for a CAD Workstation, Journal of Optimization Theory and Applications, Vol. 55, pp. 133–146, 1987.Google Scholar
  15. 15.
    Holland, J. H.,Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, Michigan, 1975.Google Scholar
  16. 16.
    Nelder, J. A., andMead, R.,A Simplex Method for Function Minimization, Computer Journal, Vol. 7, pp. 308–313, 1965.Google Scholar

Copyright information

© Plenum Publishing Corporation 1993

Authors and Affiliations

  • Q. Y. Duan
    • 1
  • V. K. Gupta
    • 1
  • S. Sorooshian
    • 1
    • 2
  1. 1.Department of Hydrology and Water ResourcesThe University of ArizonaTucson
  2. 2.Department of Systems and Industrial EngineeringThe University of ArizonaTucson

Personalised recommendations