Stochastic ranking for constrained evolutionary optimization

IEEE Transactions on Evolutionary Computation

Volumn 4, Issue 3, 2000, Pages 284-294

  Runarsson, Thomas P ^a   Yao, Xin ^b  

^a UNIVERSITY OF ICELAND   (Iceland)

^b UNIVERSITY OF BIRMINGHAM   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

CONSTRAINT THEORY; FUNCTIONS; MATHEMATICAL OPERATORS; OPTIMIZATION; RANDOM PROCESSES;

CONSTRAINED OPTIMIZATION; PENALTY FUNCTIONS;

NONLINEAR PROGRAMMING;

EID: 0034266683     PISSN: 1089778X     EISSN: None     Source Type: Journal    
DOI: 10.1109/4235.873238     Document Type: Article

References (24)

1. T. Bäck, Evolutionary Algorithms in Theory and Practice. New York: Oxford Univ. Press, 1996.
2. E. Camponogara and S. N. Talukdar, "A genetic algorithm for constrained and multiobjective optimization," in Proc. 3rd Nordic Workshop Genetic Algorithms and Their Appl. (3NWGA), J. T. Alander, Ed. Vaasa, Finland: Univ. Vaasa, Aug. 1997.
3. A. R. Colville, "A comparison study of nonlinear programming codes," in Princeton Symp. Math. Prog., H. W. Kuhn, Ed. Princeton, NJ: Princeton Univ. Press, 1970.
4. K. Deb, "An efficient constrained handling method for genetic algorithms," in Computer Methods in Applied Mechanics and Engineering, 1999.
5. A.V. Fiacco and G. P. McCormick, Nonlinear Programming: Sequential Unconstrained Minimization Techniques. New York: Wiley, 1968.
6. C. Floundas and P. Pardalos, A Collection of Test Problems for Constrained Global Optimization. Berlin, Germany: Springer-Verlag, 1987, vol. 455, Lecture Notes in Comput. Sci..
7. M. Gen and R. Cheng, Genetic Algorithms and Engineering Design. New York: Wiley, 1997.
8. D. Himmelblau, Applied Nonlinear Programming. New York: McGraw-Hill, 1972.
9. W. Hock and K. Schittkowski, Test Examples for Nonlinear Programming Codes. Berlin, Germany: Springer-Verlag, 1981, Lecture Notes in Econ. and Math. Syst..
10. A. Homaifar, S. H.-Y. Lai, and X. Qi, "Constrained optimization via genetic algorithms," Simulation, vol. 62, no. 4, pp. 242-254, 1994.
11. F. Jiménez and J. L. Verdegay, "Evolutionary techniques for constrained optimization problems," in Proc. 7th Eur. Congr. Intelligence Techniques and Soft Computing (EUFIT'99). Berlin, Germany: Springer-Verlag, 1999.
12. J. Joines and C. Houck, "On the use of nonstationary penalty functions to solve nonlinear constrained optimization problems with GAs," in Proc. IEEE Int. Conf. Evolutionary Computing. Piscataway, NJ: IEEE, 1994, pp. 579-584.
13. S. Kazarlis and V. Petridis, "Varying fitness functions in genetic algorithms: Studying the rate of increase in the dynamic penalty terms," in Parallel Problem Solving from Nature. Berlin, Germany: Springer, 1998, vol. 1498, Lecture Notes in Comput. Sci., pp. 211-220.
14. S. Koziel and Z. Michalewicz, "Evolutionary algorithms, homomorphous mappings, and constrained parameter optimization," Evol. Comput., vol. 7, no. 1, pp. 19-44, 1999.
15. Z. Michalewicz, "Genetic algorithms, numerical optimization and constraints," in Proc. 6th Int. Conf. Genetic Algorithms, L. J. Eshelman, Ed. San Mateo, CA: Morgan Kaufman, July 1995, pp. 151-158.
16. Z. Michalewicz and N. Attia, "Evolutionary optimization of constrained problems," in Proc. 3rd Annu. Conf. Evolutionary Programming, A. V. Sebald and L. J. Fogel, Eds. River Edge, NJ: World Scientific, 1994, pp. 98-108.
17. Z. Michalewicz, G. Nazhiyath, and M. Michalewicz, "A note on usefulness of geometrical crossover for numerical optimization problems," in Proc. 5th Annu. Conf. Evolutionary Programming, L. J. Fogel, P. J. Angeline, and T. Back, Eds. Cambridge, MA: M.I.T. Press, 1996, pp. 305-312.
18. A. Petrowski and S. B. Hamida, "A logarithmic mutation operator to solve constrained optimization problems," in Proc. 1999 Genetic and Evol. Comput. Conf., W. Banzhaf, J. Daida, A. E. Eiben, M. H. Garzon, V. Hanavar, M. Jakiela, and R. E. Smith, Eds. San Mateo, CA: Morgan Kaufmann, 1999, p. 805.
19. C. R. Reeves, "Genetic algorithms for the operations researcher," INFORMS J. Comput., vol. 9, no. 3, pp. 231-247, 1997.
20. H.-P. Schwefel, Evolution and Optimum Seeking. New York: Wiley, 1995.
21. W. Siedlecki and J. Sklansky, "Constrained genetic optimization via dynamic reward-penalty balancing and its use in pattern recognition," in Int. Conf. Genetic Algorithms, 1989, pp. 141-149.
22. A. E. Smith and D. W. Coit, "Penalty functions," in Handbook on Evolutionary Computation, T. Bäck, D. B. Fogel, and Z. Michalewicz, Eds. Oxford, U.K.: Oxford Univ. Press, 1997, pp. C5.2:1-C5.2:6.
23. P. D. Surry and N. J. Radcliffe, "The COMOGA method: Constrained optimization by multiobjective genetic algorithms," Contr. Cybern., vol. 26, no. 3, 1997.
24. D. H. Wolpert and W. G. Macready, "No free lunch theorems for optimization," IEEE Trans. Evol. Comput., vol. 1, pp. 67-82, Apr. 1997.