Genetic algorithms and tabu search: hybrids for optimization
Computers and Operations Research - Special issue on genetic algorithms
An effective hybrid optimization strategy for job-shop scheduling problems
Computers and Operations Research
The efficiency of hybrid mutation genetic algorithm for the travelling salesman problem
Mathematical and Computer Modelling: An International Journal
Hi-index | 0.00 |
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.