Skip to main content

Advertisement

SpringerLink
Log in

Analyzing the Simple Ranking and Selection Process for Constrained Evolutionary Optimization

  • Regular Paper
  • Published:
Journal of Computer Science and Technology Aims and scope Submit manuscript

Abstract

Many optimization problems that involve practical applications have functional constraints, and some of these constraints are active, meaning that they prevent any solution from improving the objective function value to the one that is better than any solution lying beyond the constraint limits. Therefore, the optimal solution usually lies on the boundary of the feasible region. In order to converge faster when solving such problems, a new ranking and selection scheme is introduced which exploits this feature of constrained problems. In conjunction with selection, a new crossover method is also presented based on three parents. When comparing the results of this new algorithm with six other evolutionary based methods, using 12 benchmark problems from the literature, it shows very encouraging performance. T-tests have been applied in this research to show if there is any statistically significance differences between the algorithms. A study has also been carried out in order to show the effect of each component of the proposed algorithm.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Mezura-Montes E, Coello C A C. A simple multimembered evolution strategy to solve constrained optimization problems. IEEE Trans. Evolutionary Computation, 2005, 9(1): 1–17.

    Article  Google Scholar 

  2. Barbosa H J C, Lemonge A C C. A new adaptive penalty scheme for genetic algorithms. Inf. Sci., 2003, 156(3): 215–251.

    Article  MathSciNet  Google Scholar 

  3. Deb K. An efficient constraint handling method for genetic algorithms. Computer Methods in Applied Mechanics and Engineering, 2000, 186(2–4): 311–338.

    Article  MATH  Google Scholar 

  4. Koziel S, Michalewicz Z. Evolutionary algorithms, homomorphous mappings, and constrained parameter optimization. Evolutionary Computation, 1999, 7(1): 19–44.

    Google Scholar 

  5. Farmani R, Wright J A. Self-adaptive fitness formulation for constrained optimization. IEEE Transactions on Evolutionary Computation, 2003, 7(5): 445–455.

    Article  Google Scholar 

  6. Venkatraman S, Yen G G. A generic framework for constrained optimization using genetic algorithms. IEEE Transactions on Evolutionary Computation, 2005, 9(4): 424–435.

    Article  Google Scholar 

  7. Runarsson T P, Yao X. Stochastic ranking for constrained evolutionary optimization. IEEE Transactions on Evolutionary Computation, 2000, 4(3): 284.

    Article  Google Scholar 

  8. Michalewicz Z. Genetic algorithms, numerical optimization, and constraints. In Proc. 6th International Conference on Genetic Algorithms, San Francisco, CA, 1995, pp.151–158.

  9. Sarker R, Kamruzzaman J, Newton C. Evolutionary optimization (EvOpt): A brief review and analysis. International Journal of Computational Intelligence and Applications, 2003, 3(4): 311–330.

    Article  Google Scholar 

  10. Eiben A E, Raué P E, Ruttkay Z. Genetic algorithms with multi-parent recombination. In Proc. 3rd Conference on Parallel Problem Solving from Nature, Jerusalem, 1994, pp.78–87.

  11. Michalewicz Z. Genetic Algorithms + Data Structures = Evolution Programs. 3rd Rev. and Extended Ed, Berlin; New York: Springer-Verlag, 1996.

    Google Scholar 

  12. Zhao X, Gao X S, Hu Z. Evolutionary programming based on non-uniform mutation. MMRC, AMSS, Chinese Academy of Sciences, Beijing, China, December 2004, No.23, pp.352–374.

  13. Sarker R, Newton C. A comparative study of different penalty function-based GAs for constrained optimization. In Proc. the 4th Australia-Japan Joint Workshop on Intelligent and Evolutionary Systems, Japan, 2000.

  14. Runarsson T P, Yao X. Search biases in constrained evolutionary optimization. IEEE Transactions on Systems, Man and Cybernetics, Part C: Applications and Reviews, 2005, 35(2): 233–243.

    Article  Google Scholar 

  15. Elfeky E Z, Sarker R A, Essam D L. A simple ranking and selection for constrained evolutionary optimization. In Proc. 6th International Conf. Simulated Evolution and Learning, Hefei, China, 2006, pp.537–544.

  16. Floudas C A, Pardalos P M. A collection of test problems for constrained global optimization algorithms. Lecture Notes in Computer Science, vol. 455. Berlin: Springer-Verlag, 1990.

    Google Scholar 

  17. Michalewicz Z, Nazhiyath G, Michalewicz M. A note on usefulness of geometrical crossover for numerical optimization problems. In Proc. 5th Annual Conference on Evolutionary Programming, San Diego, CA, 1996, pp.305–312.

  18. Himmelblau D M. Applied Nonlinear Programming. New York: McGraw-Hill, 1972.

    MATH  Google Scholar 

  19. Hock W, Schittkowski K. Text Examples for Nonlinear Programming Codes. New York: Springer-Verlag, 1981.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information Technology and Electrical Engineering, University of New South Wales, ADFA Campus, Canberra, 2600, Australia

    Ehab Z. Elfeky, Ruhul A. Sarker & Daryl L. Essam

Authors
  1. Ehab Z. Elfeky
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ruhul A. Sarker
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Daryl L. Essam
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Ehab Z. Elfeky.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Elfeky, E.Z., Sarker, R.A. & Essam, D.L. Analyzing the Simple Ranking and Selection Process for Constrained Evolutionary Optimization. J. Comput. Sci. Technol. 23, 19–34 (2008). https://doi.org/10.1007/s11390-008-9109-z

Download citation

  • Revised:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11390-008-9109-z

Keywords

Search

Navigation