scholarly journals A Hybrid Symbiotic Organisms Search Algorithm with Variable Neighbourhood Search for Solving Symmetric and Asymmetric Traveling Salesman Problem

2018 ◽  
Vol 337 ◽  
pp. 012005 ◽  
Author(s):  
M I H Umam ◽  
B Santosa
Keyword(s):  
Traveling Salesman Problem ◽  
Search Algorithm ◽  
Traveling Salesman ◽  
Variable Neighbourhood Search ◽  
Symbiotic Organisms Search ◽  
Asymmetric Traveling Salesman Problem ◽  
Neighbourhood Search ◽  
Symbiotic Organisms

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

2020 ◽  
Vol 10 (18) ◽  
pp. 6422
Author(s):  
Krzysztof Szwarc ◽  
Urszula Boryczka
Keyword(s):  
Traveling Salesman Problem ◽  
Search Algorithm ◽  
Harmony Search ◽  
Harmony Search Algorithm ◽  
Traveling Salesman ◽  
Long Term Memory ◽  
Asymmetric Traveling Salesman Problem

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.

Sign in / Sign up

Export Citation Format

Share Document