The Harmony Search algorithm with additional improvement of harmony memory for Asymmetric Traveling Salesman Problem

摘要

This article constitutes the continuation of the work on adapting the Harmony Search algorithm to effectively solve the Asymmetric Traveling Salesman Problem (ATSP) instances. The author's modification suggested in this work enables the improvement of harmony memory during the time of running the technique, making it possible to increase the effectiveness of the technique by almost 59% (the summary average error was reduced from 13.42 to 5.54%) and to eliminate the imperfectness revealed in the previous research. The article includes a description of the approach and a comparative study spanning various variants of implementing the improvement, conducted on 19 instances of ATSP, described by means of the occurrence of 17 to 443 nodes. The achieved results were also compared with the results found in reference articles, showing a significant effectiveness of the modification. (C) 2018 Elsevier Ltd. All rights reserved.