Skip to main content
SpringerLink
Log in

An Improved Evaluation Function for the Bandwidth Minimization Problem

  • Conference paper
Parallel Problem Solving from Nature - PPSN VIII (PPSN 2004)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 3242))

Included in the following conference series:

  • 3777 Accesses

Abstract

This paper introduces a new evaluation function, called δ , for the Bandwidth Minimization Problem for Graphs (BMPG). Compared with the classical β evaluation function used, our δ function is much more discriminating and leads to smoother landscapes. The main characteristics of δ are analyzed and its practical usefulness is assessed within a Simulated Annealing algorithm. Experiments show that thanks to the use of the δ function, we are able to improve on some previous best results of a set of well-known benchmarks.

This work was partially supported by the CONACyT Mexico.

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 74.99
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

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Livesley, R.: The analysis of large structural systems. Computer Journal 3, 34–39 (1960)

    Article  MATH  MathSciNet  Google Scholar 

  2. Chinn, P., Chvatalova, J., Dewdney, A., Gibbs, N.: The bandwidth problem for graphs and matrices - a survey. Journal of Graph Theory 6, 223–254 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  3. Harper, L.: Optimal assignment of numbers to vertices. Journal of SIAM 12, 131–135 (1964)

    MATH  MathSciNet  Google Scholar 

  4. Harary, F.: Theory of Graphs and its Aplications. Czechoslovak Academy of Science, Prague, M. Fiedler (1967)

    Google Scholar 

  5. Papadimitriou, C.: The NP-Completeness of the bandwidth minimization problem. Journal on Computing 16, 263–270 (1976)

    Article  MATH  MathSciNet  Google Scholar 

  6. Garey, M., Graham, R., Johnson, D., Knuth, D.: Complexity results for bandwidth minimization. SIAM Journal of Applied Mathematics 34, 477–495 (1978)

    Article  MATH  MathSciNet  Google Scholar 

  7. Corso, G.D., Manzini, G.: Finding exact solutions to the bandwidth minimization problem. Computing 62, 189–203 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  8. Cutchill, E., McKee, J.: Reducing the bandwidth of sparse symmetric matrices. In: Proceedings of the ACM National Conference, New York, pp. 157–172 (1969)

    Google Scholar 

  9. Gibbs, N., Poole, W., Stockmeyer, P.: An algorithm for reducing the bandwidth and profile of a sparse matrix. SIAM Journal on Numerical Analysis 13, 235–251 (1976)

    Article  MathSciNet  Google Scholar 

  10. Dueck, G., Jeffs, J.: A heuristic bandwidth reduction algorithm. Journal of Combinatorial Mathematics and Computers 18, 97–108 (1995)

    MATH  MathSciNet  Google Scholar 

  11. Martí, R., Laguna, M., Glover, F., Campos, V.: Reducing the bandwidth of a sparse matrix with tabu search. European Journal of Operational Research 135, 211–220 (2001)

    Article  Google Scholar 

  12. Lim, A., Rodrigues, B., Xiao, F.: Integrated genetic algorithm with hill climbing for bandwidth minimization problem. In: Cantú-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O’Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol. 2724, pp. 1594–1595. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  13. Torres-Jimenez, J., Rodriguez-Tello, E.: A new measure for the bandwidth minimization problem. In: Monard, M.C., Sichman, J.S. (eds.) SBIA 2000 and IBERAMIA 2000. LNCS (LNAI), vol. 1952, pp. 477–486. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  14. Esposito, A., Catallano, M.F., Malucelli, F., Tarricone, L.: A new matrix bandwidth reduction algorithm. Operations Research Letters 23, 99–107 (1999)

    Article  Google Scholar 

  15. Kirkpatrick, S., Gelatt, C., Vecchi, M.: Optimization by simulated annealing. Science 220, 671–680 (1983)

    Article  MathSciNet  Google Scholar 

  16. Piñana, E., Plana, I., Campos, V., Martí, R.: GRASP and path relinking for the matrix bandwidth minimization. European Journal of Operational Research 153, 200–210 (2004)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LERIA, Université d’Angers, 2 Boulevard Lavoisier, 49045, Angers, France

    Eduardo Rodriguez-Tello & Jin-Kao Hao

  2. Computer Science Department, ITESM Campus Cuernavaca, Av. Paseo de la Reforma 182-A, 62589, Temixco, Morelos, Mexico

    Jose Torres-Jimenez

Authors
  1. Eduardo Rodriguez-Tello
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Jin-Kao Hao
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Jose Torres-Jimenez
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Birmingham, Birmingham, UK

    Xin Yao

  2. Automated Scheduling, Optimisation and Planning Group, School of Computer Science & IT, University of Nottingham, NG8 1BB, Nottingham, UK

    Edmund K. Burke

  3. Intelligent Systems Group Department of Computer Science and Artificial Intelligence, University of the Basque Country, Paseo Manuel de Lardizábal 1, 20018, San Sebastian, Donostia, Spain

    José A. Lozano

  4. University of the West of England, Bristol, United Kingdom

    Jim Smith

  5. GeNeura Team, Depto. Arquitectura y Tecnología de Computadores, Universidad de Granada, Spain

    Juan Julián Merelo-Guervós

  6. School of Computer Science, The University of Birmingham, B15 1TT, Edgbaston, Birmingham, UK

    John A. Bullinaria

  7. School of Computer Science, University of Birmingham, B15 2TT, Birmingham, Great Britain

    Jonathan E. Rowe

  8. School of Computer Science, University of Birmingham, United Kingdom

    Peter Tiňo

  9. School of Computer Science, The University of Birmingham, B15 2TT, Birmingham, UK

    Ata Kabán

  10. Faculty of Computer Science, Dortmund University of Technology, 44221, Dortmund, Germany

    Hans-Paul Schwefel

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rodriguez-Tello, E., Hao, JK., Torres-Jimenez, J. (2004). An Improved Evaluation Function for the Bandwidth Minimization Problem. In: Yao, X., et al. Parallel Problem Solving from Nature - PPSN VIII. PPSN 2004. Lecture Notes in Computer Science, vol 3242. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30217-9_66

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-30217-9_66

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-23092-2

  • Online ISBN: 978-3-540-30217-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation