Skip to main content
SpringerLink
Log in

Property Analysis and Enhancement in Recombination Operator of Edge-Set Encoding for Spanning Tree

  • Conference paper
Contemporary Computing (IC3 2011)

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

Included in the following conference series:

  • 1143 Accesses

Abstract

The spanning tree problem is a well-studied problem and Evolutionary Algorithms (EAs) have been successfully applied to a large variants of the spanning tree problem. The behavior of an evolutionary algorithm depends on the interaction between the encoding and the genetic operators that act on that encoding. Various encodings and operators have been proposed for the spanning tree problems in the literature. The edge-set encoding has been shown very effective for such problems as it shows high locality and high heritability. However, it requires effective genetic operators to exploit favorable characteristics of an encoding to guide the search and obtain high quality results. In this work, we consider bounded-diameter minimum spanning tree (BDMST) problem and improve upon the crossover operator for edge-set encoding. The empirical results show the effectiveness of our approach. Finally, based on the simulation results, we highlight interesting properties of the new recombination operator which helps it find better trees compared to the previous one.

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. Bala, K., Petropoulos, K., Stern, T.E.: Multicasting in a Linear Lightwave Network. In: IEEE INFOCOM 1993, pp. 1350–1358. IEEE Computer Society Press, Los Alamitos (1993)

    Google Scholar 

  2. Raymond, K.: A Tree-based Algorithm for Distributed Mutual Exclusion. ACM Transactions on Computer Systems 7(1), 61–67 (1989)

    Article  MathSciNet  Google Scholar 

  3. Bookstein, A., Klein, S.T.: Compression of Correlated Bit-Vectors. Information Systems 16(4), 387–400 (1996)

    Article  Google Scholar 

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

    Google Scholar 

  5. Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco (1979)

    MATH  Google Scholar 

  6. Kortsarz, G., Peleg, D.: Approximating Shallow-light Trees. In: Symposium on Discrete Algorithms, pp. 103–110 (1997)

    Google Scholar 

  7. Raidl, G.R., Julstrom, B.A.: Greedy Heuristics and an Evolutionary Algorithm for the Bounded-Diameter Minimum Spanning Tree Problem. In: ACM Symposium on Applied Computing, pp. 747–752 (2003)

    Google Scholar 

  8. Raidl, G.R., Julstrom, B.A.: A Permutation Coded Evolutionary for the Bounded Diameter Minimum Spanning Tree Problem. In: Genetic and Evolutionary Computation Conference, pp. 2–7 (2003)

    Google Scholar 

  9. Achuthan, N.R., Caccetta, L., Cacetta, P., Geelen, J.F.: Algorithms for the Minimum Weight Spanning Tree with Bounded Diameter Problem Optimization. Australian Journal of Combinatorics 10, 51–57 (1994)

    MATH  Google Scholar 

  10. Gruber. M., Raidl, G.R.: A New 0-1 ILP Approach for the Bounded Diameter Minimum Spanning Tree Problem. In: International Network Optimization Conference (2005)

    Google Scholar 

  11. 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 

  12. Prim, R.: Shortest Connection Networks and Some Generalization. Bell System Technical Journal 36, 1389–1401 (1957)

    Article  Google Scholar 

  13. Julstrom, B.A.: Encoding bounded-diameter spanning trees with permutations and with random keys. In: Deb, K., et al. (eds.) GECCO 2004. LNCS, vol. 3102, pp. 1272–1281. Springer, Heidelberg (2004)

    Chapter  Google Scholar 

  14. Julstrom, B.A.: Greedy Heuristics for the Bounded-Diameter Minimum Spanning Tree Problem. ACM J. Exp. Algorithmics (2004)

    Google Scholar 

  15. Gruber, M., Raidl, G.R.: Variable Neighbourhood Search for the Bounded Diameter Minimum Spanning Tree Problem. In: 18th Mini Euro Conference on Variable Neighborhood Search, Spain (2006)

    Google Scholar 

  16. Gruber, M., Hemert, J., Raidl, G.R.: Neighborhood Searches for the Bounded Diameter Minimum Spanning Tree Problem Embedded in a VNS, EA and ACO. In: Genetic and Evolutionary Computational Conference, pp. 1187–1194 (2006)

    Google Scholar 

  17. Singh, A., Gupta, A.K.: An Improved Heuristic for the Bounded Diameter Minimum Spanning Tree Problem. Journal of Soft Computing 11, 911–921 (2007)

    Article  Google Scholar 

  18. 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. In: Genetic and Evolutionary Computational Conference. pp. 373–380 (2009)

    Google Scholar 

  19. Goldberg, D.E., Lingle, J.R.: Alleles, Loci, and the Travelling Salesman Problem. In: International Conference on Genetic Algorithms, pp. 154–159 (1985)

    Google Scholar 

  20. Beasley, J.E.: OR-library: Distributing Test Problems by Electronic Mail. Journal of the Operational Research Society 41, 1069–1072 (1990)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computational Intelligence and Data Mining Research Laboratory, ABV-Indian Institute of Information Technology and Management, Gwalior, India

    P. K. Singh & Abhishek Vaid

Authors
  1. P. K. Singh
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Abhishek Vaid
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Iowa State University and IIT Bombay, India, 329 Durham, Ames, IA 5001, Iowa, USA

    Srinivas Aluru

  2. Indian Statistical Institute, 203 B.T. Road, 700 108, Kolkata, West Bengal, India

    Sanghamitra Bandyopadhyay

  3. The Ohio State University, 3190 Graves Hall, 333 W 10th Ave, 43210, Columbus, OH, USA

    Umit V. Catalyurek

  4. Department of Computing Science, Chalmers University, Rännvagen 6B, 412 96, Göteborg, Sweden

    Devdatt P. Dubhashi

  5. Dept. of Electrical and Computer Engineering, Iowa State University, 329 Durham, IA 50011, Ames, USA

    Phillip H. Jones

  6. TASSL, Dept. of Electrical & Computer Engineering, Rutgers, The State University of New Jersey, Brett Road, NJ 08854-8058, Piscataway, USA

    Manish Parashar

  7. School of Computer Engineering, Nanyang Technological University, N4-02a-32 Nanyang Ave, 639798, Singapore

    Bertil Schmidt

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Singh, P.K., Vaid, A. (2011). Property Analysis and Enhancement in Recombination Operator of Edge-Set Encoding for Spanning Tree. In: Aluru, S., et al. Contemporary Computing. IC3 2011. Communications in Computer and Information Science, vol 168. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-22606-9_20

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-22606-9_20

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-22605-2

  • Online ISBN: 978-3-642-22606-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation