Skip to main content
SpringerLink
Log in

Assessing the Performance of Bi-objective MST for Euclidean and Non-Euclidean Instances

  • Conference paper
Contemporary Computing (IC3 2010)

Part of the book series: Communications in Computer and Information Science ((CCIS,volume 94))

Included in the following conference series:

Abstract

The Bounded Diameter (a.k.a Diameter Constraint) Minimum Spanning Tree (BDMST/DCMST) is a well-studied combinatorial optimization problem. Several well-known deterministic heuristics and evolutionary approaches exist to solve the problem for a particular diameter. In this paper, we recast the BDMST problem as a Bi-Objective Minimum Spanning Tree (BOMST) problem and study the Pareto fronts. Instead of assessing performance of a single value obtained from BDMST algorithms, we assess the performance of the different heuristics over a Pareto front drawn across the diameter range. The advantege of this work is to give a provision to choose the better heuristics depending on particular diameter range for concerned real-life problem by observing the Pareto front.

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 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.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. Garey, M.R., Johnson, D.S.: Computers and Interactibility: A guide to the theory of NP-Completeness. W. H. Freeman, New York (1979)

    MATH  Google Scholar 

  2. Deo, N., Abdalla, A.: Computing a diameter-constrained minimum spanning tree in parallel. In: Bongiovanni, G., Petreschi, R., Gambosi, G. (eds.) CIAC 2000. LNCS, vol. 1767, pp. 17–31. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  3. Julstrom, B.A.: Greedy heuristics for the bounded diameter minimum spanning tree problem. Journal of Experimental Algorithmics (JEA) 14, 1.1:1–1.1:14 (2009)

    Google Scholar 

  4. Raidl, G.R., Julstrom, B.A.: Greedy heuristics and an evolutionary algorithm for the bounded diameter minimum spanning tree problem. In: 18th ACM Symposium on Applied Computing (SAC 2003), pp. 747–752 (2003)

    Google Scholar 

  5. Nghia, N.D., Binh, H.T.T.: Heuristic algorithms for solving bounded diameter minimum spanning tree problem and its application to genetic algorithm development. Advances in Greedy Algorithms, 586 (November 2008)

    Google Scholar 

  6. Julstrom, B.A., Raidl, G.R.: A permutation coded evolutionary for the bounded diameter minimum spanning tree 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. 2–7. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  7. Gruber, M., Hemert, J.V., Raidl, G.R.: Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a vns, ea, and aco. In: GECCO 2006 (July 2006)

    Google Scholar 

  8. Binh, H.T.T., Hoai, N.X., Mckay, R.I., Nghia, N.D.: New heuristic and hybrid genetic algorithm for solving the bounded diameter minimum spanning tree problem. ACM, New York (2009)

    Google Scholar 

  9. Singh, A., Gupta, A.K.: Impoved heuristics for the bounded diameter minimum spanning tree problem. Journal Soft Computing 11, 911–921 (July 2007)

    Article  Google Scholar 

  10. Kumar, R., Bal, B.K., Rockett, P.I.: Multiobjective genetic programming approach to evolving heuristics for the bounded diameter minimum spanning tree problem. In: GECCO 2009 (2009)

    Google Scholar 

  11. Kumar, R., Singh, P.K.: On quality performance of heuristic and evolutionary algorithms for biobjective minimum spanning trees. In: GECCO 2007: Proceedings of the 9th Annual Conference on Genetic and Evolutionary Computation, p. 2259. ACM Press, New York (2007)

    Chapter  Google Scholar 

  12. Abdalla, A.: Computing a Diameter-constraint Minimum Spanning Tree. PhD thesis, The School of Electrical Engineering and Computer Science, University of Central Florida, Florida (2001)

    Google Scholar 

  13. Gruber, M., Raidl, G.R.: Solving the euclidean bounded diameter minimum spanning tree problem by clustering based (meta) heuristics. In: Moreno-Díaz, R., Pichler, F., Quesada-Arencibia, A. (eds.) Computer Aided Systems Theory - EUROCAST 2009. LNCS, vol. 5717, pp. 665–672. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dept. of Computer Science & Engineering, Indian Institute of Technology Kharagpur, Kharagpur, WB, 721302, India

    Soma Saha, Mohammad Aslam & Rajeev Kumar

Authors
  1. Soma Saha
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohammad Aslam
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rajeev Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dept. of Computer Sciences, University of Florida, 32611, Gainesville, FL, USA

    Sanjay Ranka

  2. University of Florida, Gainesville, Fl, USA

    Arunava Banerjee

  3. Department of Computer Science and Engineering, Indian Institute of Technology, 110016, New Delhi, INDIA

    Kanad Kishore Biswas

  4. Computer Science, College of Engineering and Science, Louisiana Tech University, LA 71272, Ruston, USA

    Sumeet Dua

  5. University of Florida, Gainesville, FL, USA

    Prabhat Mishra

  6. Department of Computer Science & Engineering, Indian Institute of Technology, 208016, Kanpur, India

    Rajat Moona

  7. National Tsing Hua University, Hsin-Chu, Taiwan, R.O.C.

    Sheung-Hung Poon

  8. Department of Computer Science, The University of Hong Kong, Pokfulam Road, Hong Kong

    Cho-Li Wang

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Saha, S., Aslam, M., Kumar, R. (2010). Assessing the Performance of Bi-objective MST for Euclidean and Non-Euclidean Instances. In: Ranka, S., et al. Contemporary Computing. IC3 2010. Communications in Computer and Information Science, vol 94. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14834-7_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14834-7_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14833-0

  • Online ISBN: 978-3-642-14834-7

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation