Solving NP-complete problems by harmony search

Research output: Chapter in Book/Report/Conference proceedingChapter

2 Citations (Scopus)

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 - Mar 25 2009

Publication series

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

Fingerprint

Computational complexity
Vehicle routing
Combinatorial optimization
Computer science
Bandwidth
Chemical analysis

All Science Journal Classification (ASJC) codes

  • Artificial Intelligence

Cite this

Mahdavi, M. (2009). Solving NP-complete problems by harmony search. In Z. W. Geem (Ed.), Music-Inspired Harmony Search Algorithm: Theory and Applications (pp. 53-70). (Studies in Computational Intelligence; Vol. 191). https://doi.org/10.1007/978-3-642-00185-7_4
Mahdavi, Mehrdad. / Solving NP-complete problems by harmony search. Music-Inspired Harmony Search Algorithm: Theory and Applications. editor / Zong Woo Geem. 2009. pp. 53-70 (Studies in Computational Intelligence).
@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",
month = "3",
day = "25",
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",

}

Mahdavi, M 2009, Solving NP-complete problems by harmony search. in ZW Geem (ed.), Music-Inspired Harmony Search Algorithm: Theory and Applications. Studies in Computational Intelligence, vol. 191, pp. 53-70. https://doi.org/10.1007/978-3-642-00185-7_4

Solving NP-complete problems by harmony search. / Mahdavi, Mehrdad.

Music-Inspired Harmony Search Algorithm: Theory and Applications. ed. / Zong Woo Geem. 2009. p. 53-70 (Studies in Computational Intelligence; Vol. 191).

Research output: Chapter in Book/Report/Conference proceedingChapter

TY - CHAP

T1 - Solving NP-complete problems by harmony search

AU - Mahdavi, Mehrdad

PY - 2009/3/25

Y1 - 2009/3/25

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=62649106188&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=62649106188&partnerID=8YFLogxK

U2 - 10.1007/978-3-642-00185-7_4

DO - 10.1007/978-3-642-00185-7_4

M3 - Chapter

SN - 9783642001840

T3 - Studies in Computational Intelligence

SP - 53

EP - 70

BT - Music-Inspired Harmony Search Algorithm

A2 - Geem, Zong Woo

ER -

Mahdavi M. Solving NP-complete problems by harmony search. In Geem ZW, editor, Music-Inspired Harmony Search Algorithm: Theory and Applications. 2009. p. 53-70. (Studies in Computational Intelligence). https://doi.org/10.1007/978-3-642-00185-7_4