Solving NP-complete problems by harmony search

Research output: Chapter in Book/Report/Conference proceedingChapter

2 Scopus citations

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.

Original languageEnglish (US)
Title of host publicationMusic-Inspired Harmony Search Algorithm
Subtitle of host publicationTheory and Applications
EditorsZong Woo Geem
Pages53-70
Number of pages18
DOIs
StatePublished - 2009

Publication series

NameStudies in Computational Intelligence
Volume191
ISSN (Print)1860-949X

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence

Fingerprint

Dive into the research topics of 'Solving NP-complete problems by harmony search'. Together they form a unique fingerprint.

Cite this