Abstract
This paper proposes rough genetic algorithms based on the notion of rough values. A rough value is defined using an upper and a lower bound. Rough values can be used to effectively represent a range or set of values. A gene in a rough genetic algorithm can be represented using a rough value. The paper describes how this generalization facilitates development of new genetic operators and evaluation measures. The use of rough genetic algorithms is demonstrated using a simple document retrieval application.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
