A SOLUTION OF REAL-WORLD OCST PROBLEMS WITH A NEW TREE ENCODING-BASED GENETIC ALGORITHM

  • Authors:
  • Jong Ryul Kim;Kyeong-Hoon Do;Wan Young Chung;Il Seok Ko

  • Affiliations:
  • Division of Computer and Information Engineering, Dongseo University, Sasang-ku, Busan, Republic of Korea;Division of Computer and Information Engineering, Dongseo University, Sasang-ku, Busan, Republic of Korea;Division of Computer and Information Engineering, Dongseo University, Sasang-ku, Busan, Republic of Korea;Department of Computer and Multimedia, Dongguk University, Gyeongju, Gyeong-buk, Republic of Korea

  • Venue:
  • Cybernetics and Systems
  • Year:
  • 2008

Quantified Score

Hi-index 0.00

Visualization

Abstract

For embodying and implementing the ubiquitous computing environments, the recent increase in concern for communication systems has been leading the evolution of the theory and technology of the related fields. Among these network-related problems, the minimum spanning tree (MST) problems have many applications in the communication systems field, because they are solved as one of the conventional combinatorial optimization problems. In particular, the optimal communication spanning tree (OCST) problem is a famous application of the MST problem. The OCST problem is defined by finding a spanning tree that connects all nodes and satisfies their communication requirements for connecting all nodes. This OCST problem can be applied to many network optimization fields, such as network topology design, multicast tree configuration, and ad-hoc network or ubiquitous sensor network routing, etc. This paper presents a genetic algorithm with a new encoding method, which is based on the Prufer number (PN) and a clustering string, for solving the OCST problems. We will also demonstrate that the efficiency and effectiveness of our proposed method can be shown by several experimental results, employing the proposed method as the solution method of the OCST problems.