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

被引:21
作者
Chang, Pei-Chann [1 ]
Huang, Wei-Hsiu [2 ]
Ting, Ching-Jung [2 ]
机构
[1] Yuan Ze Univ, Dept Informat Management, Tao Yuan 32003, Taiwan
[2] Yuan Ze Univ, Dept Ind Engn & Management, Tao Yuan 32003, Taiwan
关键词
flow-shop scheduling problems; genetic algorithm; artificial immune system; co-evolutional process; early convergence; OPTIMIZATION; SHOP;
D O I
10.1080/00207543.2010.510808
中图分类号
T [工业技术];
学科分类号
08 ;
摘要
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.
引用
收藏
页码:5207 / 5230
页数:24
相关论文
共 39 条
  • [1] A self-organized neural network metamodelling and clonal selection optimization-based approach for the design of a manufacturing system
    Anand, RB
    Tiwari, MK
    Shankar, R
    [J]. INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2006, 44 (06) : 1147 - 1170
  • [2] [Anonymous], THESIS YUAN ZE U TAO
  • [3] [Anonymous], INT C POW SYST TECHN
  • [4] [Anonymous], 1979, Computers and Intractablity: A Guide to the Theory of NP-Completeness
  • [5] [Anonymous], 1991, Foundations of Genetic Algorithms
  • [6] Baker K. R., 1974, Introduction to Sequencing and Scheduling"
  • [7] Campelo F, 2007, LECT NOTES COMPUT SC, V4403, P937
  • [8] Two-phase sub population genetic algorithm for parallel machine-scheduling problem
    Chang, PC
    Chen, SH
    Lin, KL
    [J]. EXPERT SYSTEMS WITH APPLICATIONS, 2005, 29 (03) : 705 - 712
  • [9] A hybrid genetic algorithm with dominance properties for single machine scheduling with dependent penalties
    Chang, Pei Chann
    Chen, Shih Hsin
    Mani, V.
    [J]. APPLIED MATHEMATICAL MODELLING, 2009, 33 (01) : 579 - 596
  • [10] Genetic algorithm integrated with artificial chromosomes for multi-objective flowshop scheduling problems
    Chang, Pei-Chann
    Chen, Shih-Hsin
    Fan, Chin-Yuan
    Chan, Chien-Lung
    [J]. APPLIED MATHEMATICS AND COMPUTATION, 2008, 205 (02) : 550 - 561