Abstract
A novel clustered population paradigm is presented in this paper which is based on Chaos principles of edges and attractors. Convergence in evolutionary algorithms is viewed as a manifestation through cyclic dynamics and thus a new population is developed which is clustered and separated through new segregation bias rules. This population is embedded on the Enhanced Differential Evolution and the flow shop scheduling problem with blocking is solved. The two flow shop benchmark problems of Rec/Car/Hel and Taillard are solved with this new approach and the results favorably compared with published results in literature. A total of 49 new upper bounds for the Taillard problems was obtained during experimentation.
Sign-in/Register to access full text options 
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.
