An evolutionary algorithm for single objective nonlinear constrained optimization problems

  • Hunter T. Albright
  • James P. Ignizio
Problem Structure and Fitness Landscapes
Part of the Lecture Notes in Computer Science book series (LNCS, volume 1305)


This paper presents research into an evolutionary algorithm that utilizes the coevolution of feasible and infeasible solutions in solving constrained optimization problems. The evolution of these populations occurs through the use of traditional and specially designed operators that allow for crossover to occur in each of the populations as well as across the two populations. The cross population crossover allows for the information contained in the infeasible solutions to be utilized in the search for the optimal solution.


Genetic Algorithm Feasible Solution Penalty Function Feasible Region Constrain Optimization Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    S.H.-Y. Lai A. Homaifar and X. Qi. Constrained optimization via genetic algorithms. Simulation, 62:242–254, 1994.Google Scholar
  2. 2.
    James C. Bean and Atidel Hadj-Alouane. A dual genetic algorithm for bounded integer programs. Technical report, Department of Industrial and Operations Engineering, The University of Michigan, 1992.Google Scholar
  3. 3.
    E. Brown. Using the Facility Location Problem to Explore Operator Policies and Constraint-Handling Methods for Genetic Algorithms. PhD thesis, University of Virginia, Charlottesville, VA, April 1996.Google Scholar
  4. 4.
    G.D. Camp. Inequality-constrained stationary-value problems. Operations Research, 3:548–550, 1955.Google Scholar
  5. 5.
    Susan E. Carlson and R. Shonkaöler. Annealing a genetic algorithm over constraints. 1995.Google Scholar
  6. 6.
    P.C. Chu and J.E. Beasley. A genetic algorithm for the set partitioning problem. 1995.Google Scholar
  7. 7.
    R. Courant. Calculus of variations and supplementary notes and exercises. Technical report, New York University, 1962.Google Scholar
  8. 8.
    A.V. Fiacco and G.P. McCormick. Computational algorithm for the sequential unconstrained minimization technique for nonlinear programming. Management Science, 10:601–617, 1964.Google Scholar
  9. 9.
    A.V. Fiacco and G.P. McCormick. Extentions of sumt for nonlinear programming: Equality constraints and extrapolation. Management Science, 12:816–828, 1966.Google Scholar
  10. 10.
    A.V. Fiacco and G.P. McCormick. The sequential unconstrained minimization technique (sumt), without parameters. Operations Research, 15:820–827, 1967.Google Scholar
  11. 11.
    A.V. Fiacco and G.P. McCormick. The slacked unconstrained minimization technique for convex programming. SIAM J. Applied Mathmematics, 15:505–515, 1967.Google Scholar
  12. 12.
    A.V. Fiacco and G.P. McCormick. Nonlinear Programming: Sequential Unconstrained Minimization Techniques. John Wiley and Sons, New York, 1968.Google Scholar
  13. 13.
    Atidel Hadj-Alouane and James C. Bean. A genetic algorithm for the multiple-choice integer program. Technical report, Department of Industrial and Operations Engineering, The University of Michigan, 1993.Google Scholar
  14. 14.
    John Holland. Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor, Michigan, 1975.Google Scholar
  15. 15.
    J.P. Ignizio. Introduction to Linear Goal Programming. Sage Publishing, Beverly Hills, CA, 1985.Google Scholar
  16. 16.
    J.A. Joines and C.R. Houch. On the use of non-stationary penalty functions to solve nonlinear constrained optimization problems with gas. In Proceedings of the Evolutionary Computation Conference-Poster Session, pages 579–584, Orlando, FL, June 1994. IEEE World Congress on Computational Intelligence.Google Scholar
  17. 17.
    Zbignew Micbalewdcz. A survey of constraint handling techniques in evolutionary computation methods. Found on the internet, 1995.Google Scholar
  18. 18.
    Zbignew Michalewicz and N. Attia. Evolutionary optimization of constrained problems. In A.V. Sebald and L.J. Fogel, editors, Proceedings of the 3rd Annual Conference on Evolutionary Programming, pages 98–109, River Edge. NJ, 1994. World Scientific Publishing.Google Scholar
  19. 19.
    Zbignew Michalewicz and Cezary Janikow. Handling constraints in genetic algorithms. In R.K. Belew and L.B. Booker, editors, Proceedings of the Fourth International Conference on Genetic Algorithms, pages 151–157, San Mateo, CA, 1991. Morgan Kaufmann.Google Scholar
  20. 20.
    J.A. Nelder and R. Mead. Computer Journal. 7:308–313, 1965.Google Scholar
  21. 21.
    J. Paredis. Co-evolutionary constraint satisfaction. In Proceedings of the 3rd Conference on Parallel Problem Solving from Nature, pages 46–55, New York, 1994. Springer-Verlag.Google Scholar
  22. 22.
    Nicholas J. Radcliffe Patrick D. Surry and Ian D. Boyd. A multi-objective approach to constrained optimization of gas supply networks: The comoga method. 1995.Google Scholar
  23. 23.
    T. Pietrgykowski. Application of the steepest descent method to concave programming. In Proceedings of International Federation of Information Processing Societies Congress, pages 185–189, Amsterdam, 1962. NorthHolland.Google Scholar
  24. 24.
    D. Powell and M.M. Skolnick. Using genetic algorithms in engineering design optimization with non-linear constraints. In Proceedings of the Fifth International Conference on Genetic Algorithms, pages 424–430, Los Altos, CA, 1993. Morgan Kaufmann Publishers.Google Scholar
  25. 25.
    Marc Schoenauer and Spyros Xanthakis. Constrained ga optimization. In S. Forrest, editor, Proceedings of the Fifth International Conference on Genetic Algorithms, pages 573–580, Los Altos, CA, 1993. Morgan Kaufmann.Google Scholar
  26. 26.
    William Vetterling William Press, Saul Teukolsky and Brain Flannery. Numerical Recipes in C: The Art of Scientific Computing. Cambridge University Press, New York, second edition, 1994.Google Scholar
  27. 27.
    W.I. Zangwill. Nonlinear programming via penalty functions. Management Science, 13:344–358, 1967.Google Scholar
  28. 28.
    W.I. Zangwill. Nonlinear Programming: A Unified Approach. Prentice-Hall, Englewood Cliffs, N.J., 1969.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1997

Authors and Affiliations

  • Hunter T. Albright
    • 1
  • James P. Ignizio
    • 1
  1. 1.Department of Systems EngineeringUniversity of VirginiaCharlottesville

Personalised recommendations