Skip to main content
SpringerLink
Log in

A heuristic based harmony search algorithm for maximum clique problem

  • Application Article
  • Published:
OPSEARCH Aims and scope Submit manuscript

Abstract

The maximum clique problem (MCP) is to determine a complete subgraph (clique) of maximum cardinality in a given graph. MCP is conspicuous for having real world applications and for its potentiality of modeling other combinatorial problems and is one of the most studied NP-hard problems. This paper investigates the capabilities of Harmony Search (HS) algorithm, a music inspired meta heuristic for solving maximum clique problem. We propose and compare two different instantiations of a generic HS algorithm namely Harmony Search for MCP (HS_MCP) and Harmony Search with idiosyncratic harmonies for MCP (HSI_MCP) for this problem. HS_MCP has better exploitation and inferior exploration capabilities than HSI_MCP whereas HSI_MCP has better exploration and inferior exploitation capabilities than HSI_MCP, it has been concluded that former performs better than latter by testing them on all the instances of DIMACS benchmark graphs. HS_MCP has been compared with a recently proposed Harmony search based algorithm for MCP called Binary Harmony search (BHS) and the simulation results show that HS_MCP significantly outperforms BHS in terms of solution quality. The asymptotic time complexity of HS_MCP is \(O(G \times N^3)\) where G is the number of generations and N is the number of nodes in the graph. A glimpse of effectiveness of some state-of-the-art exact algorithms on MCP has also been provided.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2

Similar content being viewed by others

References

  1. Afkhami, S., Ma, O.R., Soleimani, A.: A binary harmony search algorithm for solving the maximum clique problem. Int. J. Comput. Appl. 69(12), 38–43 (2013)

    Google Scholar 

  2. Andrade, D.V., Resende, M.G., Werneck, R.F.: Fast local search for the maximum independent set problem. J. Heuristics 18(4), 525–547 (2012)

    Article  Google Scholar 

  3. Assad, A., Deep, K.: Applications of harmony search algorithm in data mining: a survey. In: Proceedings of Fifth International Conference on Soft Computing for Problem Solving, pp. 863–874. Springer, (2016)

  4. Balasundaram, B., Butenko, S.: Graph domination, coloring and cliques in telecommunications. In: Resende, M.G.C., Pardalos P.M. (eds.) Handbook of Optimization in Telecommunications, pp. 865–890. Springer, Boston (2006)

  5. Balasundaram, B., Butenko, S., Hicks, I.V.: Clique relaxations in social network analysis: the maximum k-plex problem. Oper. Res. 59(1), 133–142 (2011)

    Article  Google Scholar 

  6. Batsyn, M., Goldengorin, B., Maslov, E., Pardalos, P.M.: Improvements to MCS algorithm for the maximum clique problem. J. Comb. Optim. 27(2), 397–416 (2014)

    Article  Google Scholar 

  7. Battiti, R., Protasi, M.: Reactive local search for the maximum clique problem 1. Algorithmica 29(4), 610–637 (2001)

    Article  Google Scholar 

  8. Benlic, U., Hao, J.-K.: Breakout local search for maximum clique problems. Comput. Oper. Res. 40(1), 192–206 (2013)

    Article  Google Scholar 

  9. Boginski, V., Butenko, S., Pardalos, P.M.: Mining market data: a network approach. Comput. Oper. Res. 33(11), 3171–3184 (2006)

    Article  Google Scholar 

  10. Bomze, I.M., Budinich, M., Pardalos, P.M., Pelillo, M.: The maximum clique problem. In: Du, DZ., Pardalos, P.M. (eds.) Handbook of combinatorial optimization, pp. 1–74. Springer, Boston, (1999)

  11. Brunato, M., Battiti, R.: R-EVO: a reactive evolutionary algorithm for the maximum clique problem. IEEE Trans. Evol. Comput. 15(6), 770–782 (2011)

    Article  Google Scholar 

  12. Carraghan, R., Pardalos, P.M.: An exact algorithm for the maximum clique problem. Oper. Res. Lett. 9(6), 375–382 (1990)

    Article  Google Scholar 

  13. Carter, B., Park, K.: How Good are Genetic Algorithms at Finding Large Cliques: An Experimental Study. Citeseer, Princeton (1993)

    Google Scholar 

  14. Carter, M.W., Johnson, D.: Extended clique initialisation in examination timetabling. J. Oper. Res. Soc. 52, 538–544 (2001)

    Article  Google Scholar 

  15. Carter, M.W., Laporte, G., Lee, S.Y.: Examination time tabling: algorithmic strategies and applications. J. Oper. Res. Soc. 47, 373–383 (1996)

    Article  Google Scholar 

  16. Chen, F., Zhai, H., Fang, Y.: Available bandwidth in multirate and multihop wireless ad hoc networks. IEEE J. Sel. Areas Commun. 28(3), 299–307 (2010)

    Article  Google Scholar 

  17. Diao, R., Shen, Q.: Feature selection with harmony search. IEEE Trans. Syst. Man Cybern. Part B Cybern. 42(6), 1509–1523 (2012)

    Article  Google Scholar 

  18. Dorndorf, U., Jaehn, F., Pesch, E.: Modelling robust flight-gate scheduling as a clique partitioning problem. Transp. Sci. 42(3), 292–301 (2008)

    Article  Google Scholar 

  19. Engebretsen, L., Holmerin, J.: Towards optimal lower bounds for clique and chromatic number. Theoret. Comput. Sci. 299(1), 537–584 (2003)

    Article  Google Scholar 

  20. Etzion, T., Ostergard, P.R.: Greedy and heuristic algorithms for codes and colorings. IEEE Trans. Inf. Theory 44(1), 382–388 (1998)

    Article  Google Scholar 

  21. Fattahi, H., Gholami, A., Amiribakhtiar, M.S., Moradi, S.: Estimation of asphaltene precipitation from titration data: a hybrid support vector regression with harmony search. Neural Comput. Appl. 26(4), 789–798 (2015)

    Article  Google Scholar 

  22. Feige, U.: Approximating maximum clique by removing subgraphs. SIAM J. Discret. Math. 18(2), 219–225 (2004)

    Article  Google Scholar 

  23. Feige, U., Goldwasser, S., Lovász, L., Safra, S., Szegedy, M.: Approximating clique is almost NP-complete (preliminary version). In: SFCS '91 Proceedings of the 32nd annual symposium on Foundations of computer science, pp. 2–12, IEEE Computer Society Washington, San Juan, Puerto Rico, 1–4 Oct 1991. doi:10.1109/SFCS.1991.185341

  24. Geem, Z.W.: Optimal cost design of water distribution networks using harmony search. Eng. Optim. 38(03), 259–277 (2006)

    Article  Google Scholar 

  25. Geem, Z.W., Kim, J.H., Loganathan, G.: A new heuristic optimization algorithm: harmony search. Simulation 76(2), 60–68 (2001)

    Article  Google Scholar 

  26. Geem, Z.W., Lee, K.S., Park, Y.: Application of harmony search to vehicle routing. Am. J. Appl. Sci. 2(12), 1552–1557 (2005)

    Article  Google Scholar 

  27. Geng, X., Xu, J., Xiao, J., Pan, L.: A simple simulated annealing algorithm for the maximum clique problem. Inf. Sci. 177(22), 5064–5071 (2007)

    Article  Google Scholar 

  28. Gholizadeh, S., Barzegar, A.: Shape optimization of structures for frequency constraints by sequential harmony search algorithm. Eng. Optim. 45(6), 627–646 (2013)

    Article  Google Scholar 

  29. Ravetti, M.G., Moscato, P.: Identification of a 5-protein biomarker molecular signature for predicting Alzheimers disease. PLoS ONE 3(9), e3111 (2008)

    Article  Google Scholar 

  30. Hadwan, M., Ayob, M., Sabar, N.R., Qu, R.: A harmony search algorithm for nurse rostering problems. Inf. Sci. 233, 126–140 (2013)

    Article  Google Scholar 

  31. Håstad, J.: Clique is hard to approximate within \(n^{1-\epsilon }\). In: 37th Annual Symposium on Foundations of Computer Science, 1996. Proceedings, pp. 627–636. IEEE, (1996)

  32. Hoang, D.C., Yadav, P., Kumar, R., Panda, S.K.: Real-time implementation of a harmony search algorithm-based clustering protocol for energy-efficient wireless sensor networks. IEEE Trans. Ind. Inf. 10(1), 774–783 (2014)

    Article  Google Scholar 

  33. Jain, K., Padhye, J., Padmanabhan, V.N., Qiu, L.: Impact of interference on multi-hop wireless network performance. Wirel. Netw. 11(4), 471–487 (2005)

    Article  Google Scholar 

  34. Jin, Y., Hao, J.-K.: General swap-based multiple neighborhood tabu search for the maximum independent set problem. Eng. Appl. Artif. Intell. 37, 20–33 (2015)

    Article  Google Scholar 

  35. Karp, R.M.: Reducibility among combinatorial problems. Springer, New York (1972)

    Book  Google Scholar 

  36. Katayama, K., Hamamoto, A., Narihisa, H.: An effective local search for the maximum clique problem. Inf. Process. Lett. 95(5), 503–511 (2005)

    Article  Google Scholar 

  37. Li, C.M., Quan, Z.: An efficient branch and bound algorithm based on maxsat for the maximum clique problem. AAAI 10, 128–133 (2010)

    Google Scholar 

  38. Malod-Dognin, N., Andonov, R., Yanev, N.: Maximum cliques in protein structure comparison. In: Festa P. (eds) Experimental Algorithms, pp. 106–117. Springer, Berlin (2010)

  39. Manjarres, D., Landa-Torres, I., Gil-Lopez, S., Del Ser, J., Bilbao, M.N., Salcedo-Sanz, S., Geem, Z.W.: A survey on applications of the harmony search algorithm. Eng. Appl. Artif. Intell. 26(8), 1818–1831 (2013)

    Article  Google Scholar 

  40. Marchiori, E.: A simple heuristic based genetic algorithm for the maximum clique problem. In: Symposium on Applied Computing: Proceedings of the 1998 ACM Symposium on Applied Computing, vol. 27, pp. 366–373. Citeseer, (1998)

  41. Maslov, E., Batsyn, M., Pardalos, P.M.: Speeding up branch and bound algorithms for solving the maximum clique problem. J. Glob. Optim. 59(1), 1–21 (2014)

    Article  Google Scholar 

  42. McCreesh, C., Prosser, P.: Multi-threading a state-of-the-art maximum clique algorithm. Algorithms 6(4), 618–635 (2013)

    Article  Google Scholar 

  43. McCreesh, C., Prosser, P.: A parallel branch and bound algorithm for the maximum labelled clique problem. Optim. Lett. 9(5), 949–960 (2015)

    Article  Google Scholar 

  44. Nekooei, K., Farsangi, M.M., Nezamabadi-Pour, H., Lee, K.Y.: An improved multi-objective harmony search for optimal placement of DGs in distribution systems. IEEE Trans. Smart Grid 4(1), 557–567 (2013)

    Article  Google Scholar 

  45. Ordóñez-Guillén, N.E., Martínez-Pérez, I.M.: Heuristic search space generation for maximum clique problem inspired in biomolecular filtering. J. Signal Process. Syst. 83, 1–12 (2015)

    Google Scholar 

  46. Östergård, P.R.: A fast algorithm for the maximum clique problem. Discret. Appl. Math. 120(1), 197–207 (2002)

    Article  Google Scholar 

  47. Pardalos, P.M., Xue, J.: The maximum clique problem. J. Glob. Optim. 4(3), 301–328 (1994)

    Article  Google Scholar 

  48. Pattabiraman, B., Patwary, M.M.A., Gebremedhin, A.H., Liao, W.-K., Choudhary, A.: Fast algorithms for the maximum clique problem on massive graphs with applications to overlapping community detection. Internet Math. 11(4–5), 421–448 (2015)

    Article  Google Scholar 

  49. Pattillo, J., Youssef, N., Butenko, S.: Clique relaxation models in social network analysis. In: Thai, M., Pardalos, P. (eds.) Handbook of Optimization in Complex Networks, pp. 143–162. Springer, New York (2012)

  50. Pullan, W.: Phased local search for the maximum clique problem. J. Comb. Optim. 12(3), 303–323 (2006)

    Article  Google Scholar 

  51. Pullan, W., Mascia, F., Brunato, M.: Cooperating local search for the maximum clique problem. J. Heuristics 17(2), 181–199 (2011)

    Article  Google Scholar 

  52. San Segundo, P., Artieda, J.: A novel clique formulation for the visual feature matching problem. Appl. Intell. 43(2), 325–342 (2015)

    Article  Google Scholar 

  53. San Segundo, P., Lopez, A., Pardalos, P.M.: A new exact maximum clique algorithm for large and massive sparse graphs. Comput. Oper. Res. 66, 81–94 (2016)

    Article  Google Scholar 

  54. Solnon, C., Fenet, S.: A study of ACO capabilities for solving the maximum clique problem. J. Heuristics 12(3), 155–180 (2006)

    Article  Google Scholar 

  55. Tomita, E., Kameda, T.: An efficient branch-and-bound algorithm for finding a maximum clique with computational experiments. J. Glob. Optim. 37(1), 95–111 (2007)

    Article  Google Scholar 

  56. Tomita, E., Seki, T.: An efficient branch-and-bound algorithm for finding a maximum clique. Discrete Math. Theor. Comput. Sci. Springer 3, 278–289 (2003)

    Article  Google Scholar 

  57. Tomita, E., Sutani, Y., Higashi, T., Takahashi, S., Wakatsuki, M.: A simple and faster branch-and-bound algorithm for finding a maximum clique. In: WALCOM: Algorithms and computation, pp. 191–203. Springer, (2010)

  58. Wang, L., Li, L.-P.: An effective differential harmony search algorithm for the solving non-convex economic load dispatch problems. Int. J. Electr. Power Energy Syst. 44(1), 832–843 (2013)

    Article  Google Scholar 

  59. Wu, Q., Hao, J.-K.: A review on algorithms for maximum clique problems. Eur. J. Oper. Res. 242(3), 693–709 (2015a)

    Article  Google Scholar 

  60. Wu, Q., Hao, J.-K.: Solving the winner determination problem via a weighted maximum clique heuristic. Expert Syst. Appl. 42(1), 355–365 (2015b)

    Article  Google Scholar 

  61. Yang, G., Yi, J., Zhang, Z., Tang, Z.: A TCNN filter algorithm to maximum clique problem. Neurocomputing 72(4), 1312–1318 (2009)

    Article  Google Scholar 

  62. Zhang, Q., Sun, J., Tsang, E.: An evolutionary algorithm with guided mutation for the maximum clique problem. IEEE Trans. Evol. Comput. 9(2), 192–200 (2005)

    Article  Google Scholar 

  63. Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. In: Proceedings of the Thirty-Eighth Annual ACM Symposium on Theory of Computing, pp. 681–690. ACM, (2006)

Download references

Acknowledgements

The first author would like to acknowledge QIP Centre Indian Institute of Technology Roorkee, India and All India Council for Technical Education (AICTE) for sponsoring his research.

Author information

Authors and Affiliations

  1. Department of Mathematics, Indian Institute of Technology Roorkee, Roorkee, 247667, India

    Assif Assad & Kusum Deep

Authors
  1. Assif Assad
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Kusum Deep
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Assif Assad.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Assad, A., Deep, K. A heuristic based harmony search algorithm for maximum clique problem. OPSEARCH 55, 411–433 (2018). https://doi.org/10.1007/s12597-017-0325-6

Download citation

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s12597-017-0325-6

Keywords

Search

Navigation