Advertisement

Solving Graph Partitioning Problems with Parallel Metaheuristics

  • Zbigniew KokosińskiEmail author
  • Marcin Bała
Chapter
Part of the Studies in Computational Intelligence book series (SCI, volume 717)

Abstract

In this article we describe computer experiments while testing a family of parallel and hybrid metaheuristics against a small set of graph partitioning problems like clustering, partitioning into cliques and coloring. In all cases the search space is composed of vertex partitions satisfying specific problem requirements. The solver application contains two sequential and nine parallel/hybrid algorithms developed on the basis of SA and TS metaheuristics. A number of tests are reported and conclusions concerning metaheuristics’ performance that result from the conducted experiments are derived. The article provides a case study in which partitioning numbers \(\psi _{k}(G)\), \(k \ge 2\), of DIMACS graph coloring instances are evaluated experimentally by means of H-SP metaheuristic which is found to be the most efficient in terms of solution quality.

Keywords

Simulated annealing Tabu search Parallel metaheuristic Hybrid metaheuristic Graph partitioning problem Graph partitioning number 

References

  1. 1.
    Ausiello, G., et al.: Complexity and Approximation – Combinatorial Optimization Problems and Their Approximability Properties. Springer, Berlin (1999)zbMATHGoogle Scholar
  2. 2.
    Blum, C., Roli, A., Alba, E.: An introduction to metaheuristic techniques. In: Alba, E., et al. (eds.) Parallel Metaheuristics, pp. 3–42. Wiley-Interscience, New York (2005)Google Scholar
  3. 3.
    Brandes, U., Gaertler, M., Wagner, D.: Experiments on graph clustering algorithms. Lect. Notes Comp. Sci. (2003). doi: 10.1007/978-3-540-39658-1-52
  4. 4.
    Byun, C.-Y.: Lower bound for large-scale set partitioning problems. ZIB-Report 12, 18–22 (2001)Google Scholar
  5. 5.
    Charon, I., Hudry, O.: Noising methods for a clique partitioning problem. Discret. Appl. Math. (2006). doi: 10.1016/j.dam.2005.05.029
  6. 6.
    Coslovich, L., Pesenti, R., Ukovich, W.: Large-scale set partitioning problems. J. Comput. 13, 191–209 (2001)Google Scholar
  7. 7.
    Crawford, B., Castro, C.: ACO with Lookahead Procedures for Solving Set Partitioning and Covering Problems. Proc. of workshop on combination of metaheuristic and local search with constraint programming techniques, Nantes, France (2005)Google Scholar
  8. 8.
  9. 9.
  10. 10.
    Garey, R., Johnson, D.S.: Computers and Intractability. A Guide to the Theory of NP-Completeness. Freeman, San Francisco (1979)zbMATHGoogle Scholar
  11. 11.
    Ji, X., Mitchell, J.E.: The clique partition problem with minimum clique size requirement. Discret. Optim. 4, 87–102 (2007)CrossRefzbMATHGoogle Scholar
  12. 12.
    Jin, Y., Hamiez, J.-P., Hao, J.-K.: Algorithms for the minimum sum coloring problem: a review. Artif. Intell. Rev. 47, 367–394 (2017). doi: 10.1007/s10462-016-9485-7
  13. 13.
    Kernighan, B.W., Lin, S.: An efficient heuristics procedure for partitioning graphs. Bell Syst. Tech. J. 49, 291–307 (1970)CrossRefzbMATHGoogle Scholar
  14. 14.
    Kokosiński, Z., Kwarciany, K.: On sum coloring of graphs with parallel genetic algorithms. Lect. Notes Comp. Sci. (2007). doi: 10.1007/978-3-540-71618-1_24 zbMATHGoogle Scholar
  15. 15.
    Kokosiński, Z., Kwarciany, K., Kołodziej, M.: Efficient graph coloring with parallel genetic algorithms. Comput. Inform. 24, 109–121 (2005)MathSciNetzbMATHGoogle Scholar
  16. 16.
    Kubale, M.: Some results concerning the complexity of restricted colorings of graphs. Discret. Appl. Math. 36, 35–46 (1992)MathSciNetCrossRefzbMATHGoogle Scholar
  17. 17.
    Kubale, M. (ed.): Graph Colorings. American Mathematical Society (2004)Google Scholar
  18. 18.
    Mujuni, E., Rosamond, F.: Parameterized complexity of the clique partition problem. In: The Australasian Theory Symposium, pp. 75–78 (2008)Google Scholar
  19. 19.
    Nowosielski, A., Kowalski, P.A., Kulczycki, P.: The column-oriented database partitioning optimization based on the natural computing algorithms. Proc. FedCSIS (2015). doi: 10.15439/2015F262
  20. 20.
    Sait, S.M., Youssef, H.: Iterative Computer Algorithms with Applications in Engineering. IEEE Computer Society, Los Alamitos (1999)zbMATHGoogle Scholar
  21. 21.
    Tseng, W.-D., Hwang, I.-S., Lee, L.-J., Yang, C.-Z.: Clique-partitioning connections-scheduling with faulty switches in dilated Benes network. J. Chin. Inst. Eng. 32, 853–860 (2009)CrossRefGoogle Scholar
  22. 22.
    Zhou, S.: Minimum partition of an independence system into independent sets. Discret. Optim. (2009). doi: 10.1016/j.disopt.2008.10.001

Copyright information

© Springer International Publishing AG 2018

Authors and Affiliations

  1. 1.Faculty of Electrical and Computer EngineeringCracow University of TechnologyKrakówPoland
  2. 2.Salumanus Sp. z o.o.KrakówPoland

Personalised recommendations