A Knowledge-Migration-Based Multi-Population Cultural Algorithm to Solve Job Shop Scheduling

In this article, a multipopulation Cultural Algorithm (MP-CA) is proposed to solve Job Shop Scheduling Problems (JSSP). The idea of using multiple populations in a Cultural Algorithm is implemented for the first time in JSSP. The proposed method divides the whole population into a number of sub-populations. On each sub-population, a local CA is applied which includes its own population space as well as belief space. The local CAs use Evolutionary Programming (EP) to evolve their populations, and moreover they incorporate a local search approach to speed up their convergence rates. The local CAs communicate with each other using knowledge migration which is a novel concept in CA. The proposed method extracts two types of knowledge including normative and topographic knowledge and uses the extracted knowledge to guide the evolutionary process to generate better solutions. The MPCA is evaluated using a well-known benchmark. The results show that the MP-CA outperforms some of the existing methods by offering better solutions as well as better convergence rates, and produces competitive solutions when compared to the state-of-the-art methods used to deal with JSSPs.

[1]  Dai Guo-zhong Bi-directional convergence ACO for job-shop scheduling , 2004 .

[2]  Gu Qingming,et al.  A HYBRID GENETIC ALGORITHM FOR JOB SHOP SCHEDULING PROBLEM , 1998 .

[3]  Nhu Binh Ho,et al.  LEGA: an architecture for learning and evolving flexible job-shop schedules , 2005, 2005 IEEE Congress on Evolutionary Computation.

[4]  Carlos A. Coello Coello,et al.  A Cultural Algorithm for Solving the Job Shop Scheduling Problem , 2005 .

[5]  Lawrence Davis,et al.  Job Shop Scheduling with Genetic Algorithms , 1985, ICGA.

[6]  Carlos A. Coello Coello,et al.  Cultural algorithms, an alternative heuristic to solve the job shop scheduling problem , 2007 .

[7]  Nhu Binh Ho,et al.  GENACE: an efficient cultural algorithm for solving the flexible job-shop problem , 2004, Proceedings of the 2004 Congress on Evolutionary Computation (IEEE Cat. No.04TH8753).

[8]  Mitsuo Gen,et al.  A tutorial survey of job-shop scheduling problems using genetic algorithms—I: representation , 1996 .

[9]  FEDERICO DELLA CROCE,et al.  A genetic algorithm for the job shop problem , 1995, Comput. Oper. Res..

[10]  Ziad Kobti,et al.  A Machine Operation Lists based Memetic Algorithm for Job Shop Scheduling , 2011, 2011 IEEE Congress of Evolutionary Computation (CEC).

[11]  R. Reynolds AN INTRODUCTION TO CULTURAL ALGORITHMS , 2008 .

[12]  Francisco Herrera,et al.  A study on the use of non-parametric tests for analyzing the evolutionary algorithms’ behaviour: a case study on the CEC’2005 Special Session on Real Parameter Optimization , 2009, J. Heuristics.

[13]  Hui Wang,et al.  Knowledge Migration Based Multi-population Cultural Algorithm , 2009, 2009 Fifth International Conference on Natural Computation.

[14]  Konstantinos G. Margaritis,et al.  A multipopulation cultural algorithm for the electrical generator scheduling problem , 2002, Math. Comput. Simul..

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

[16]  Ruhul A. Sarker,et al.  Memetic algorithms for solving job-shop scheduling problems , 2009, Memetic Comput..

[17]  Ravi Sethi,et al.  The Complexity of Flowshop and Jobshop Scheduling , 1976, Math. Oper. Res..