Table of Contents Author Guidelines Submit a Manuscript
Mathematical Problems in Engineering
Volume 2015, Article ID 238529, 10 pages
http://dx.doi.org/10.1155/2015/238529
Research Article

Moving Clusters within a Memetic Algorithm for Graph Partitioning

1Technical Laboratory, Atto Research, 225-18 Pangyoyeok-ro, Bundang-gu, Seongnam-si, Gyeonggi-do 463-400, Republic of Korea
2Department of Computer Science & Engineering, Kwangwoon University, 20 Kwangwoon-ro, Nowon-gu, Seoul 139-701, Republic of Korea
3Department of Computer Engineering, College of Information Technology, Gachon University, 1342 Seongnamdaero, Sujeong-gu, Seongnam-si, Gyeonggi-do 461-701, Republic of Korea

Received 23 September 2014; Accepted 7 January 2015

Academic Editor: John Gunnar Carlsson

Copyright © 2015 Inwook Hwang et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. Y. Kanizo, D. Hay, and I. Keslassy, “Palette: distributing tables in software-defined networks,” in Proceedings of the IEEE International Conference on Computer Communications, pp. 545–549, April 2013. View at Publisher · View at Google Scholar
  2. P. Wette, M. Draxler, and A. Schwabe, “MaxiNet: distributed emulation of software-defined networks,” in Proceedings of the IFIP Networking Conference, pp. 1–9, June 2014. View at Publisher · View at Google Scholar
  3. M. R. Garey and D. S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, W. H. Freeman, 1979. View at MathSciNet
  4. T. N. Bui and C. Jones, “Finding good approximate vertex and edge partitions is NP-hard,” Information Processing Letters, vol. 42, no. 3, pp. 153–159, 1992. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  5. Y.-H. Kim, “Improved implementation choices for iterative improvement partitioning algorithms on circuits,” in Proceedings of the International Conference on Computer Design, pp. 30–34, July 2008. View at Scopus
  6. Y. Yoon and Y.-H. Kim, “New bucket managements in iterative improvement partitioning algorithms,” Applied Mathematics & Information Sciences, vol. 7, no. 2, pp. 529–532, 2013. View at Publisher · View at Google Scholar · View at Scopus
  7. B. W. Kernighan and S. Lin, “An efficient heuristic procedure for partitioning graphs,” Bell System Technical Journal, vol. 49, no. 2, pp. 291–307, 1970. View at Publisher · View at Google Scholar
  8. C. Fiduccia and R. Mattheyses, “A Linear-time heuristic for improving network partitions,” in Proceedings of the Conference on Design Automation, pp. 175–181, June 1982. View at Publisher · View at Google Scholar
  9. D. S. Johnson, C. R. Aragon, L. A. McGeoch, and C. Schevon, “Optimization by simulated annealing. An experimental evaluation. Part I. Graph partitioning,” Operations Research, vol. 37, no. 6, pp. 865–892, 1989. View at Publisher · View at Google Scholar · View at Scopus
  10. T. N. Bui and B. R. Moon, “Genetic algorithm and graph partitioning,” IEEE Transactions on Computers, vol. 45, no. 7, pp. 841–855, 1996. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  11. R. Battiti and A. A. Bertossi, “Greedy, prohibition, and reactive heuristics for graph partitioning,” IEEE Transactions on Computers, vol. 48, no. 4, pp. 361–385, 1999. View at Publisher · View at Google Scholar · View at Scopus
  12. E. Rolland, H. Pirkul, and F. Glover, “Tabu search for graph partitioning,” Annals of Operations Research, vol. 63, no. 2, pp. 209–232, 1996. View at Publisher · View at Google Scholar · View at Scopus
  13. T. N. Bui and L. C. Strite, “An ant system algorithm for graph bisection,” in Proceedings of the Genetic and Evolutionary Computation Conference, pp. 43–51, July 2002.
  14. I. Hwang, Y.-H. Kim, and B.-R. Moon, “Multi-attractor gene reordering for graph bisection,” in Proceedings of the Genetic and Evolutionary Computation Conference, pp. 1209–1215, July 2006. View at Scopus
  15. Y.-H. Kim and B.-R. Moon, “Lock gain based graph partitioning,” Journal of Heuristics, vol. 10, no. 1, pp. 37–57, 2004. View at Publisher · View at Google Scholar · View at Scopus
  16. P. Merz and B. Freisleben, “Fitness landscapes, memetic algorithms, and greedy operators for graph bipartitioning,” Evolutionary Computation, vol. 8, no. 1, pp. 61–91, 2000. View at Publisher · View at Google Scholar · View at Scopus
  17. H. Mühlenbein and T. Mahnig, “Evolutionary optimization and the estimation of search distributions with applications to graph bipartitioning,” International Journal of Approximate Reasoning, vol. 31, no. 3, pp. 157–192, 2002. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  18. A. G. Steenbeek, E. Marchiori, and A. E. Eiben, “Finding balanced graph bi-partitions using a hybrid genetic algorithm,” in Proceedings of the IEEE International Conference on Evolutionary Computation, pp. 90–95, May 1998. View at Scopus
  19. Y. Yoon and Y.-H. Kim, “Vertex ordering, clustering, and their application to graph partitioning,” Applied Mathematics & Information Sciences, vol. 8, no. 1, pp. 135–138, 2014. View at Publisher · View at Google Scholar · View at Scopus
  20. S.-J. Kang and B.-R. Moon, “A hybrid genetic algorithm for multiway graph partitioning,” in Proceedings of the Genetic and Evolutionary Computation Conference, pp. 159–166, July 2000.
  21. J.-P. Kim and B.-R. Moon, “A hybrid genetic search for multi-way graph partitioning based on direct partitioning,” in Proceedings of the Genetic and Evolutionary Computation Conference, pp. 408–415, July 2001.
  22. Y.-H. Kim, A. Moraglio, Y. Yoon, and B.-R. Moon, “Geometric crossover for multiway graph partitioning,” in Proceedings of the Genetic and Evolutionary Computation Conference, pp. 1217–1224, July 2006. View at Scopus
  23. A. Moraglio, Y.-H. Kim, Y. Yoon, and B.-R. Moon, “Geometric crossovers for multiway graph partitioning,” Evolutionary Computation, vol. 15, no. 4, pp. 445–474, 2007. View at Publisher · View at Google Scholar · View at Scopus
  24. A. Moraglio, Y.-H. Kim, Y. Yoon, B.-R. Moon, and R. Poli, “Geometric crossover for permutations with repetitions: application to graph partitioning,” in Proceedings of the PPSN Workshop on Evolutionary Algorithms—Bridging Theory and Practice, September 2006.
  25. A. J. Soper, C. Walshaw, and M. Cross, “A combined evolutionary search and multilevel optimisation approach to graph-partitioning,” Journal of Global Optimization, vol. 29, no. 2, pp. 225–241, 2004. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  26. Y. Yoon, Y.-H. Kim, A. Moraglio, and B.-R. Moon, “Quotient geometric crossovers and redundant encodings,” Theoretical Computer Science, vol. 425, pp. 4–16, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  27. J. Kim, I. Hwang, Y.-H. Kim, and B.-R. Moon, “Genetic approaches for graph partitioning: a survey,” in Proceedings of the Genetic and Evolutionary Computation Conference, pp. 473–480, July 2011. View at Publisher · View at Google Scholar · View at Scopus
  28. S. Dutt and W. Deng, “A probability-based approach to VLSI circuit partitioning,” in Proceedings of the Design Automation Conference, pp. 100–105, June 1996.
  29. B. Krishnamurthy, “An improved min-cut algorithm for partitioning VLSI networks,” IEEE Transactions on Computers, vol. 33, no. 5, pp. 438–446, 1984. View at Publisher · View at Google Scholar · View at Scopus
  30. L. A. Sanchis, “Multiple-way network partitioning,” IEEE Transactions on Computers, vol. 38, no. 1, pp. 62–81, 1989. View at Publisher · View at Google Scholar · View at Scopus
  31. G. Laszewski, “Intelligent structural operators for the k-way graph partitioning problem,” in Proceedings of the International Conference on Genetic Algorithms, pp. 45–52, July 1991.
  32. H. Mühlenbein, “Parallel genetic algorithms in combinatorial optimization,” in Computer Science and Operations Research, O. Balci, R. Sharda, and S. Zenios, Eds., pp. 441–453, Pergamon, Oxford, UK, 1992. View at Google Scholar · View at MathSciNet
  33. S.-S. Choi and B.-R. Moon, “Normalization in genetic algorithms,” in Proceedings of the Genetic and Evolutionary Computation Conference, vol. 2723 of Lecture Notes in Computer Science, pp. 862–873, 2003. View at Publisher · View at Google Scholar
  34. 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, July 2001.
  35. Y.-H. Kim, Y.-K. Kwon, and B.-R. Moon, “Problem-independent schema synthesis for genetic algorithms,” in Proceedings of the Genetic and Evolutionary Computation Conference, pp. 1112–1122, July 2003.
  36. K. Seo, S. Hyun, and Y.-H. Kim, “An edge-set representation based on spanning tree for searching cut space,” IEEE Transactions on Evolutionary Computation, 2014. View at Publisher · View at Google Scholar
  37. Y.-H. Kim, Combinatorial optimization based on effective local search, genetic algorithms, and problem space analyses [Ph.D. thesis], Seoul National University, Seoul, Republic of Korea, 2005.
  38. Y.-H. Kim, “An enzyme-inspired approach to surmount barriers in graph bisection,” in Proceedings of the International Conference on Computational Science and Its Applications, vol. 5072 of Lecture Notes in Computer Science, pp. 841–851, 2008. View at Publisher · View at Google Scholar
  39. S. Dutt and W. Deng, “VLSI circuit partitioning by cluster-removal using iterative improvement techniques,” in Proceedings of the IEEE/ACM International Conference on Computer-Aided Design, pp. 194–200, November 1996. View at Scopus
  40. S. Dutt and W. Deng, “Cluster-aware iterative improvement techniques for partitioning large VLSI circuits,” ACM Transactions on Design Automation of Electronic Systems, vol. 7, no. 1, pp. 91–121, 2002. View at Publisher · View at Google Scholar · View at Scopus
  41. Y. Yoon and Y.-H. Kim, “An efficient genetic algorithm for maximum coverage deployment in wireless sensor networks,” IEEE Transactions on Cybernetics, vol. 43, no. 5, pp. 1473–1483, 2013. View at Publisher · View at Google Scholar · View at Scopus
  42. Y. Yoon, Y.-H. Kim, A. Moraglio, and B.-R. Moon, “A theoretical and empirical study on unbiased boundary-extended crossover for real-valued representation,” Information Sciences, vol. 183, no. 1, pp. 48–65, 2012. View at Publisher · View at Google Scholar · View at MathSciNet · View at Scopus
  43. B. Monien and R. Diekmann, “A local graph partitioning heuristic meeting bisection bounds,” in Proceedings of the SIAM Conference on Parallel Processing for Scientific Computing, March 1997.