Journal of Korean Institute of Industrial Engineers (대한산업공학회지)

Korean Institute of Industrial Engineers (대한산업공학회)
권호 표지

A New Tree Representation for Evolutionary Algorithms

진화 알고리듬을 위한 새로운 트리 표현 방법

  • Soak, Sang-Moon (Department of Mechatronics, Gwangju Institute of Science and Technology) ;
  • Ahn, Byung-Ha (Department of Mechatronics, Gwangju Institute of Science and Technology)
  • 석상문 (광주과학기술원 기전공학과) ;
  • 안병하 (광주과학기술원 기전공학과)
  • Published : 2005.03.30
Download PDF
⟨ Previous Next ⟩

Abstract

The minimum spanning tree (MST) problem is one of the traditional optimization problems. Unlike the MST, the degree constrained minimum spanning tree (DCMST) of a graph cannot, in general, be found using a polynomial time algorithm. So, finding the DCMST of a graph is a well-known NP-hard problem of importance in communications network design, road network design and other network-related problems. So, it seems to be natural to use evolutionary algorithms for solving DCMST. Especially, when applying an evolutionary algorithm to spanning tree problems, a representation and search operators should be considered simultaneously. This paper introduces a new tree representation scheme and a genetic operator for solving combinatorial tree problem using evolutionary algorithms. We performed empirical comparisons with other tree representations on several test instances and could confirm that the proposed method is superior to other tree representations. Even it is superior to edge set representation which is known as the best algorithm.

Keywords

References

  1. Abuali, F.N., Wainwright, R.L and Schoenefeld, D.A.(1995), Determinant Factorization: A New Encoding Scheme for Spanning Trees Applied to the Probabilistic Minimum Spanning Tree Problem, in Proceedings of The Sixth International Conference on Genetic Algorithms, 470-477
  2. Bean, J. C.(1994), Genetic algorithms and random keys for sequencing and optimization, ORSA Journal on Computing, 6(2), 154-160 https://doi.org/10.1287/ijoc.6.2.154
  3. Dengiz, B., Altiparmak, F., and Smith, A.E.(1997), Local Search Genetic Algorithm for Optimal Design of Reliable Networks, IEEE Transactions on Evolutionary Computation, 1(3), 179-188 https://doi.org/10.1109/4235.661548
  4. Garey, M.R. and Johnson, D.S.(1979), Computers and Intractability, A Guide to the Theory of NP-Completeness, San Francisco, Freeman
  5. Gen, M. and Cheng,R.(l997), Genetic Algorithms and Engineering Design, JOHN WILEY& SONS
  6. Gottlieb, J., Julstrom, G.A., Raidl, G.R. and Rothlauf, F.(200l), Prufer number: A Poor Representation of Spanning Trees for Evolutionary Search, IlliGAL Report No.2001001, Illinois Genetic Algorithms Lab., Univ. of Illinois
  7. Krishnamoorthy, M., Ernst,A.T. and Sharaiha, Y.M.(2001), Comparision of Algorithms for the Degree Constrained Minimum Spanning Tree, Journalof Heuristics, 7, 587-611 https://doi.org/10.1023/A:1011977126230
  8. Yu Li,(2001), An Effective Implementation of a Direct Spanning Tree Representation in GAs, EvoWorkshop 2001, LNCS 2037, 11-19
  9. Michalewicz, Z.(l992), Genetic Algorithms+Data Structures= Evolution Programs
  10. Narula, S.C. and Ho, C.A.(1980), Degree-constrained minimum spanning tree, Computer and Operations Research, 7, 239-249 https://doi.org/10.1016/0305-0548(80)90022-2
  11. Piggott, P. and Suraweera, F.(l995), Encoding graphs for genetic algorithms: An investigation using the minimum spanning tree problem. Progress in Evolutionary Computation, LNAI 956, 305-314
  12. Raidl, G.R. and Julstrorn, B.A.(2003), Edge-Sets: An Effective Evolutionary Codingof Spanning Trees, IEEE Transactions on Evolutionary Computation, 7(3),225-239 https://doi.org/10.1109/TEVC.2002.807275
  13. Raild, G.R. and Drexel, C.(2000) A Predecessor Coding in an Evolutionary Algorithm for the Capacitated Minimum Spanning Tree Problem, Late-Breaking-Papera, Proc. of the 2000 Genetic and Evolutionary computation Conference, 309-316
  14. Rothlauf, F., Goldberg, D.E. and Heinzl, A.(2002), Network Random Keys-A Tree Network Representation Scheme for Genetic and Evolutionary Algorithms, Evolutionary Computation, 10(1), 75-97 https://doi.org/10.1162/106365602317301781
  15. Schindler, B., Rothlauf, F. and Pesch, H.J.(2002), Evolution Strategies, Network Random Keys, and the One-Max Tree Problem, LNCS 2279,143-152
  16. Soak, S.M., David Corne and Ahn, B.H.(2004) A New Encoding for the Degree Constrained Minimum Spanning Tree Problem, KES2004, LNAI 3213, 952-958
  17. Zhou, G. and Gen, M.(1998), An Effective Genetic Algorithm Approach to The Quadratic Minimum Spanning Tree Problem, Computers & Operations Researches, 25(3),229-237 https://doi.org/10.1016/S0305-0548(97)00039-7