Solving Flexible Multi-objective JSP Problem Using A Improved Genetic Algorithm

Genetic algorithm is a combinatorial optimization problem solving in the field of search algorithm, because of its versatility and robustness, it has been widely used in various fields of science. However, there are some defects in traditional genetic algorithm . for its shortcomings, this paper proposed an improved genetic algorithm for multi-objective Flexible JSP (job shop scheduling) problem . The algorithm construct the initial solution based on judging similarity strategy and immune mechanisms, proposed a self-adaptation cross and mutation operator, and using simulated annealing algorithm strategy combined with immune mechanisms in the selection operator, the experiment proof shows that, the improved genetic algorithm can improve the performance.

[1]  Helena Ramalhinho Dias Lourenço,et al.  Job-shop scheduling: Computational study of local search and large-step optimization methods , 1995 .

[2]  Kalyanmoy Deb,et al.  Self-Adaptive Genetic Algorithms with Simulated Binary Crossover , 2001, Evolutionary Computation.

[3]  Isao Ono,et al.  A Real Coded Genetic Algorithm for Function Optimization Using Unimodal Normal Distributed Crossover , 1997, ICGA.

[4]  Cheol Hoon Park,et al.  Genetic algorithm for job shop scheduling problems based on two representational schemes , 1995 .

[5]  Kalyanmoy Deb,et al.  Multi-objective Genetic Algorithms: Problem Difficulties and Construction of Test Problems , 1999, Evolutionary Computation.

[6]  John J. Grefenstette,et al.  Optimization of Control Parameters for Genetic Algorithms , 1986, IEEE Transactions on Systems, Man, and Cybernetics.

[7]  Michael Affenzeller,et al.  SASEGASA: An Evolutionary Algorithm for Retarding Premature Convergence by Self-adaptive Selection Pressure Steering , 2003, IWANN.

[8]  C. D. Gelatt,et al.  Optimization by Simulated Annealing , 1983, Science.

[9]  David E. Goldberg,et al.  Genetic Algorithms with Sharing for Multimodalfunction Optimization , 1987, ICGA.

[10]  Shigenobu Kobayashi,et al.  A Real-Coded Genetic Algorithm for Function Optimization Using the Unimodal Normal Distribution Crossover , 1999 .

[11]  Francisco Herrera,et al.  Tackling Real-Coded Genetic Algorithms: Operators and Tools for Behavioural Analysis , 1998, Artificial Intelligence Review.

[12]  Mitsuo Gen,et al.  Genetic algorithms and engineering design , 1997 .

[13]  Piotr Indyk,et al.  Similarity Search in High Dimensions via Hashing , 1999, VLDB.

[14]  Mauricio G. C. Resende,et al.  Discrete Optimization A hybrid genetic algorithm for the job shop scheduling problem , 2005 .

[15]  Ju-Jang Lee,et al.  Adaptive simulated annealing genetic algorithm for system identification , 1996 .

[16]  Lalit M. Patnaik,et al.  Adaptive probabilities of crossover and mutation in genetic algorithms , 1994, IEEE Trans. Syst. Man Cybern..

[17]  C.H. Dai,et al.  Adaptive Probabilities of Crossover and Mutation in Genetic Algorithms Based on Cloud Model , 2006, 2006 IEEE Information Theory Workshop - ITW '06 Chengdu.