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.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
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
