An efficient constraint handling method for genetic algorithms

作者: Kalyanmoy Deb

DOI: 10.1016/S0045-7825(99)00389-8

关键词:

摘要: … , indicating that better solutions than that reported earlier have been obtained in this study. … As mentioned earlier, in this study, we have used a different real-coded GA with SBX operator …

参考文章(21)
David Mautner Himmelblau, Applied Nonlinear Programming ,(1972)
Kalyanmoy Deb, Ram Bhushan Agrawal, Simulated Binary Crossover for Continuous Search Space. Complex Systems. ,vol. 9, ,(1995)
K. M. Ragsdell, A. Ravindran, G. V. Reklaitis, Engineering Optimization: Methods and Applications ,(1983)
Kalyanmoy Deb, Mayank Goyal, A combined genetic adaptive search (GeneAS) for engineering design Computer Society of India, Bombay. ,(1996)
Mike R. Hilliard, Gunar E. Liepins, Mark R. Palmer, Jon T. Richardson, Some guidelines for genetic algorithms with penalty functions international conference on genetic algorithms. pp. 191- 197 ,(1989)
David E. Goldberg, Kalyanmoy Deb, An Investigation of Niche and Species Formation in Genetic Function Optimization international conference on genetic algorithms. pp. 42- 50 ,(1989)