Skip to main content
SpringerLink
Log in

A Genetic Algorithm for Switchbox Routing Problem

  • Conference paper
  • First Online:
Rough Sets and Current Trends in Computing (RSCTC 1998)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1424))

Included in the following conference series:

  • 727 Accesses

Abstract

A genetic routing method for switchbox problem with novel coding technique is presented. The principle of proposed method and results of computer experiments are described in detail.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. L. Davis ed.: “Handbook of Genetic Algorithms”, Van Nostrand Reinhold (1991).

    Google Scholar 

  2. S.M. Sait and H. Youssef: “VLSI Physical Design Automation”, IEEE Press (1995).

    Google Scholar 

  3. A.T. Rahmani and N. Ono: “A Genetic Algorithm for Channel Routing Problem”, Proc. of the 5th Int. Conf. on Genetic Algorithms, pp. 494–498 (1993)

    Google Scholar 

  4. V.N. Davidenko, V.M. Kureichik and V.V. Miagkikh: “Genetic Algorithm for restrictive Channel Routing Problem”, Proc. of the 7th Int. Conf. on Genetic Algorithms, pp. 636–642 (1997)

    Google Scholar 

  5. R. Joobbani and D.P. Siewiorek: “WEAVER: A knowledge based routing expert”, Design & Test, Vol. 3, No. 4, pp. 12–23 (1983)

    Google Scholar 

  6. J.P. Cohoon and P.L. Heck: “BEAVER: A computational-geometry-based tool for switchbox routing”, IEEE Trans. CAD, Vol. CAD-7, No. 6, pp. 684–697 (1988)

    Google Scholar 

  7. M. Burstein and R. Pelavin: “Hierarchical Wire Routing”, IEEE Trans. CAD, Vol. CAD-2, No. 4, pp. 223–234 (1983)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Faculty of Engineering, Saitama University, 255, Shimo-okubo, Urawa, 338, Japan

    Akinori Kanasugi, Takashi Shimayama, Naoshi Nakaya & Takeshi Iizuka

Authors
  1. Akinori Kanasugi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Takashi Shimayama
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Naoshi Nakaya
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Takeshi Iizuka
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Institute of Mathematics, Warsaw University of Technology, Pl. Politechniki 1, 00-665, Warszawa, Poland

    Lech Polkowski

  2. Institute of Mathematics, Warsaw University, Banacha 2, 02-097, Warszawa, Poland

    Andrzej Skowron

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Kanasugi, A., Shimayama, T., Nakaya, N., Iizuka, T. (1998). A Genetic Algorithm for Switchbox Routing Problem. In: Polkowski, L., Skowron, A. (eds) Rough Sets and Current Trends in Computing. RSCTC 1998. Lecture Notes in Computer Science(), vol 1424. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-69115-4_34

Download citation

  • DOI: https://doi.org/10.1007/3-540-69115-4_34

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-64655-6

  • Online ISBN: 978-3-540-69115-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation