Skip to main content

Making the Edge-Set Encoding Fly by Controlling the Bias of Its Crossover Operator

  • Conference paper
Evolutionary Computation in Combinatorial Optimization (EvoCOP 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3448))

Abstract

Edge-sets encode spanning trees directly by listing their edges. Evolutionary operators for edge-sets may be heuristic, considering the weights of edges they include in offspring, or naive, including edges without regard to their weights. Crossover operators that heuristically prefer shorter edges are strongly biased towards minimum spanning trees (MST); EAs that apply heuristic crossover generally perform poorly on spanning tree problems whose optimum solutions are not very similar to MSTs. For the edge-set encoding, a modified heuristic crossover called γ-TX implements variable bias towards low-weight edges and thus towards MSTs. The bias can be set arbitrarily between the strong bias of the heuristic crossover operator, or being unbiased. An investigation into the performance of EAs using the γ-TX for randomly created OCST problems of different types and OCST test instances from the literature present good results when setting the crossover-specific parameter γ properly. The presented results suggest that the original heuristic crossover operator of the edge-sets should be substituted by the modified γ-TX operator that allows us to control the bias towards the MST.

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

Access this chapter

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. Hu, T.C.: Optimum communication spanning trees. SIAM Journal on Computing 3, 188–195 (1974)

    Article  MATH  MathSciNet  Google Scholar 

  2. Narula, S.C., Ho, C.A.: Degree-constrained minimum spanning trees. Computers and Operations Research 7, 239–249 (1980)

    Article  Google Scholar 

  3. Raidl, G.R., Julstrom, B.A.: Edge-sets: An effective evolutionary coding of spanning trees. IEEE Transactions on Evolutionary Computation 7, 225–239 (2003)

    Article  Google Scholar 

  4. Rothlauf, F.: Representations for Genetic and Evolutionary Algorithms, 1st edn. Studies on Fuzziness and Soft Computing, vol. 104. Springer, Heidelberg (2002)

    MATH  Google Scholar 

  5. Julstrom, B., Raidl, G.: Weight-biased edge-crossover in evolutionary algorithms for two graph problems. In: Lamont, G.B., et al. (eds.) Proceedings of the 16th ACM Symposium on Applied Computing, pp. 321–326. ACM Press, New York (2001)

    Google Scholar 

  6. Tzschoppe, C., Rothlauf, F., Pesch, H.J.: The edge-set encoding revisited: On the bias of a direct representation for trees. In: Deb, K., et al. (eds.) Proceedings of the Genetic and Evolutionary Computation Conference 2004, pp. 1174–1185. Springer, Heidelberg (2004)

    Google Scholar 

  7. Rothlauf, F., Tzschoppe, C.: On the bias and performance of the edge-set encoding. Technical Report 2004/11, Department of Information Systems, University of Mannheim (2004)

    Google Scholar 

  8. Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. J. Comput. System Sci. 43, 425–440 (1991)

    Article  MATH  MathSciNet  Google Scholar 

  9. Rothlauf, F., Gerstacker, J., Heinzl, A.: On the optimal communication spanning tree problem. Technical Report 15/2003, Department of Information Systems, University of Mannheim (2003)

    Google Scholar 

  10. Palmer, C.C.: An approach to a problem in network design using genetic algorithms. unpublished PhD thesis, Polytechnic University, Troy, NY (1994)

    Google Scholar 

  11. Berry, L.T.M., Murtagh, B.A., McMahon, G.: Applications of a genetic-based algorithm for optimal design of tree-structured communication networks. In: Proceedings of the Regional Teletraffic Engineering Conference of the International Teletraffic Congress, Pretoria, South Africa, pp. 361–370 (1995)

    Google Scholar 

  12. Raidl, G.R.: Various instances of optimal communication spanning tree problems. personal communciation (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Rothlauf, F., Tzschoppe, C. (2005). Making the Edge-Set Encoding Fly by Controlling the Bias of Its Crossover Operator. In: Raidl, G.R., Gottlieb, J. (eds) Evolutionary Computation in Combinatorial Optimization. EvoCOP 2005. Lecture Notes in Computer Science, vol 3448. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-31996-2_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-31996-2_19

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-31996-2

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics