Abstract
Clonal Selection Algorithm (CSA), inspired by the clonal selection theory, has gained much attention and wide applications. In most common forms, the CSAs use a binary representation of variables, and the emulated immune operators, mutation, proliferation, selection, for example, are made to act on it. However, the binary representation often suffers from the so-called Hamming Cliff problem. In order to overcome this problem, a Gray-coded CSA is presented and used to solve optimization problems. The algorithm is applied to numerous bench-mark problems of numerical optimization problems and the computational results show effectiveness of the proposed algorithm.
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.
