Evolutionary harmony search algorithm with Metropolis acceptance criterion for travelling salesman problem
by Changying Wang; Juan Lin; Min Lin; Yiwen Zhong
International Journal of Wireless and Mobile Computing (IJWMC), Vol. 10, No. 2, 2016

Abstract: Harmony search (HS) algorithm is a new constructive meta-heuristic. In general, the intensification ability of a constructive meta-heuristic is not as good as that of iterative meta-heuristic, such as simulated annealing (SA) algorithm. To address this issue, we present a novel evolutionary HS (EHS) algorithm; in particular, we exploit the local search ability of SA algorithm to solve Travelling Salesman Problem (TSP). In EHS, we combine the evolution idea from evolutionary computation (EC) and the Metropolis acceptance criterion of SA algorithm to improvise a new harmony. EHS algorithm can achieve significantly better intensification ability by taking advantage of the evolution process of EC and the local search ability from SA. Furthermore, the probabilistic accepting criterion of SA can effectively keep EHS from premature stagnation. Simulation experiments of EHS were conducted based on benchmark TSP problems, and the results show that EHS algorithm has demonstrated promising performance in terms of solution accuracy and CPU time.

Online publication date: Wed, 27-Apr-2016

The full text of this article is only available to individual subscribers or to users at subscribing institutions.

 
Existing subscribers:
Go to Inderscience Online Journals to access the Full Text of this article.

Pay per view:
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.

Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Wireless and Mobile Computing (IJWMC):
Login with your Inderscience username and password:

Username:        Password:          Forgotten your password?

Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.

If you still need assistance, please email subs@inderscience.com