Abstract
To minimize the maximum make span of permutation flow shop scheduling problem, this paper proposed a cat swarm optimization algorithm based on estimation of distribution algorithms. This article Take the cat swarm optimization as the framework, embedded in the Estimation Distribution Algorithm, in the search mode, mining the excellent gene link in the solution sequence by using the probability matrix to combination blocks, speed and position tracking mode using characteristics of cat swarm optimization updates in the cat in order to update the excellent solution sequence generator group. Finally, through the simulation test and result comparison of Carlier and Reeves standard example set, the good robustness and global searching ability of the algorithm are verified.
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.
