Journal of Applied Mathematics and Decision Sciences
Volume 2006 (2006), Article ID 65746, 17 pages
Parallel genetic algorithms with migration for the hybrid flow
shop scheduling problem
1Department of Computer Science, University of Sciences and Technology of Oran Mohamed Boudiaf, BP 1505 Oran M'Naouer, Oran 31000, Algeria
2LIMOS Laboratory, University of Blaise Pascal, Clermont Ferrand, Campus of Cézeaux, Aubière Cedex 63173, France
Received 17 March 2006; Revised 17 July 2006; Accepted 2 August 2006
Copyright © 2006 K. Belkadi et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
This paper addresses scheduling problems in hybrid flow shop-like systems with a migration parallel genetic algorithm (PGA_MIG). This parallel genetic algorithm model allows genetic diversity by the application of selection and reproduction mechanisms nearer to nature. The space structure of the population is modified by dividing it into disjoined subpopulations. From time to time, individuals are exchanged between the different subpopulations (migration). Influence of parameters and dedicated strategies are studied. These parameters are the number of independent subpopulations, the interconnection topology between subpopulations, the choice/replacement strategy of the migrant individuals, and the migration frequency. A comparison between the sequential and parallel version of genetic algorithm (GA) is provided. This comparison relates to the quality of the solution and the execution time of the two versions. The efficiency of the parallel model highly depends on the parameters and especially on the migration frequency. In the same way this parallel model gives a significant improvement of computational time if it is implemented on a parallel architecture which offers an acceptable number of processors (as many processors as subpopulations).