IE interfaces (산업공학)

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

Improvement of Genetic Operations for Minimum Spanning Tree Application Problems

Minimum Spanning Tree 응용문제에 대한 유전연산의 개선

  • Koh, Shie-Gheun (Department of Industrial Engineering, Pukyoung National University) ;
  • Kim, Byung-Nam (Department of Industrial Engineering, Pukyoung National University)
  • Received : 20020100
  • Accepted : 20020500
  • Published : 2002.09.30
Download PDF
⟨ Previous Next ⟩

Abstract

Some extensions of minimum spanning tree problem are NP-hard problem in which polynomial-time solutions for them do not exist. Because of their complexity, recently some researcher have used the genetic algorithms to solve them. In genetic algorithm approach the Prufer number is usually used to represent a tree. In this paper we discuss the problem of the Prufer number encoding method and propose an improved genetic operation. Using a numerical comparison we demonstrate the excellence of the proposed method.

Keywords

References

  1. Bertsimas, D. (1990), The probabilistic minimum spanning tree problem, Networks, 20, 245-275
  2. Gen, M. and Cheng, R. (1997), Genetic Algorithms and Engineering Design, John Wiley and Sons, Inc
  3. Gilbert, E. (1967), Minimum cost communication networks, journal of Bell System: Technology, 9, 2209-2227
  4. Goldberg, D. E. (1989), Genetic Algorithms in Search, Optimization, and Machine Learning, Addison-Wesley
  5. Graham, R. and Hell, P. (1985), On the history of the minimum spanning tree problem, Annals of the History of the Computing, 7, 43-57
  6. Myung, Y. S., Lee, C. H. and Tcha, D. W. (1995), On the generalized minimum spanning tree problem, Networks, 26, 231-241
  7. Narula, S. and Ho, C.(1980), Degree-constrained minimum spanning tree, Computers and Operations Research, 7, 239-249
  8. Palmer, C. and Kershenbaum, A. (1995), An approach to a problem in network design using genetic algorithms, Networks, 26, 151-163
  9. Shiode, I., Nishida, T. and Namasuya, Y. (1981), Stochastic spanning tree problem, Discrete Applied Mathematics, 3, 263-273