Skip to main content

Part of the book series: SpringerBriefs in Applied Sciences and Technology ((BRIEFSINTELL))

  • 1160 Accesses

Abstract

Constraints can make a hard optimization problem even harder. They restrict the solution space to a feasible subspace.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. C.A. Coello Coello, Theoretical and numerical constraint handling techniques used with evolutionary algorithms: a survey of the state of the art. Comput. Methods Appl. Mech. Eng. 191(11–12), 1245–1287 (2002)

    Google Scholar 

  2. O. Kramer, Self-Adaptive Heuristics for Evolutionary Computation, Studies in Computational Intelligence (Springer, Heidelberg, 2008)

    Google Scholar 

  3. A. Kuri-Morales, C.V. Quezada, A universal eclectic genetic algorithm for constrained optimization, in Proceedings 6th European Congress on Intelligent Techniques and Soft Computing (EUFIT), (Aachen, Verlag Mainz, 1998), pp. 518–522

    Google Scholar 

  4. Z. Michalewicz, D.B. Fogel, How to Solve It: Modern Heuristics (Springer, Berlin, 2000)

    Book  MATH  Google Scholar 

  5. A. Fiacco, G. McCormick, The sequential unconstrained minimization technique for nonlinear programming—a primal-dual method. Mgmt. Sci. 10, 360–366 (1964)

    Article  Google Scholar 

  6. A. Homaifar, S.H.Y. Lai, X. Qi, Constrained optimization via genetic algorithms. Simulation 62(4), 242–254 (1994)

    Article  Google Scholar 

  7. J. Joines, C. Houck, On the use of non-stationary penalty functions to solve nonlinear constrained optimization problems with GAs, in Proceedings of the 1st IEEE Conference on Evolutionary Computation (IEEE Press, Orlando, 1994), pp. 579–584

    Google Scholar 

  8. R.G.L. Riche, C. Knopf-Lenoir, R.T. Haftka, A segregated genetic algorithm for constrained structural optimization, in Proceedings of the 6th International Conference on Genetic Algorithms (ICGA) (University of Pittsburgh, Morgan Kaufmann Publishers, San Francisco, 1995), pp. 558–565

    Google Scholar 

  9. J.C. Bean, A.B. Hadj-Alouane, A dual genetic algorithm for bounded integer programs. Technical report, University of Michigan, 1992

    Google Scholar 

  10. O. Kramer, Premature convergence in constrained continuous search spaces, in Proceedings of the 10th Conference on Parallel Problem Solving from Nature (PPSN), LNCS (Springer, Berlin, 2008), pp. 62–71

    Google Scholar 

  11. D.G. Krige, A statistical approach to some mine valuation and allied problems on the Witwatersrand. Master’s thesis. University of the Witwatersrand, South Africa, 1951

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Oliver Kramer .

Rights and permissions

Reprints and permissions

Copyright information

© 2014 The Author(s)

About this chapter

Cite this chapter

Kramer, O. (2014). Constraints. In: A Brief Introduction to Continuous Evolutionary Optimization. SpringerBriefs in Applied Sciences and Technology(). Springer, Cham. https://doi.org/10.1007/978-3-319-03422-5_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-03422-5_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-03421-8

  • Online ISBN: 978-3-319-03422-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics