Harmony Search algorithm adapted to Travelling Salesman

Question

I'm searching for an adaptation of Harmony Search algorithm which resolved Travelling Salesman Problem. I must implement it and describe results. I found some solutions like: http://www.academia.edu/6709329/Adaptation_of_the_Harmony_Search_Algorithm_to_solve_the_travelling_salesman_problem

http://www.jtacs.org/archive/2013/1/4/JTACS_2013_01_04.pdf

but these solutions are not good and return poor results. I can't use any combinations with other algorithms, it must be clear Harmony Search(but modifications are of course permitted). I was also looking for it in "Music-Inspired Harmony Search Algorithm: Theory and Applications" book and i found a description here, but it is not enough.

I think I've tried everything. I will be thankfull for any sources/ideas/examples showing how to do that.

Answer 1

I am a researcher in the field of computer science. I have had doubts about the harmony search algorithm since I have seen it for the first time in a conference talk. It turned out that harmony search is a special case of evolution strategies, which were proposed in the 60s. It also turned out that you cannot trust the numbers reported in harmony search papers, especially by the "inventor" of that method. To me harmony search is a hoax method and the "inventor" of that method very likely conducted academic fraud.

In short: If the algorithm does not work for you, it is very likely not your fault.

Sources:

1) The Harmony Search Algorithm – My personal experience with this “novel” metaheuristic

2) A rigorous analysis of the harmony search algorithm: how the research community can be misled by a "novel" methodology (journal article published in 2010)

3) A critical analysis of the harmony search algorithm - How not to solve sudoku (journal article published in 2015)

4) Neat Algorithms - Harmony Search