A hybrid genetic-immune algorithm with improved lifespan and elite antigen for flow-shop scheduling problems

In this paper, a hybrid genetic-immune algorithm (HGIA) is proposed to reduce the premature convergence problem in a genetic algorithm (GA) in solving permutation flow-shop scheduling problems. A co-evolutionary strategy is proposed for efficient combination of GA and an artificial immune system (AIS). First, the GA is adopted to generate antigens with better fitness, and then the population in the last generation is transformed into antibodies in AIS. A new formula for calculating the lifespan of each antibody is employed during the evolution processes. In addition, a new mechanism including T-cell and B-cell generation procedures is applied to produce different types of antibodies which will be merged together. The antibodies with longer lifespan will survive and enter the next generation. This co-evolutionary strategy is very effective since chromosomes and antibodies will be transformed and evolved dynamically. The intensive experimental results show the effectiveness of the HGIA approach. The hybrid algorithm can be further extended to solve different combinatorial problems.

[1]  Pei-Chann Chang,et al.  A hybrid genetic algorithm with dominance properties for single machine scheduling with dependent penalties , 2009 .

[2]  Hisashi Shimodaira,et al.  DCGA: a diversity control oriented genetic algorithm , 1997, Proceedings Ninth IEEE International Conference on Tools with Artificial Intelligence.

[3]  Pei-Chann Chang,et al.  Dynamic diversity control by injecting artificial chromosomes for solving TSP problems , 2008, 2008 IEEE Congress on Evolutionary Computation (IEEE World Congress on Computational Intelligence).

[4]  John H. Holland,et al.  Genetic Algorithms and the Optimal Allocation of Trials , 1973, SIAM J. Comput..

[5]  Pei-Chann Chang,et al.  Genetic algorithm integrated with artificial chromosomes for multi-objective flowshop scheduling problems , 2008, Appl. Math. Comput..

[6]  Pei-Chann Chang,et al.  A two-phase genetic-immune algorithm with improved survival strategy of lifespan for flow-shop scheduling problems , 2009, 2009 IEEE Symposium on Computational Intelligence in Scheduling.

[7]  Takeshi Yamada,et al.  Genetic Algorithms, Path Relinking, and the Flowshop Sequencing Problem , 1998, Evolutionary Computation.

[8]  Carlos A. Coello Coello,et al.  Hybridizing a genetic algorithm with an artificial immune system for global optimization , 2004 .

[9]  Zongyuan Mao,et al.  An Artificial Immune Network Approach for Pattern Recognition , 2007, Third International Conference on Natural Computation (ICNC 2007).

[10]  Manoj Kumar Tiwari,et al.  A self-organized neural network metamodelling and clonal selection optimization-based approach for the design of a manufacturing system , 2006 .

[11]  Chuen-Lung Chen,et al.  Genetic algorithms applied to the continuous flow shop problem , 1996 .

[12]  Jung Woo Jung,et al.  Flowshop-scheduling problems with makespan criterion: a review , 2005 .

[13]  Pei-Chann Chang,et al.  Dynamic diversity control in genetic algorithm for mining unsearched solution space in TSP problems , 2010, Expert Syst. Appl..

[14]  Rubén Ruiz,et al.  A comprehensive review and evaluation of permutation flowshop heuristics to minimize flowtime , 2013, Comput. Oper. Res..

[15]  Jin-gui Lu,et al.  An Improved Immune-Genetic Algorithm for the Traveling Salesman Problem , 2007, Third International Conference on Natural Computation (ICNC 2007).

[16]  Manoj Kumar Tiwari,et al.  An efficient hybrid evolutionary heuristic using genetic algorithm and simulated annealing algorithm to solve machine loading problem in FMS , 2009 .

[17]  Bin Jiao,et al.  A similar particle swarm optimization algorithm for permutation flowshop scheduling to minimize makespan , 2006, Appl. Math. Comput..

[18]  Colin R. Reeves,et al.  A genetic algorithm for flowshop sequencing , 1995, Comput. Oper. Res..

[19]  Pei-Chann Chang,et al.  A Hybrid Genetic-Immune Algorithm with Improved Offsprings and Elitist Antigen for Flow-Shop Scheduling Problems , 2009, 2009 11th IEEE International Conference on High Performance Computing and Communications.

[20]  Hisao Ishibuchi,et al.  Performance evaluation of genetic algorithms for flowshop scheduling problems , 1994, Proceedings of the First IEEE Conference on Evolutionary Computation. IEEE World Congress on Computational Intelligence.

[21]  Kalyanmoy Deb,et al.  A Comparative Analysis of Selection Schemes Used in Genetic Algorithms , 1990, FOGA.

[22]  Frederico G. Guimarães,et al.  Overview of Artificial Immune Systems for Multi-objective Optimization , 2007, EMO.

[23]  Mostafa Zandieh,et al.  An immune algorithm for scheduling a hybrid flow shop with sequence-dependent setup times and machines with random breakdowns , 2009 .

[24]  Hisao Ishibuchi,et al.  Balance between genetic search and local search in memetic algorithms for multiobjective permutation flowshop scheduling , 2003, IEEE Trans. Evol. Comput..

[25]  P. Shahabudeen,et al.  An improved genetic algorithm for the flowshop scheduling problem , 2009 .

[26]  Mark James Neal,et al.  Meta-stable Memory in an Artificial Immune Network , 2003, ICARIS.

[27]  Srikanth K. Iyer,et al.  Improved genetic algorithm for the permutation flowshop scheduling problem , 2004, Comput. Oper. Res..

[28]  Pei-Chann Chang,et al.  Two-phase sub population genetic algorithm for parallel machine-scheduling problem , 2005, Expert Syst. Appl..

[29]  Pei-Chann Chang,et al.  A case-injected genetic algorithm for single machine scheduling problems with release time , 2006 .

[30]  David E. Goldberg,et al.  Genetic Algorithms in Search Optimization and Machine Learning , 1988 .

[31]  P. Reiser,et al.  Genetic algorithms in engineering systems: innovations and applications , 1996 .

[32]  Edmund L. Wong,et al.  Polymorphous Computing Architecture (PCA) Kernel-Level Benchmarks , 2005 .

[33]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[34]  Fang Liu,et al.  Hybrid Immune Genetic Method for Dynamic Reactive Power Optimization , 2006, 2006 International Conference on Power System Technology.

[35]  A. J. Clewett,et al.  Introduction to sequencing and scheduling , 1974 .

[36]  Song-Yop Hahn,et al.  A study on comparison of optimization performances between immune algorithm and other heuristic algorithms , 1998 .

[37]  Jose M. Framiñan,et al.  A review and classification of heuristics for permutation flow-shop scheduling with makespan objective , 2004, J. Oper. Res. Soc..

[38]  Tung-Kuan Liu,et al.  Improved immune algorithm for global numerical optimization and job-shop scheduling problems , 2007, Appl. Math. Comput..

[39]  Tadahiko MURATA,et al.  Positive and negative combination effects of crossover and mutation operators in sequencing problems , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.