Journal of Korean Society of Industrial and Systems Engineering (산업경영시스템학회지)

Society of Korea Industrial and System Engineering (한국산업경영시스템학회)
권호 표지

Economic Design of Tree Network Using Tabu List Coupled Genetic Algorithms

타부 리스트가 결합된 유전자 알고리즘을 이용한 트리형 네트워크의 경제적 설계

  • Lee, Seong-Hwan (Management Planning Division, Korea Fisheries Resources Agency) ;
  • Lee, Han-Jin (Division of Business Administration, Pukyong National University) ;
  • Yum, Chang-Sun (Division of Business Administration, Pukyong National University)
  • Received : 2011.06.10
  • Accepted : 2011.10.21
  • Published : 2012.03.31
Download PDF
⟨ Previous Next ⟩

Abstract

This paper considers an economic design problem of a tree-based network which is a kind of computer network. This problem can be modeling to be an objective function to minimize installation costs, on the constraints of spanning tree and maximum traffic capacity of sub tree. This problem is known to be NP-hard. To efficiently solve the problem, a tabu list coupled genetic algorithm approach is proposed. Two illustrative examples are used to explain and test the proposed approach. Experimental results show evidence that the proposed approach performs more efficiently for finding a good solution or near optimal solution in comparison with a genetic algorithm approach.

Keywords

References

  1. 김여근, 윤복식, 이상복; "메타 휴리스틱, 유전알고리듬․시뮬레이티드 어닐링․타부서치", 영지문화사, 1997.
  2. Ersoy, C. and Panwar, S. S.; "Topological Design of Interconnected LAN-MAN Networks," INFOCOM '92. Eleventh Annual Joint Conference of the IEEE Computer and Communications Societies, IEEE, 3 : 2260-2269, 1992.
  3. Gamvros, I., Golden, B., and Raghavan, S.; "The Multilevel Capacitated Minimum Spanning Tree Problem," Journal on Computing, 18(3) : 348-365, 2006.
  4. Papadimitriou, C. H.; "The Complexity of the Capacitated Tree Problem," Networks, 8 : 217-230, 1978. https://doi.org/10.1002/net.3230080306
  5. Sharaiha, Y. M., Gendreau, M., Laporte, G., and Osman, I. H.; "A Tabu Search Algorithm for the Capacitated Shortest Spanning Tree Problem," Networks, 29(3) : 161- 171, 1997. https://doi.org/10.1002/(SICI)1097-0037(199705)29:3<161::AID-NET4>3.0.CO;2-F
  6. Tate, D. M. and Smith, A. E.; "A Genetic Approach to the Quadratic Assignment Problem," Computers and Operations Research, 22(1) : 73-83, 1995. https://doi.org/10.1016/0305-0548(93)E0020-T
  7. Torres-Jiménez, J., Pinto-Elías, R., and García-Romero, A.; "A Simulated Annealing Approach for the Capacitated minimum Spanning Tree Problem," iccima, Third International Conference on Computational Intelligence and Multimedia Applications (ICCIMA'99) : 432, 1999.
  8. Zhou, G., Cao, Z., Cao, J., and Meng, Z.; "A Genetic Algorithm Approach on Capacitated Minimum Spanning Tree Problem," Computational Intelligence and Security, 2006 International Conference on, 215-218, 2006.