Abstract

In this paper, we propose a novel swarm algorithm, called social spider algorithm (SSA), to solve the Flexible Job-Shop Scheduling Problem (FJSP). The SSA algorithm stresses the difference between the two different search agents (spiders): males and females [19]. Some strategies are utilized to generate the initial individual in order to ensure certain quality and diversity, such as global search (GS) and local search (LS) and so on. Moreover, instead of the original SSA algorithm, the improved SSA is combined with the selection, crossover and mutation operation to enhance the performance. The computational result shows that the proposed algorithm produces better results than other authors' algorithms [23].

Full Text
Paper version not known

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.