Skip to Main Content
Skip Nav Destination
ASME Press Select Proceedings

International Conference on Computer Engineering and Technology, 3rd (ICCET 2011)

By
Jianhong Zhou
Jianhong Zhou
Search for other works by this author on:
ISBN:
9780791859735
No. of Pages:
970
Publisher:
ASME Press
Publication date:
2011

In Permutation Flow-shop Scheduling problems solving, Genetic Algorithm (GA) had been regarded as a meta-heuristic for approximation in combinatorial optimization. However, the standard Genetic Algorithm has suffered from slow convergence and trapped into local optimum when meeting the problems with higher complexities. In this research, we introduce a new heuristic by using the concept of Ant Colony Optimization (ACO) to extract patterns from the chromosomes generated in previous generations. The proposed heuristic is composed of two phases: 1. the blocks mining phase using ACO approach to establish a set of non-overlap block archive and the rest of cities in set...

Abstract
Key Words
1 Introduction
Blocks Constructing and Recombination
P-ACGA: Puzzle Based Artificial Chromosome Genetic Algorithm
Experiment Results
Conclusions and Future Researches
References
This content is only available via PDF.
You do not currently have access to this chapter.
Close Modal

or Create an Account

Close Modal
Close Modal