GA Based on the UV-Structure Hypothesis and Its Application to JSP

Genetic Algorithms (GAs) are effective approximation algorithms which focus on "hopeful area" in searching process. However, in harder problems, it is often very difficult to maintain a favorable trade-off between exploitation and exploration. All individuals leave the big-valley including the global optimum, and concentrate on another big-valley including a local optimum often. In this paper, we define such a situation on conventional GAs as the " UV-phenomenon", and suggest UV-structures as hard landscape structures that will cause the UV-phenomenon. We propose Innately Split Model (ISM) as a new GA model which can avoid the UV-phenomenon. We apply ISM to Job-shop Scheduling Problem (JSP), which is considered as one of globally multimodal and UV-structural problems. It is shown that ISM surpasses all famous approximation algorithms applied to JSP.

[1]  G. Thompson,et al.  Algorithms for Solving Production-Scheduling Problems , 1960 .

[2]  Emile H. L. Aarts,et al.  Genetic Local Search Algorithms for the Travelling Salesman Problem , 1990, PPSN.

[3]  William J. Cook,et al.  A Computational Study of the Job-Shop Scheduling Problem , 1991, INFORMS Journal on Computing.

[4]  Christian Bierwirth,et al.  Control of Parallel Population Dynamics by Social-Like Behavior of GA-Individuals , 1994, PPSN.

[5]  Jan Karel Lenstra,et al.  A Computational Study of Local Search Algorithms for Job Shop Scheduling , 1994, INFORMS J. Comput..

[6]  Andrew B. Kahng,et al.  A new adaptive multi-start technique for combinatorial global optimizations , 1994, Oper. Res. Lett..

[7]  E. Nowicki,et al.  A Fast Taboo Search Algorithm for the Job Shop Problem , 1996 .

[8]  Takeshi Yamada,et al.  Job-Shop Scheduling by Simulated Annealing Combined with Deterministic Local Search , 1996 .

[9]  Isao Ono,et al.  A genetic algorithm for job-shop scheduling problems using job-based order crossover , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[10]  Takeshi Yamada,et al.  Scheduling by Genetic Local Search with Multi-Step Crossover , 1996, PPSN.

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

[12]  I. Ono,et al.  A Genetic Algorithm Taking Account of Characteristics Preservation for Job Shop Scheduling Problems , 1998 .

[13]  Shigenobu Kobayashi,et al.  A distance alternation model on real-coded genetic algorithms , 1999, IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028).

[14]  M. Yamamura,et al.  A functional specialization hypothesis for designing genetic algorithms , 1999, IEEE SMC'99 Conference Proceedings. 1999 IEEE International Conference on Systems, Man, and Cybernetics (Cat. No.99CH37028).

[15]  Shigenobu Kobayashi,et al.  Extrapolation-Directed Crossover for Job-shop Scheduling Problems: Complementary Combination with JOX , 2000, GECCO.