Skip to main content

A Hybrid Genetic Algorithm and Application to the Crosstalk Aware Track Assignment Problem

  • Conference paper
  • 2076 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3612))

Abstract

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.

This work is supported by the National Hi-Tech Research & Development (863) Program of China: 2005AA1Z1230 and the National Natural Science Foundation of China (NSFC) 60476014 and the Seed fund of Tsinghua University.

This is a preview of subscription content, log in via an institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   119.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Katayama, K., Sakamoto, H., Narihisa, H.: The efficiency of hybrid mutation genetic algorithm for the travelling salesman problem. Mathematical and Computer Modelling 31(10-12), 197–203 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  2. Wang, L., Zheng, D.: An effective hybrid optimization strategy for job-shop scheduling problems. Comuters and Operations Research 28(6), 585–596 (2001)

    Article  MATH  MathSciNet  Google Scholar 

  3. Glover, F., Kelly, J.P., Laguna, M.: Genetic algorithms and tabu search: hybrids for optimization. Computers and Operations Research 22(1), 111–134 (1995)

    Article  MATH  Google Scholar 

  4. Cai, Y., Liu, B., Zhou, Q., Hong, X.: Integrated routing resource assignment for Crosstalk minimization. In: Proc. the 2005 IEEE International Symposium on Circuits and Systems (2005) (to appear)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Cai, Y., Liu, B., Yan, X., Zhou, Q., Hong, X. (2005). A Hybrid Genetic Algorithm and Application to the Crosstalk Aware Track Assignment Problem. In: Wang, L., Chen, K., Ong, Y.S. (eds) Advances in Natural Computation. ICNC 2005. Lecture Notes in Computer Science, vol 3612. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11539902_21

Download citation

  • DOI: https://doi.org/10.1007/11539902_21

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-28320-1

  • Online ISBN: 978-3-540-31863-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics