An improved social spider algorithm for the Flexible Job-Shop Scheduling Problem

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].

[1]  Leticia Avilps,et al.  SEX-RATIO BIAS AND POSSIBLE GROUP SELECTION IN THE , 1986 .

[2]  Min Liu,et al.  An enhanced Pareto-based artificial bee colony algorithm for the multi-objective flexible job-shop scheduling , 2012 .

[3]  Karin Ulbrich,et al.  Intraspecific competition in a social spider , 1999 .

[4]  Mitsuo Gen,et al.  A hybrid genetic and variable neighborhood descent algorithm for flexible job shop scheduling problems , 2008, Comput. Oper. Res..

[5]  Damian O. Elias,et al.  Dynamic Population Structure and the Evolution of Spider Mating Systems , 2011 .

[6]  S. Karthikeyan,et al.  A hybrid discrete firefly algorithm for multi-objective flexible job shop scheduling problem with limited resource constraints , 2014, The International Journal of Advanced Manufacturing Technology.

[7]  Alain Pasquet,et al.  Cooperation and Prey Capture Efficiency in a Social Spider, Anelosimus eximius (Araneae, Theridiidae) , 2010 .

[8]  Pierre Borne,et al.  Pareto-optimality approach for flexible job-shop scheduling problems: hybridization of evolutionary algorithms and fuzzy logic , 2002, Math. Comput. Simul..

[9]  Leticia Avilés,et al.  Cooperative capture of large prey solves scaling challenge faced by spider societies , 2008, Proceedings of the National Academy of Sciences.

[10]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..

[11]  Pierre Borne,et al.  Ant systems & Local Search Optimization for flexible Job Shop Scheduling Production , 2007, Int. J. Comput. Commun. Control.

[12]  Leticia Avilés,et al.  Sex-Ratio Bias and Possible Group Selection in the Social Spider Anelosimus eximius , 1986, The American Naturalist.

[13]  Susan E. Riechert,et al.  Patterns of reproductive success associated with social structure and microclimate in a spider system , 2008, Animal Behaviour.

[14]  Zhiming Wu,et al.  An effective hybrid optimization approach for multi-objective flexible job-shop scheduling problems , 2005, Comput. Ind. Eng..

[15]  Erik Valdemar Cuevas Jiménez,et al.  A swarm optimization algorithm inspired in the behavior of the social-spider , 2013, Expert Syst. Appl..

[16]  Imed Kacem,et al.  Genetic algorithm for the flexible job-shop scheduling problem , 2003, SMC'03 Conference Proceedings. 2003 IEEE International Conference on Systems, Man and Cybernetics. Conference Theme - System Security and Assurance (Cat. No.03CH37483).

[17]  Tom Page,et al.  A GRASP algorithm for flexible job-shop scheduling problem with limited resource constraints , 2011 .

[18]  Paolo Brandimarte,et al.  Routing and scheduling in a flexible job shop by tabu search , 1993, Ann. Oper. Res..

[19]  Carly C. Sponarski,et al.  Social organization of the colonial spider Leucauge sp. in the Neotropics: vertical stratification within colonies , 2010 .

[20]  Quan-Ke Pan,et al.  Pareto-based discrete artificial bee colony algorithm for multi-objective flexible job shop scheduling problems , 2011 .

[21]  P. Suganthan,et al.  A hybrid tabu search algorithm with an efficient neighborhood structure for the flexible job shop scheduling problem , 2011 .

[22]  Peter Brucker,et al.  Job-shop scheduling with multi-purpose machines , 1991, Computing.

[23]  Quan-Ke Pan,et al.  An effective hybrid tabu search algorithm for multi-objective flexible job-shop scheduling problems , 2010, Comput. Ind. Eng..

[24]  Shengyao Wang,et al.  An effective artificial bee colony algorithm for the flexible job-shop scheduling problem , 2012 .

[25]  Xuan Du,et al.  Flexible Job Shop scheduling problem solving based on genetic algorithm with model constraints , 2008, 2008 IEEE International Conference on Industrial Engineering and Engineering Management.

[26]  Pierre Borne,et al.  Approach by localization and multiobjective evolutionary optimization for flexible job-shop scheduling problems , 2002, IEEE Trans. Syst. Man Cybern. Part C.

[27]  P. Asokan,et al.  A GRASP algorithm for flexible job-shop scheduling with maintenance constraints , 2010 .