Harmony Search for Generalized Orienteering Problem: Best Touring in China

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. © Springer-Verlag Berlin Heidelberg 2005.

Department(s)

Engineering Management and Systems Engineering

International Standard Serial Number (ISSN)

0302-9743

Document Type

Article - Conference proceedings

Document Version

Citation

File Type

text

Language(s)

English

Rights

© 2024 Springer, All rights reserved.

Publication Date

01 Jan 2005

Link to Full Text

Share

 
COinS