论文信息 - Applying Multi-Moves in Parallel Genetic Algorithm for the Flow Shop Problem

Applying Multi-Moves in Parallel Genetic Algorithm for the Flow Shop Problem

The matter of using multi‐moves in parallel genetic algorithms is discussed in the paper. Computational experiments are done for the flow shop, the classic NP‐hard problem of the combinatorial optimization. Obtained results are very promising: the superlinear speedup is observed for some versions of the parallel algorithm.

Wojciech Bożejko | Mieczysław Wodecki

[1] Éric D. Taillard,et al. Benchmarks for basic scheduling problems , 1993 .

[2] Erick Cantú-Paz,et al. Efficient and Accurate Parallel Genetic Algorithms , 2000, Genetic Algorithms and Evolutionary Computation.

[3] Mieczysław Wodecki,et al. A very fast tabu search algorithm for the permutation flow shop problem with makespan criterion , 2004, Comput. Oper. Res..

[4] C. Reeves,et al. Genetic Algorithms, Path Relinking, the Flowshop Sequencing Problem and , 1998 .

[5] Wojciech Bozejko,et al. On the theoretical properties of swap multimoves , 2007, Oper. Res. Lett..

[6] Eugeniusz Nowicki,et al. Some aspects of scatter search in the flow-shop problem , 2006, Eur. J. Oper. Res..