Skip to main content
SpringerLink
Log in

Increasing the Antibandwidth of Sparse Matrices by a Genetic Algorithm

  • Conference paper
Recent Trends in Applied Artificial Intelligence (IEA/AIE 2013)

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

Abstract

The antibandwidth problem consists in finding a labeling of the vertices of a given undirected graph such that among all adjacent node pairs, the minimum difference between the node labels is maximized. In this paper, we formulate the antibandwidth problem in terms of matrices and propose an efficient genetic algorithm based heuristic approach for increasing the corresponding antibandwidth. We report computational results for a set of 30 benchmark instances. The preliminary results point out that our approach is an attractive and appropriate method to explore the solution space of this complex problem and leads to good solutions in reasonable computational times.

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. Bansal, R., Srivastava, K.: Memetic algorithm for the antibandwidth maximization problem. Journal of Heuristics 17, 39–60 (2011)

    Article  MATH  Google Scholar 

  2. Dobrev, S., Kralovic, R., Pardubska, D., Torok, L., Vrto, I.: Antibandwidth and cyclic antibandwidth of Hamming graphs. Electronic Notes in Discrete Mathematics 34, 295–300 (2009)

    Article  MathSciNet  Google Scholar 

  3. Donnelly, S., Isaak, G.: Hamiltonian powers in threshold and arborescent comparability graphs. Discrete Mathematics 202, 33–44 (1999)

    Article  MathSciNet  MATH  Google Scholar 

  4. Duarte, A., Marti, R., Resende, M.G.C., Silva, R.M.A.: GRASP with path relinking heuristics for the antibandwidth problem. Networks 58(3), 171–189 (2011)

    Article  MathSciNet  MATH  Google Scholar 

  5. Hale, W.K.: Frequency assignment: Theory and applications. Proceedings of the IEEE 68, 1497–1514 (1980)

    Article  Google Scholar 

  6. Holland, J.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)

    Google Scholar 

  7. Leung, J., Vornberger, O., Witthoff, J.: On some variants of the bandwidth minimization problem. SIAM Journal on Computing 13(3), 650–667 (1984)

    Article  MathSciNet  MATH  Google Scholar 

  8. Raspaud, A., Schroder, H., Sykora, O., Torok, L., Vrto, I.: Antibandwidth and cyclic antibandwidth of meshes and hypercubes. Discrete Mathematics 309, 3541–3552 (2009)

    Article  MathSciNet  MATH  Google Scholar 

  9. Yixun, L., Jinjiang, Y.: The dual bandwidth problem for graphs. J. of Zhengzhou University 35, 1–5 (2003)

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Mathematics and Informatics, Technical Univ. of Cluj-Napoca, Romania

    Petrica C. Pop

  2. Dept. of Electrical Engineering, Technical University of Cluj-Napoca, Romania

    Oliviu Matei

Authors
  1. Petrica C. Pop
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Oliviu Matei
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Texas State University, 78666, San Marcos, TX, USA

    Moonis Ali

  2. Agent Systems Research Group, Department of Computer Science, Faculty of Sciences, VU University Amsterdam, De Boelelaan 1081, 1081, Amsterdam, HV, The Netherlands

    Tibor Bosse

  3. Interactive Intelligence Group, Department of Intelligent Systems, Faculty of Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, Mekelweg 4, 2628 CD, Delft, The Netherlands

    Koen V. Hindriks  & Catholijn M. Jonker  & 

  4. Computational Intelligence Group, Department of Computer Science, Faculty of Sciences, VU University Amsterdam, De Boelelaan 1081, 1081 HV, Amsterdam, The Netherlands

    Mark Hoogendoorn

  5. Agent Systems Research Group, Department of Computer Science, Faculty of Sciences, VU University Amsterdam, De Boelelaan 1081, 1081 HV, Amsterdam, The Netherlands

    Jan Treur

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Pop, P.C., Matei, O. (2013). Increasing the Antibandwidth of Sparse Matrices by a Genetic Algorithm. In: Ali, M., Bosse, T., Hindriks, K.V., Hoogendoorn, M., Jonker, C.M., Treur, J. (eds) Recent Trends in Applied Artificial Intelligence. IEA/AIE 2013. Lecture Notes in Computer Science(), vol 7906. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38577-3_25

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-38577-3_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38576-6

  • Online ISBN: 978-3-642-38577-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation