Varying fitness functions in genetic algorithms: Studying the rate of increase of the dynamic penalty terms
- 1 January 1998
- book chapter
- Published by Springer Nature
- p. 211-220
- https://doi.org/10.1007/bfb0056864
Abstract
No abstract availableKeywords
This publication has 9 references indexed in Scilit:
- On the use of non-stationary penalty functions to solve nonlinear constrained optimization problems with GA'sPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Varying quality function in genetic algorithms and the cutting problemPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Varying fitness functions in genetic algorithm constrained optimization: the cutting stock and unit commitment problemsIEEE Transactions on Systems, Man, and Cybernetics, Part B (Cybernetics), 1998
- A genetic algorithm solution to the unit commitment problemIEEE Transactions on Power Systems, 1996
- Thermal unit commitment using genetic algorithmsIEE Proceedings - Generation, Transmission and Distribution, 1994
- Genetic algorithm solution to the economic dispatch problemIEE Proceedings - Generation, Transmission and Distribution, 1994
- An evaluation of local improvement operators for genetic algorithmsIEEE Transactions on Systems, Man, and Cybernetics, 1993
- Cutting and Packing Problems: A Categorized, Application-Orientated Research BibliographyJournal of the Operational Research Society, 1992
- A typology of cutting and packing problemsEuropean Journal of Operational Research, 1990