This paper presents a genetic algorithm hybridized with a constructive procedure and reports its application on the crosstalk aware track assignment problem. In this algorithm, only dominating elements are encoded as chromosomes, on which genetic operators work to explore the solution space, while other elements are determined using constructive method. With proper dominating elements identification, the proposed approach essentially searches a much smaller space without trivial operations, efficiently generating competitive solutions with an effective constructive procedure. Experimental results on a set of industrial instances and ISPD98 benchmarks show that the proposed algorithm reduces both capacitive and inductive coupling in acceptable running time. It is probable that the proposed approach provides a practical way for the application of genetic algorithm on large scale engineering problems.
[1]
K. Katayama,et al.
The efficiency of hybrid mutation genetic algorithm for the travelling salesman problem
,
2000
.
[2]
Ling Wang,et al.
An effective hybrid optimization strategy for job-shop scheduling problems
,
2001,
Comput. Oper. Res..
[3]
Yici Cai,et al.
Integrated routing resource assignment for RLC crosstalk minimization
,
2005,
2005 IEEE International Symposium on Circuits and Systems.
[4]
Fred W. Glover,et al.
Genetic algorithms and tabu search: Hybrids for optimization
,
1995,
Comput. Oper. Res..