Skip to main content
SpringerLink
Log in

Hybrid interior-lagrangian penalty based evolutionary optimization

  • Conference paper
  • First Online:
Evolutionary Programming VII (EP 1998)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1447))

Included in the following conference series:

Abstract

An evolutionary optimization method based on a hybrid penalty function is proposed for the general constrained optimization problem. As an extension of the earlier method of Evolian (evolutionary optimization based on Lagrangian), the difference comes in the form of the penalty function. The hybrid of an interior penalty and augmented Lagrangian function ensures the generation of feasible solutions during the evolutionary search process with less computation time than required by the interior method. Some numerical results indicate the effectiveness of the hybrid penalty method on several optimization problems.

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. G. N. Vanderplaats, Numerical Optimization Techniques for Engineering Design. McGraw-Hill Inc., 1984.

    Google Scholar 

  2. Z. Michalewicz, “A survey of constraint handling techniques in evolutionary computation methods,” in Proc. of the Fourth Annual Conference on Evolutionary Programming (J. R. McDonnell, R. G. Reynolds, and D. B. Fogel, eds.), (Cambridge, MA), pp. 135–155, MIT Press, 1995.

    Google Scholar 

  3. Z. Michalewicz, “Genetic algorithms, numerical optimization, and constraints,” in Proc. of the Sixth International Conference on Genetic Algorithms (L. J. Eshelman, ed.), (Los Altos, CA), pp. 151–158, Morgan Kaufmann, 1995.

    Google Scholar 

  4. Z. Michalewicz and N. Attia, “Evolutionary optimization of constrained problems,” in Proc. of the Third Annual Conference on Evolutionary Programming (A. V. Sebald and L. J. Fogel, eds.), (River Edge, NJ), pp. 98–108, World Scientific, 1994.

    Google Scholar 

  5. A. S. Homaifar, H.-Y. Lai, and X. Qi, “Constrained optimization via genetic algorithms,” Simulation, vol. 62, pp. 242–254, 1994.

    Google Scholar 

  6. D. Powell and M. M. Skolnick, “Using genetic algorithms in engineering design optimization with non-linear constraints,” in Proc. of the Fifth International Conference on Genetic Algorithms (S. Forrest, ed.), (Los Altos, CA), pp. 424–430, Morgan Kaufmann, 1993.

    Google Scholar 

  7. M. Schoenauer and S. Xanthakis, “Constrained GA optimization,” in Proc. of the Fifth International Conference on Genetic Algorithms (S. Forrest, ed.), (Los Altos, CA), pp. 573–580, Morgan Kaufmann, 1993.

    Google Scholar 

  8. H. Myung and J.-H. Kim, “Hybrid evolutionary programming for heavily constrained problems,” BioSystems, vol. 38, pp. 29–43, 1996.

    Google Scholar 

  9. J.-H. Kim and H. Myung, “Evolutionary programming techniques for constrained optimization problems,” IEEE Trans. on Evolutionary Computation, vol. 1, pp. 129–140, July 1997.

    Google Scholar 

  10. H. Myung and J.-H. Kim, “Evolian: Evolutionary optimization based on lagrangian with constraint scaling,” in Proc. of the Sixth Annual Conference on Evolutionary Programming/ Lecture Notes on Computer Science (LNCS) 1213 (P. J. Angeline, R. G. Reynolds, J. R. McDonnell, and R. Eberhart, eds.), (Indianapolis, USA), pp. 177–188, Springer-Verlag, April 1997.

    Google Scholar 

  11. D. G. Luenberger, Introduction to Linear and Nonliner Programmin. Reading, MA: Addison-Wesley, 1973.

    Google Scholar 

  12. D. P. Bertsekas, Constrained Optimization and Lagrange Multiplier Methods. New York: Academic Press, 1982.

    Google Scholar 

  13. D. B. Fogel, Evolutionary Computation: Toward a New Philosophy of Machine Intelligence. Piscataway, NJ: IEEE Press, 1995.

    Google Scholar 

  14. T. Bäck, Evolutionary Algorithms in Theory and Practice. New York: Oxford University Press, 1996.

    Google Scholar 

  15. J.-H. Kim and H. Myung, “A two-phase evolutionary programming for general constrained optimization problem,” in Proc. of the Fifth Annual Conference on Evolutionary Programming (L. J. Fogel, P. J. Angeline, and T. Bäck, eds.), (Cambridge, MA), pp. 295–304, MIT Press, 1996.

    Google Scholar 

  16. Z. Michalewicz, Genetic Algorithms + Data Structures = Evolution Programs. Berlin: Springer-Verlag, 1996. Third, Revised and Extended Edition.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of EE, KAIST, 373-1 Kusong-dong, Yusong-gu, 305-701, Taejon, Korea

    Hyun Myung & Jong-Hwan Kim

Authors
  1. Hyun Myung
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jong-Hwan Kim
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

V. W. Porto N. Saravanan D. Waagen A. E. Eiben

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Myung, H., Kim, JH. (1998). Hybrid interior-lagrangian penalty based evolutionary optimization. In: Porto, V.W., Saravanan, N., Waagen, D., Eiben, A.E. (eds) Evolutionary Programming VII. EP 1998. Lecture Notes in Computer Science, vol 1447. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0040762

Download citation

  • DOI: https://doi.org/10.1007/BFb0040762

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64891-8

  • Online ISBN: 978-3-540-68515-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation