@inbook{caa02159b0634c7a878f9afa4ecedb1b,
title = "Solving NP-complete problems by harmony search",
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.",
author = "Mehrdad Mahdavi",
year = "2009",
doi = "10.1007/978-3-642-00185-7_4",
language = "English (US)",
isbn = "9783642001840",
series = "Studies in Computational Intelligence",
pages = "53--70",
editor = "Geem, {Zong Woo}",
booktitle = "Music-Inspired Harmony Search Algorithm",
}