Information Technology Reference
In-Depth Information
8 Conclusions
This chapter reviewed HS applications in solving various NP-complete problems in
computer science including the Sudoku puzzle, music composition, generalized orien-
teering problem, vehicle routing, multicast routing, and document clustering. The
computational results showed that HS has had comparative advantages to other meta-
heuristic algorithms in all of these problems and the HS algorithm possesses a poten-
tial for obtaining good solutions in a variety of optimization problems.
For future study, one of the most important research directions is the theoretical
analysis of HS. Since there was no research on the convergence of the HS algorithm,
such work will have a significant effect on the application of HS. Also, novel methods
to modify a pitch adjustment process when applying it to discrete-valued problems
(i.e., combinatorial optimization problems) are the subject of more research. Last but
not least, with the above-mentioned successful applications, HS has shown its capa-
bility to be applied to other NP-complete problems.
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)
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)
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)
4. Ralley, D.: Genetic algorithms as a tool for melodic development. In: Proceedings of the
International Computer Music Conference, pp. 501-502 (1995)
5. Biles, J.A.: GenJam in perspective: a tentative taxonomy for GA music and art systems.
Leonardo 36, 43-45 (2003)
6. Geem, Z.W., Choi, J.-Y.: Music composition using harmony search algorithm. In: Giaco-
bini, M. (ed.) EvoWorkshops 2007. LNCS, vol. 4448, pp. 593-600. Springer, Heidelberg
(2007)
7. Wang, Q., Sun, C., Golden, B.L.: Using artificial neural networks to solve generalized ori-
enteering problems. In: Proceedings of Artificial Neural Networks in Engineering Confer-
ence (ANNIE 1996) (1996)
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)
9. Geem, Z.W., Tseng, C.-L., Park, Y.-J.: Harmony search for generalized orienteering prob-
lem: Best touring in china. In: Wang, L., Chen, K., S. Ong, Y. (eds.) ICNC 2005. LNCS,
vol. 3612, pp. 741-750. Springer, Heidelberg (2005)
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)
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)
12. Kompella, V.P., Pasquale, J.C., Polyzos, G.C.: Multicast routing for multimedia communi-
cation. IEEE/ACM Transactions on Networking 1, 286-292 (1993)
Search WWH ::




Custom Search