Mining gene structures to inject artificial chromosomes for genetic algorithm in single machine scheduling problems

被引:40
作者
Chang, Pei-Chann [1 ]
Chen, Shih-Shin
Fan, Chin-Yuan
机构
[1] Yuan Ze Univ, Dept Informat Management, Tao Yuan 32026, Taiwan
[2] Yuan Ze Univ, Dept Ind Engn & Management, Tao Yuan 32026, Taiwan
关键词
genetic algorithm; single machine scheduling; total deviation; dominance properties;
D O I
10.1016/j.asoc.2007.06.005
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
In this paper, a genetic algorithm with injecting artificial chromosomes is developed to solve the single machine scheduling problems. Artificial chromosomes are generated according to a probability matrix which is transformed from the dominance matrix by mining the gene structure of an elite base. A roulette wheel selection method is applied to generate an artificial chromosome by assigning genes onto each position according to the probability matrix. The higher the probability is, the more possible that the job will show up in that particular position. By injecting these artificial chromosomes, the genetic algorithm will speed up the convergence of the evolutionary processes. Intensive experimental results indicate that proposed algorithm is very encouraging and it can improve the solution quality significantly. (C) 2007 Elsevier B.V. All rights reserved.
引用
收藏
页码:767 / 777
页数:11
相关论文
共 41 条
[1]   DYNAMIC-PROGRAMMING STATE-SPACE RELAXATION FOR SINGLE-MACHINE SCHEDULING [J].
ABDULRAZAQ, TS ;
POTTS, CN .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1988, 39 (02) :141-152
[2]   A new dominance rule to minimize total weighted tardiness with unequal release dates [J].
Akturk, MS ;
Ozdemir, D .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2001, 135 (02) :394-412
[3]   New hybrid genetic operators for real coded genetic algorithm to compute optimal control of a class of hybrid systems [J].
Arumugam, MS ;
Rao, MVC ;
Palaniappan, R .
APPLIED SOFT COMPUTING, 2005, 6 (01) :38-52
[4]   BICRITERIA SCHEDULING PROBLEM INVOLVING TOTAL TARDINESS AND TOTAL EARLINESS PENALTIES [J].
AZIZOGLU, M ;
KONDAKCI, S ;
KIRCA, O .
INTERNATIONAL JOURNAL OF PRODUCTION ECONOMICS, 1991, 23 (1-3) :17-24
[5]  
BAZHAF W, 1998, GENETIC PROGRAMMING
[6]   SCHEDULING WITH RELEASE DATES ON A SINGLE-MACHINE TO MINIMIZE TOTAL WEIGHTED COMPLETION-TIME [J].
BELOUADAH, H ;
POSNER, ME ;
POTTS, CN .
DISCRETE APPLIED MATHEMATICS, 1992, 36 (03) :213-231
[7]   Adaptive genetic algorithms applied to dynamic multiobjective problems [J].
Bingul, Zafer .
APPLIED SOFT COMPUTING, 2007, 7 (03) :791-799
[8]  
Chang P-C, 2003, APPL SOFT COMPUT, V3, P139
[9]   Two-phase sub population genetic algorithm for parallel machine-scheduling problem [J].
Chang, PC ;
Chen, SH ;
Lin, KL .
EXPERT SYSTEMS WITH APPLICATIONS, 2005, 29 (03) :705-712
[10]   A branch and bound approach for single machine scheduling with earliness and tardiness penalties [J].
Chang, PC .
COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1999, 37 (10) :133-144