Hybrid Genetic Algorithm with Multiparents Crossover for Job Shop Scheduling ProblemsReportar como inadecuado

Hybrid Genetic Algorithm with Multiparents Crossover for Job Shop Scheduling Problems - Descarga este documento en PDF. Documentación en PDF para descargar gratis. Disponible también para leer online.

Mathematical Problems in Engineering - Volume 2015 2015, Article ID 210680, 12 pages -

Research ArticleInstitute of Mathematical Sciences, Faculty of Science, University of Malaya, 50603 Kuala Lumpur, Malaysia

Received 13 June 2014; Revised 8 September 2014; Accepted 8 September 2014

Academic Editor: Shifei Ding

Copyright © 2015 Noor Hasnah Moin 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.


The job shop scheduling problem JSSP is one of the well-known hard combinatorial scheduling problems. This paper proposes a hybrid genetic algorithm with multiparents crossover for JSSP. The multiparents crossover operator known as extended precedence preservative crossover EPPX is able to recombine more than two parents to generate a single new offspring distinguished from common crossover operators that recombine only two parents. This algorithm also embeds a schedule generation procedure to generate full-active schedule that satisfies precedence constraints in order to reduce the search space. Once a schedule is obtained, a neighborhood search is applied to exploit the search space for better solutions and to enhance the GA. This hybrid genetic algorithm is simulated on a set of benchmarks from the literatures and the results are compared with other approaches to ensure the sustainability of this algorithm in solving JSSP. The results suggest that the implementation of multiparents crossover produces competitive results.

Autor: Noor Hasnah Moin, Ong Chung Sin, and Mohd Omar

Fuente: https://www.hindawi.com/


Documentos relacionados