The adaptation of the harmony search algorithm to the ATSP with the evaluation of the influence of the pitch adjustment place on the quality of results

Abstract

The paper is an extended version of the conference article, which presents a modification of the Harmony Search algorithm, adapted to the effective resolution of the asymmetric case of the Traveling Salesman Problem. The efficacy of the proposed approach was measured with benchmarking tests and in a comparative study based on the results obtained with the Nearest Neighbor Algorithm, Greedy Local Search and Hill Climbing. The discussion also embraced the study of the convergence of the proposed algorithm and the analysis of the impact of the pitch adjustment place on the quality of the solutions.

A novel approach to the Orienteering Problem based on the Harmony Search algorithm

“…Based on papers [ 30 , 42 , 45 ] and the performed empirical tests, the following values of HS parameters were determined: HMCR = 0.98, PAR = 0.1, HMS = 5, IT = 1000000 and R = 500.…”

The Pheromone-Based Harmony Search Algorithm for the Asymmetric Traveling Salesman Problem

“…On the basis of work [15] the following parameter values were set: R = 1000, HMS = 5, HMCR = 0.98 and PAR = 0.25. Additionally, when analyzing the convergence of the technique (presented in [37]) it was assumed that IT = 1,000,000, and as the value of the parameter ρ: 0.25, 0.5 and 0.75 were selected (tests were conducted for each of them in order to select the recommended approach to the designed method).…”

Probabilistic Traveling Salesman Problem and Harmony Search Algorithms in Pharmacy Supply Optimization

“…The following values of HS and HHS parameters were determined on the basis of Boryczka and Szwarc (2018) paper: HMS = 5, HMCR = 0.98, PAR = 0.25 and R = 1000. Based on the analysis of the number of iterations after which HS reached convergence for various instances of asymmetric variant of TSP (presented in article Boryczka and Szwarc, 2019), it was assumed that IT = 1,000,000.…”