Skip to main content
SpringerLink
Log in

Solving NP-Complete Problems by Harmony Search

  • Chapter
Book cover Music-Inspired Harmony Search Algorithm

Part of the book series: Studies in Computational Intelligence ((SCI,volume 191))

Abstract

In the last few years, there has been explosive growth in the application of Harmony Search (HS) in solving NP-complete problems in computer science. The success of the HS algorithm in finding relatively good solutions to these problems discriminates it as an affirmative alternative to other conventional optimization techniques. This chapter surveys the existing literature on the application of HS in combinatorial optimization problems. We begin by presenting HS based algorithms for solving problems such as Sudoku puzzle, music composition, orienteering problem, and vehicle routing. We then turn to solve a multicast routing problem with two constraints (i.e. bandwidth and delay constraints). Finally, we show how to apply HS to a clustering problem.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Geem, Z.W.: Harmony search algorithm for solving sudoku. In: Apolloni, B., Howlett, R.J., Jain, L. (eds.) KES 2007, Part I. LNCS (LNAI), vol. 4692, pp. 371–378. Springer, Heidelberg (2007)

    Chapter  Google Scholar 

  2. Nicolau, M., Ryan, C.: Solving sudoku with the gAuGE system. In: Collet, P., Tomassini, M., Ebner, M., Gustafson, S., Ekárt, A. (eds.) EuroGP 2006. LNCS, vol. 3905, pp. 213–224. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  3. Horner, A., Goldberg, D.E.: Genetic algorithms and computer-assisted music composition. In: Proceedings of the International Computer Music Conference, pp. 437–441 (1991)

    Google Scholar 

  4. Ralley, D.: Genetic algorithms as a tool for melodic development. In: Proceedings of the International Computer Music Conference, pp. 501–502 (1995)

    Google Scholar 

  5. Biles, J.A.: GenJam in perspective: a tentative taxonomy for GA music and art systems. Leonardo 36, 43–45 (2003)

    Article  Google Scholar 

  6. Geem, Z.W., Choi, J.-Y.: Music composition using harmony search algorithm. In: Giacobini, M. (ed.) EvoWorkshops 2007. LNCS, vol. 4448, pp. 593–600. Springer, Heidelberg (2007)

    Google Scholar 

  7. Wang, Q., Sun, C., Golden, B.L.: Using artificial neural networks to solve generalized orienteering problems. In: Proceedings of Artificial Neural Networks in Engineering Conference (ANNIE 1996) (1996)

    Google Scholar 

  8. Chao, I.M., Golden, B.L., Wasil, E.A.: A fast and effective heuristic for the orienteering problem. European Journal of Operational Research 88, 475–489 (1996)

    Article  MATH  Google Scholar 

  9. Geem, Z.W., Tseng, C.-L., Park, Y.-J.: Harmony search for generalized orienteering problem: Best touring in china. In: Wang, L., Chen, K., S. Ong, Y. (eds.) ICNC 2005. LNCS, vol. 3612, pp. 741–750. Springer, Heidelberg (2005)

    Google Scholar 

  10. Geem, Z.W., Lee, K.S., Park, Y.: Application of harmony search to vehicle routing. American Journal of Applied Sciences 2, 1552–1557 (2005)

    Article  Google Scholar 

  11. Koumousis, V.K., Georgiou, P.G.: Genetic algorithms in discrete optimization of steel truss roofs. ASCE J. Comp. in Civil Eng. 8, 309–325 (1994)

    Article  Google Scholar 

  12. Kompella, V.P., Pasquale, J.C., Polyzos, G.C.: Multicast routing for multimedia communication. IEEE/ACM Transactions on Networking 1, 286–292 (1993)

    Article  Google Scholar 

  13. Zhu, Q., Parsa, M., Garcia-Luna-Aceves, J.J.: A source based algorithm for delay-constrained minimum-cost multicasting. In: Proceedings of the fourteenth annual joint conference of the IEEE computer and communication societies, pp. 377–385 (1995)

    Google Scholar 

  14. Widyono, R.: The design and evaluation of routing algorithms for realtime channels. Technical report TR-94-024, University of California at Berkeley (1994)

    Google Scholar 

  15. Raghavan, S., Manimaran, G., Ram Murthy, C.S.: A re-arrangeable algorithm for the construction of delay-constrained dynamic multicast trees. IEEE/ACM Transactions on Networking 7, 514–529 (1999)

    Article  Google Scholar 

  16. Salama, H.F., Reeves, D.S., Viniotis, Y.: Evaluation of multicast routing algorithms for real-time communication on high-speed networks. IEEE Journal on Selected Areas in Communications 15, 332–345 (1997)

    Article  Google Scholar 

  17. Kun, Z., Yong, Q., Hong, Z.: Dynamic multicast routing algorithm for delay and delay variation-bounded Steiner tree problem. Knowledge-Based Systems 19, 554–564 (2006)

    Article  Google Scholar 

  18. Haghighat, A.T., Faez, K., Dehghan, M., Mowlaei, A., Ghahremani, Y.: GA-based heuristic algorithms for bandwidth-delay-constrained least-cost multicast routing. Computer Communications 27, 111–127 (2004)

    Article  Google Scholar 

  19. Galiasso, P., Wainwright, R.L.: A hybrid genetic algorithm for the point to multipoint routing problem with single split paths. In: Proceedings of ACM Symposium on Applied Computting, pp. 327–332 (2001)

    Google Scholar 

  20. Ericsson, M., Resende, M., Pardalos, J.M.: A genetic algorithm for the weight setting problem in OSPF routing. Journal of Combinatorial Optimization 6, 299–333 (2002)

    Article  MATH  MathSciNet  Google Scholar 

  21. Barolli, L., Koyama, A., Suganuma, T., Shiratori, N.: A GA-based QoS routing method for mobile Ad-Hoc networks. Journal of Interconnection Networks 4, 251–270 (2003)

    Article  Google Scholar 

  22. Zhang, Q., Lenug, Y.W.: An orthogonal genetic algorithm for multimedia multicast routing. IEEE Transactions on Evolutionary Computation 3, 53–62 (1999)

    Article  Google Scholar 

  23. Wang, X., Cao, J., Cheng, H., Huang, M.: QoS multicast routing for multimedia group communications using intelligent computational methods. Computer Communications 29, 2217–2229 (2006)

    Article  Google Scholar 

  24. Skorin-Kapov, N., Kos, M.: The application of Steiner trees to delay constrained multicast routing: a Tabu Search approach. In: Proceedings of the seventh international conference on telecommunications, pp. 443–448 (2003)

    Google Scholar 

  25. Prim, R.: Shortest connection networks and some generalizations. Bell System Technical Journal 36, 1389–1401 (1957)

    Google Scholar 

  26. Wang, H., Wang, J., Wang, H., Sun, Y.: TSDLMRA: an efficient multicast routing algorithm based on tabu search. Journal of Network and Computer Applications 27, 77–90 (2004)

    Article  Google Scholar 

  27. Zhang, B., Mouftah, H.: A destination-driven shortest path tree algorithm. In: Proceedings of the IEEE international conference on communications, pp. 2258–2262 (2002)

    Google Scholar 

  28. Yen, J.Y.: Finding the K-shortest loop-less paths in a network. Management Science 17, 712–716 (1971)

    Article  MATH  MathSciNet  Google Scholar 

  29. Glover, F., Laguna, M.: Tabu search. Kluwer Academic, Dordrecht (1997)

    MATH  Google Scholar 

  30. Wang, Z., Shi, B., Zhao, E.: Bandwidth-delay-constrained least-cost multicast routing based on heuristic genetic algorithm. Computer Communications 24, 685–692 (2001)

    Article  Google Scholar 

  31. Forsati, R., Mahdavi, M., Haghighat, M.T.: Bandwidth delay constrained least cost multicast routing. Computer Communications 31, 2505–2519 (2008)

    Article  Google Scholar 

  32. Forsati, R., Mahdavi, M., Haghighat, M.T.: An efficient algorithm for bandwidth delay constraint least cost multicast routing. In: Proceedings of IEEE Canadian Conference on Electrical and Computer Engineering, pp. 1641–1646 (2008)

    Google Scholar 

  33. Wang, Z., Crowcroft, J.: Quality of service for supporting multimedia applications. IEEE Journal on Selected Areas in Communications 14, 1228–1234 (1996)

    Article  Google Scholar 

  34. Jain, A.K., Murty, M.N., Flynn, P.J.: Data clustering: a review. ACM Computing Surveys (CSUR), 264–323 (1999)

    Google Scholar 

  35. Grira, N., Crucianu, M., Boujemaa, N.: Unsupervised and semi-supervised clustering: a brief survey. In: Proceedings of 7th ACM SIGMM international workshop on Multimedia information retrieval, pp. 9–16 (2005)

    Google Scholar 

  36. Raghavan, V.V., Birchand, K.: A clustering strategy based on a formalism of the reproductive process in a natural system. In: Proceedings of the Second International Conference on Information Storage and Retrieval, pp. 10–22 (1979)

    Google Scholar 

  37. Everitt, B.: Cluster analysis, 2nd edn. Halsted Press, New York (1980)

    MATH  Google Scholar 

  38. Salton, G., Buckley, C.: Term-weighting approaches in automatic text retrieval. Information Processing and Management 24, 513–523 (1988)

    Article  Google Scholar 

  39. Cios, K., Pedrycs, W., Swiniarski, R.: Data mining methods for knowledge discovery. Kluwer Academic Publishers, Dordrecht (1998)

    MATH  Google Scholar 

  40. Salton, G.: Automatic text processing: the transformation, analysis, and retrieval of information by computer. Addison-Wesley, Reading (1989)

    Google Scholar 

  41. Jones, G., Robertson, A.M., Santimetvirul, C., Willett, P.: Non-hierarchic document clustering using a genetic algorithm. Information Research 1 (1995)

    Google Scholar 

  42. Cui, X., Potok, T.E., Palathingal, P.: Document clustering using particle swarm optimization. In: Proceedings of IEEE Swarm Intelligence Symposium, pp. 185–191 (2005)

    Google Scholar 

  43. Labroche, N., Monmarche, N., Venturini, G.: AntClust: ant clustering and web usage mining. In: Cantú-Paz, E., Foster, J.A., Deb, K., Davis, L., Roy, R., O’Reilly, U.-M., Beyer, H.-G., Kendall, G., Wilson, S.W., Harman, M., Wegener, J., Dasgupta, D., Potter, M.A., Schultz, A., Dowsland, K.A., Jonoska, N., Miller, J., Standish, R.K. (eds.) GECCO 2003. LNCS, vol. 2723, pp. 25–36. Springer, Heidelberg (2003)

    Chapter  Google Scholar 

  44. Kennedy, J., Eberhart, R.C., Shi, Y.: Swarm intelligence. Morgan Kaufmann, New York (2001)

    Google Scholar 

  45. Omran, M., Salman, A., Engelbrecht, A.P.: Image classification using particle swarm optimization. In: Proceedings of the 4th Asia-Pacific Conference on Simulated Evolution and Learning, pp. 370–374 (2002)

    Google Scholar 

  46. Merwe, V.D., Engelbrecht, A.P.: Data clustering using particle swarm optimization. In: Proceedings of IEEE Congress on Evolutionary Computation, pp. 215–220 (2003)

    Google Scholar 

  47. Mahdavi, M., Chehregani, M.H., Abolhassani, H., Forsati, M.: Novel meta-heuristic algorithms for clustering web documents. Appl. Math. Comput. 201, 441–451 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  48. Forsati, R., Mahdavi, M., Kangavari, M.: Web page clustering using harmony search optimization. In: Proceedings of IEEE Canadian Conference on Electrical and Computer Engineering, pp. 1601–1604 (2008)

    Google Scholar 

  49. Text REtrieval Conference (1999) (accessed November 30, 2008), http://trec.nist.gov

  50. Krishna, K., Murty, M.N.: Genetic K-means algorithm. IEEE Transactions on Systems, Man and Cybernetics (Part B. Cybernetics) 29, 433–439 (1999)

    Article  Google Scholar 

  51. Zhong, S., Ghosh, J.: Generative model-based clustering of documents: a comparative study. Knowledge and Information Systems 8, 374–384 (2005)

    Article  Google Scholar 

  52. Some Software Packages (2005) (accessed November 30, 2008), http://www.cse.fau.edu/~zhong/software/index.htm

Download references

Author information

Authors and Affiliations

  1. Department of Computer Engineering, Sharif University of Technology, Tehran, Iran

    Mehrdad Mahdavi

Authors
  1. Mehrdad Mahdavi
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Westat, Rockville, MD, USA

    Zong Woo Geem

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this chapter

Cite this chapter

Mahdavi, M. (2009). Solving NP-Complete Problems by Harmony Search. In: Geem, Z.W. (eds) Music-Inspired Harmony Search Algorithm. Studies in Computational Intelligence, vol 191. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00185-7_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-00185-7_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-00184-0

  • Online ISBN: 978-3-642-00185-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation