Journal of Institute of Control, Robotics and Systems (제어로봇시스템학회논문지)

Institute of Control, Robotics and Systems (제어로봇시스템학회)
권호 표지
DOI QR코드

DOI QR Code

A Spanning Tree-based Representation and Its Application to the MAX CUT Problem

신장 트리 기반 표현과 MAX CUT 문제로의 응용

  • 현수환 (서경대학교 전자공학과) ;
  • 김용혁 (광운대학교 컴퓨터소프트웨어학과) ;
  • 서기성 (서경대학교 전자공학과)
  • Received : 2012.08.14
  • Accepted : 2012.11.04
  • Published : 2012.12.01
Download PDF
⟨ Previous Next ⟩

Abstract

Most of previous genetic algorithms for solving graph problems have used a vertex-based encoding. We proposed an edge encoding based new genetic algorithm using a spanning tree. Contrary to general edge-based encoding, a spanning tree-based encoding represents only feasible partitions. As a target problem, we adopted the MAX CUT problem, which is well known as a representative NP-hard problem, and examined the performance of the proposed genetic algorithm. The experiments on benchmark graphs are executed and compared with vertex-based encoding. Performance improvements of the spanning tree-based encoding on sparse graphs was observed.

Keywords

References

  1. D. Avis, A. Hertz, and O. Marcotte, Graph Theory and Combinatorial Optimization, Springer, New York, USA, 2005.
  2. S.-H. Kim, Y.-H. Kim, and B.-R. Moon, "A hybrid genetic algorithm for the MAX CUT problem," In Proceedings of the Genetic and Evolutionary Computation Conference, pp. 416-423, 2001.
  3. R. Y. Pinter, "Optimal layer assignment for interconnect," Journal of VLSI Computing Systems, vol. 1, pp. 123-137. 1984.
  4. F. Barahona, M. Grotschel, M. Junger, and G. Reinelt, "An application of combinatorial optimization to statistical physics and circuit layout design," Operational Research, vol. 36, pp. 493-513, 1984.
  5. J. H. Holland, Genetic Algorithms in Search, Optimization and Machine Learning, Addison- Wesley, Reading, USA, 1989.
  6. Y.-H. Kim, Y.-K. Kwon, and B.-R. Moon, "Problem-Independent schema synthesis for genetic algorithms," Proc. of the Genetic and Evolutionary Computation Conference, pp. 1112-1122, 2003.
  7. Y.-H. Kim, "Linear transformation in pseudo-boolean functions," Proc. of the Genetic and Evolutionary Computation Conference, pp. 1117-1118, 2008.
  8. Y.-H. Kim and Y. Yoon, "Effect of changing the basis in genetic algorithms using binary encoding," KSII Transactions on Internet and Information Systems, vol. 2, no. 4, pp. 184-193, Aug. 2008. https://doi.org/10.3837/tiis.2008.04.002
  9. S. M. Antonio, D. Abraham, J. P. Juan, and C. Raúl, "High-performance VNS for the max-cut problem using commodity graphics hardware," Proc. of the 18th Mini Euro Conference on VNS, 2005.
  10. M. Armbruster, M. Fugenschuh, C. Helmberg, N. Jetchev, and A. Martin, "Hybrid genetic algorithm within branch-and-cut for the minimum graph bisection problem," Evolutionary Computation in Combinatorial Optimization, Lecture Notes in Computer Science, vol. 3906, pp. 1-12, 2006.
  11. S. Hyun, Y. Kim, and K. Seo, "A new genetic algorithm using spanning-tree-based encoding for the MAX CUT problem," Proc. of KIIS Spring Conference 2010, vol. 20, no. 2, pp. 231-234, 2010.
  12. Boost Library, http://boost.org.
  13. Open Beagle, http://beagle.gel.ulaval.ca.
  14. S. Poljak and Z. Tuza, "Maximum cuts and largest bipartite subgraphs," American mathematical Society, 20, 1993.
  15. T. N. Bui and B. R. Moon, "Genetic algorithm and graph partitioning," IEEE Transactions on Computers, vol. 45, no. 7, pp. 841-855, 1996. https://doi.org/10.1109/12.508322
  16. S. Ko, D. Kim, and B-Y. Kang, "A matrix-based genetic algorithm for structure learning of bayesian networks," International Journal of Fuzzy Logic and Intelligent Systems, vol. 11, no. 3, pp. 135-142, 2011. https://doi.org/10.5391/IJFIS.2011.11.3.135