Harmony Search for Generalized Orienteering Problem: Best Touring in China

  • Zong Woo Geem
  • Chung-Li Tseng
  • Yongjin Park
Part of the Lecture Notes in Computer Science book series (LNCS, volume 3612)


In order to overcome the drawbacks of mathematical optimization techniques, soft computing algorithms have been vigorously introduced during the past decade. However, there are still some possibilities of devising new algorithms based on analogies with natural phenomena. A nature-inspired algorithm, mimicking the improvisation process of music players, has been recently developed and named Harmony Search (HS). The algorithm has been successfully applied to various engineering optimization problems. In this paper, the HS was applied to a TSP-like NP-hard Generalized Orienteering Problem (GOP) which is to find the utmost route under the total distance limit while satisfying multiple goals. Example area of the GOP is eastern part of China. The results of HS showed that the algorithm could find good solutions when compared to those of artificial neural network.


Harmony Search Harmony Search Algorithm Harmony Memory Orienteering Problem Travel Salesperson Problem 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Fogel, L.J., Owens, A.J., Walsh, M.J.: Artificial Intelligence Though Simulated Evolution. John Wiley, Chichester (1966)Google Scholar
  2. 2.
    De Jong, K.: Analysis of the Behavior of a Class of Genetic Adaptive Systems. Ph.D. Thesis, University of Michigan, Ann Arbor, MI, USA (1975)Google Scholar
  3. 3.
    Koza, J.R.: Genetic Programming: A Paradigm for Genetically Breeding Populations of Computer Programs to Solve Problems. Report No. STA-CS-90-1314, Stanford University, Stanford, CA, USA (1990)Google Scholar
  4. 4.
    Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)Google Scholar
  5. 5.
    Goldberg, D.E.: Genetic Algorithms in Search Optimization and Machine Learning. Addison-Wesley, MA (1989)zbMATHGoogle Scholar
  6. 6.
    Glover, F.: Heuristic for Integer Programming using Surrogate Constraints. Decision Sciences 8(1), 156–166 (1977)CrossRefGoogle Scholar
  7. 7.
    Dorigo, M., Maniezzo, V., Colorni, A.: The Ant System: Optimization by a Colony of Cooperating Agents. IEEE Transactions on Systems, Man, and Cybernetics-Part B 26(1), 29–41 (1996)CrossRefGoogle Scholar
  8. 8.
    Kirkpatrick, S., Gelatt, C., Vecchi, M.: Optimization by Simulated Annealing. Science 220(4598), 671–680 (1983)CrossRefMathSciNetGoogle Scholar
  9. 9.
    Wang, Q., Sun, C., Golden, B.L.: Using Artificial Neural Networks to Solve Generalized Orienteering Problems. In: Proceedings of Artificial Neural Networks in Engineering Conference (ANNIE 1996) (1996)Google Scholar
  10. 10.
    Geem, Z.W., Kim, J.H., Loganathan, G.V.: A New Heuristic Optimization Algorithm: Harmony Search. Simulation 76(2), 60–68 (2001)CrossRefGoogle Scholar
  11. 11.
    Kim, J.H., Geem, Z.W., Kim, E.S.: Parameter Estimation of the Nonlinear Muskingum Model using Harmony Search. Journal of the American Water Resources Association 37(5), 1131–1138 (2001)CrossRefGoogle Scholar
  12. 12.
    Geem, Z.W., Kim, J.H., Loganathan, G.V.: Harmony Search Optimization: Application to Pipe Network Design. International Journal of Modelling and Simulation 22(2), 125–133 (2002)Google Scholar
  13. 13.
    Kang, S.L., Geem, Z.W.: A New Structural Optimization Method Based on the Harmony Search Algorithm. Computers and Structures 82(9-10), 781–798 (2004)CrossRefGoogle Scholar
  14. 14.
    Chao, I.-M., Golden, B.L., Wasil, E.A.: The Team Orienteering Problem. European Journal of Operational Research 88, 464–474 (1996)zbMATHCrossRefGoogle Scholar
  15. 15.
    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)zbMATHCrossRefGoogle Scholar
  16. 16.
    Tasgetiren, M.F., Smith, A.E.: A Genetic Algorithm for the Orienteering Problem. In: Proceedings of Congress on Evolutionary Computation 2000 (CEC 2000), pp. 1190–1195 (2000)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2005

Authors and Affiliations

  • Zong Woo Geem
    • 1
  • Chung-Li Tseng
    • 2
  • Yongjin Park
    • 3
  1. 1.Environmental Planning and Management ProgramJohns Hopkins UniversityRockvilleUSA
  2. 2.Department of Engineering ManagementUniversity of MissouriRollaUSA
  3. 3.Department of Transportation EngineeringKeimyung UniversityDaeguSouth Korea

Personalised recommendations