The Pheromone-Based Harmony Search Algorithm for the Asymmetric Traveling Salesman Problem
Keyword(s):
This paper presents a modification of the Harmony Search algorithm (HS) adjusted to an effective solving of instances of the Asymmetric Traveling Salesman Problem. The improvement of the technique spans the application of a pheromone, which, by serving the role of long-term memory, enables the improvement of the quality of determined results, especially for tasks characterized by a significant number of vertices. The publication includes the results of tests that suggest the achievement of effectiveness improvement through the modification of the HS and recommendations concerning the proper configuration of the algorithm.
2019 ◽
Vol 122
◽
pp. 43-53
◽
2016 ◽
Vol 11
(11)
◽
pp. 64
2018 ◽
Vol 3
(1)
◽
pp. 2-18
◽
Keyword(s):
2018 ◽
Vol 23
(2)
◽
pp. 04017058
◽
2015 ◽
Vol 2015
◽
pp. 1-15
◽
2017 ◽
Vol 5
(4)
◽
pp. 251-254
Keyword(s):