Harmony Search for Generalized Orienteering Problem: Best Touring in China
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.
KeywordsHarmony Search Harmony Search Algorithm Harmony Memory Orienteering Problem Travel Salesperson Problem
Unable to display preview. Download preview PDF.
- 1.Fogel, L.J., Owens, A.J., Walsh, M.J.: Artificial Intelligence Though Simulated Evolution. John Wiley, Chichester (1966)Google Scholar
- 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.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.Holland, J.H.: Adaptation in Natural and Artificial Systems. University of Michigan Press, Ann Arbor (1975)Google Scholar
- 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
- 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
- 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