Harmony Search for Generalized Orienteering Problem: Best Touring in China

  • Zong Woo Geem
  • Chung-Li Tseng
  • Yongjin Park
Conference paper

DOI: 10.1007/11539902_91

Part of the Lecture Notes in Computer Science book series (LNCS, volume 3612)
Cite this paper as:
Geem Z.W., Tseng CL., Park Y. (2005) Harmony Search for Generalized Orienteering Problem: Best Touring in China. In: Wang L., Chen K., Ong Y.S. (eds) Advances in Natural Computation. ICNC 2005. Lecture Notes in Computer Science, vol 3612. Springer, Berlin, Heidelberg

Abstract

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

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