The Pheromone-Based Harmony Search Algorithm for the 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 impro...
मुख्य लेखकों: | Krzysztof Szwarc, Urszula Boryczka |
---|---|
स्वरूप: | लेख |
भाषा: | English |
प्रकाशित: |
MDPI AG
2020-09-01
|
श्रृंखला: | Applied Sciences |
विषय: | |
ऑनलाइन पहुंच: | https://www.mdpi.com/2076-3417/10/18/6422 |
समान संसाधन
-
An analysis of Harmony Search for solving Sudoku puzzles
द्वारा: Rachel H. Chae, और अन्य
प्रकाशित: (2021-12-01) -
Enhancing the Harmony Search Algorithm Performance on Constrained Numerical Optimization
द्वारा: Edgar Alfredo Portilla-Flores, और अन्य
प्रकाशित: (2017-01-01) -
Advanced Parameter-Setting-Free Harmony Search Algorithm
द्वारा: Yong-Woon Jeong, और अन्य
प्रकाशित: (2020-04-01) -
Using 2-Opt based evolution strategy for travelling salesman problem
द्वारा: Kenan Karagul, और अन्य
प्रकाशित: (2016-03-01) -
An Improved Novel Global Harmony Search Algorithm Based on Selective Acceptance
द्वारा: Hui Li, और अन्य
प्रकाशित: (2020-03-01)