A New Heuristic Optimization Algorithm: Harmony Search

Simulation

Volumn 76, Issue 2, 2001, Pages 60-68

  Geem, Zong Woo ^a   Kim, Joong Hoon ^a   Loganathan, G V ^b  

^a Korea University   (South Korea)

^b State University   (United States)

Author keywords

combinatorial optimi zation; Harmony search; heuristic algorithm; music; optimization

Indexed keywords

DYNAMIC PROGRAMMING; EVOLUTIONARY ALGORITHMS; LINEAR PROGRAMMING; NONLINEAR PROGRAMMING; PROBLEM SOLVING; SIMULATED ANNEALING; TRAVELING SALESMAN PROBLEM;

HARMONY SEARCH (HS);

HEURISTIC METHODS;

EID: 0034974417     PISSN: 00375497     EISSN: None     Source Type: Journal    
DOI: 10.1177/003754970107600201     Document Type: Article

References (19)

1. Kirkpatrick, S., Gelatt, C., and Vecchi, M. “Optimization by Simulated Annealing.” Science, Vol. 220, No. 4598, pp 671-680, 1983.
2. Metropolis et al., “Equations of state calculations by fast computing machines.” The Journal of Chemical Physics, Vol. 21, pp 1087-1092,1953.
3. Glover, F. “Heuristic for Integer Programming Using Surrogate Constraints.” Decision Sciences, Vol. 8, No. 1, pp 156-166, 1977.
4. Holland, J.H. Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, 1975.
5. Goldberg, D.E. Genetic Algorithms in Search Optimization and Machine Learning, Addison Wesley, 1989.
6. Schwefel, H.P. “On the Evolution of Evolutionary Computation.” In Computational Intelligence: Imitating Life, Zurada, J., Marks, R., and Robinson, C. (Editors), pp 116-124, IEEE Press, 1994.
7. Fogel, D.B. “A Comparison of Evolutionary Programming and Genetic Algorithms on Selected Constrained Optimization Problems.” SIMULATION, Vol. 64, No. 6, 399-406, 1995.
8. Fogel, L.J., Owens, A.J., and Walsh, M.J. Artificial Intelligence Through Simulated Evolution, John Wiley, Chichester, UK, 1966.
9. Koza, J.R. Genetic Programming: A Paradigm for Genetically Breeding Populations of Computer Programs to Solve Problems, Report No. STAN-CS-90-1314, Stanford University, 1990.
10. Tirro, F., Jazz: A History, W. W. Norton & Company, 1977.
11. Bracken, J. and McCormick, G.P., Selected Applications of Nonlinear Programming, John Wiley & Sons, 1968.
12. Himmelblau, D.M. Applied Nonlinear Programming, McGraw-Hill Book Company, 1972.
13. Homaifar, A., Qi, C.X. and Lai, S.H. “Constrained Optimization via Genetic Algorithms.” SIMULATION, Vol. 62, No. 4, pp 242-254, 1994.
14. Gabriele, G.A. and Ragsdell, K.M. “Large Scale Nonlinear Programming Using the Generalized Reduced Gradient Method.” ASME J. Mech. Des, Vol.102, 566-573, 1980.
15. Fujiwara, O. and Khang, D.B. “A Two-Phase Decomposition Method for Optimal Design of Looped Water Distribution Networks.” Water Resources Research, Vol. 26, No. 4, pp 539-549, 1990.
16. Fujiwara, O. and Khang, D.B. “Correction to a Two-Phase Decomposition Method for Optimal Design of Looped Water Distribution Networks.” Water Resources Research, Vol. 27, No. 5, pp 985-986, 1991.
17. Savic, D.A. and Walters, G.A. “Genetic Algorithms for Least-Cost Design of Water Distribution Networks.” Journal of Water Resources Planning and Management, ASCE, 123: 2, 67-77, 1997.
18. Cunha, M.D.C. and Sousa, J. “Water Distribution Network Design Optimization: Simulated Annealing Approach.” Journal of Water Resources Planning and Management, ASCE, Vol. 125, No, 4, pp 215-221, 1999.
19. Hofstadter, D. R. Goedel, ESCHER, BACH: An Eternal Golden Braid, Vintage Books, New York, 1979.