Computers and Operations Research
Genetic algorithms and neighborhood search algorithms for fuzzy flowshop scheduling problems
Fuzzy Sets and Systems - Special issue on operations research
A genetic algorithm for flowshop sequencing
Computers and Operations Research - Special issue on genetic algorithms
Genetic Algorithms in Search, Optimization and Machine Learning
Genetic Algorithms in Search, Optimization and Machine Learning
Multiple Objective Optimization with Vector Evaluated Genetic Algorithms
Proceedings of the 1st International Conference on Genetic Algorithms
Proceedings of the 3rd International Conference on Genetic Algorithms
Genetic Local Search Algorithms for the Travelling Salesman Problem
PPSN I Proceedings of the 1st Workshop on Parallel Problem Solving from Nature
New Generic Hybrids Based upon Genetic Algorithms
IBERAMIA 2002 Proceedings of the 8th Ibero-American Conference on AI: Advances in Artificial Intelligence
Computers and Operations Research
The Hierarchical Fair Competition (HFC) Framework for Sustainable Evolutionary Algorithms
Evolutionary Computation
Two-phase sub population genetic algorithm for parallel machine-scheduling problem
Expert Systems with Applications: An International Journal
Multiobjective evolutionary algorithms: a comparative case studyand the strength Pareto approach
IEEE Transactions on Evolutionary Computation
A fast and elitist multiobjective genetic algorithm: NSGA-II
IEEE Transactions on Evolutionary Computation
IEEE Transactions on Evolutionary Computation
Handling multiple objectives with particle swarm optimization
IEEE Transactions on Evolutionary Computation
Expert Systems with Applications: An International Journal
Expert Systems with Applications: An International Journal
Dynamic diversity control in genetic algorithm for mining unsearched solution space in TSP problems
Expert Systems with Applications: An International Journal
A self-guided genetic algorithm for flowshop scheduling problems
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
CEC'09 Proceedings of the Eleventh conference on Congress on Evolutionary Computation
Expert Systems with Applications: An International Journal
ICIC'09 Proceedings of the 5th international conference on Emerging intelligent computing technology and applications
An efficient multi-objective HBMO algorithm for distribution feeder reconfiguration
Expert Systems with Applications: An International Journal
Expert Systems with Applications: An International Journal
Solving flexible flow-shop problem with a hybrid genetic algorithm and data mining: A fuzzy approach
Expert Systems with Applications: An International Journal
Electromechanical equipment state forecasting based on genetic algorithm - support vector regression
Expert Systems with Applications: An International Journal
Estimation of distribution algorithm for permutation flow shops with total flowtime minimization
Computers and Industrial Engineering
A two-stage hybrid memetic algorithm for multiobjective job shop scheduling
Expert Systems with Applications: An International Journal
Hi-index | 12.08 |
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.