Abstract

The optimal population size of genetic algorithm is studied, based on the defined partial function. The inner relations between the optimal population size and the code length are obtained using the difference equation to solve discrete optimization problems when binary and natural number codes are used in genetic algorithm operations. The results obtained are useful for genetic algorithms in solving practical problems.

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 call

Disclaimer: 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.