.png){kind=icon}
Return
Sub-population genetic algorithm with mining gene structures for multiobjective flowshop scheduling problems
.png){kind=icon}
PRE
AI
DOI：10.1016/j.eswa.2006.06.019.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
According to previous research of Chang et al. [Chang, P. C., Chen, S. H., & Lin, K. L. (2005b). Two phase sub-population genetic algorithm for parallel machine scheduling problem. Expert Systems with Applications, 29(3), 705-712], the sub-population genetic algorithm (SPGA) is effective in solving multiobjective scheduling problems. Based on the pioneer efforts, this research proposes a mining gene structure technique integrated with the SPGA. The mining problem of elite chromosomes is formulated as a linear assignment problem and a greedy heuristic using threshold to eliminate redundant information. As a result, artificial chromosomes are created according to this gene mining procedure and these artificial chromosomes will be reintroduced into the evolution process to improve the efficiency and solution quality of the procedure. In addition, to further increase the quality of the artificial chromosome, a dynamic threshold procedure is developed and the flowshop scheduling problems are applied as a benchmark problem for testing the developed algorithm. Extensive tests in the flow-shop scheduling problem show that the proposed approach can improve the performance of SPGA significantly. (c) 2006 Elsevier Ltd. All rights reserved.
Keywords:
genetic algorithms
multiobjective optimization
pareto optimum solution
minging gene structures
scheduling problem
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
7.5
Papers:
3.0W
Citations:
10.2W
Organization
No organization information available
Cited Papers
No cited papers available