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

被引：1

作者：

Szwarc, Krzysztof ^{[1
]}

Boryczka, Urszula ^{[1
]}

机构：

[1] Univ Silesia Katowice, Inst Comp Sci, Ul Bedzinska 39, PL-41200 Sosnowiec, Poland

来源：

APPLIED SCIENCES-BASEL | 2020年 / 10卷 / 18期

关键词：

harmony search; pheromone-based harmony search; asymmetric traveling salesman problem; metaheuristic; OPTIMIZATION;

D O I：

10.3390/app10186422

中图分类号：

O6 [化学];

学科分类号：

0703 ;

摘要：

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.

引用

页数：17

共 50 条

[41] Fixed Set Search Applied to the Traveling Salesman Problem
Jovanovic, Raka
Tuba, Milan
Voss, Stefan
HYBRID METAHEURISTICS (HM 2019), 2019, 11299 : 63 - 77
[42] Large scale parallel Iterated Local Search algorithm for solving Traveling Salesman Problem
Rocki, Kamil
Suda, Reiji
HIGH PERFORMANCE COMPUTING SYMPOSIUM 2012 (HPC 2012), 2012, 44 (06): : 26 - 33
[43] Dynamic multiscale region search algorithm using vitality selection for traveling salesman problem
Zhang, HongGuang
Zhou, Jie
EXPERT SYSTEMS WITH APPLICATIONS, 2016, 60 : 81 - 95
[44] Discrete artificial bee colony algorithm with fixed neighborhood search for traveling salesman problem
Li, Xing
Zhang, Shaoping
Shao, Peng
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2024, 131
[45] EXPERIMENTS WITH LOCAL SEARCH HEURISTICS FOR THE TRAVELING SALESMAN PROBLEM
Misevicius, Alfonsas
Blazinskas, Andrius
INFORMATION TECHNOLOGIES' 2010, 2010, : 47 - +
[46] Local Search for the Traveling Salesman Problem: A Comparative Study
Wu, Yuezhong
Weise, Thomas
Chiong, Raymond
PROCEEDINGS OF 2015 IEEE 14TH INTERNATIONAL CONFERENCE ON COGNITIVE INFORMATICS & COGNITIVE COMPUTING (ICCI*CC), 2015, : 213 - 220
[47] An Investigation of Hybrid Tabu Search for the Traveling Salesman Problem
Xu, Dan
Weise, Thomas
Wu, Yuezhong
Laessig, Joerg
Chiong, Raymond
BIO-INSPIRED COMPUTING - THEORIES AND APPLICATIONS, BIC-TA 2015, 2015, 562 : 523 - 537
[48] A Novel Diversity-based Evolutionary Algorithm for the Traveling Salesman Problem
Segura, Carlos
Botello Rionda, Salvador
Hernandez Aguirre, Arturo
Ivvan Valdez Pena, S.
GECCO'15: PROCEEDINGS OF THE 2015 GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, 2015, : 489 - 496
[49] List-Based Simulated Annealing Algorithm for Traveling Salesman Problem
Zhan, Shi-hua
Lin, Juan
Zhang, Ze-jun
Zhong, Yi-wen
COMPUTATIONAL INTELLIGENCE AND NEUROSCIENCE, 2016, 2016
[50] A hybrid approach combining an improved genetic algorithm and optimization strategies for the asymmetric traveling salesman problem
Xing, Ling-Ning
Chen, Ying-Wu
Yang, Ke-Wei
Hou, Feng
Shen, Xue-Shi
Cai, Huai-Ping
ENGINEERING APPLICATIONS OF ARTIFICIAL INTELLIGENCE, 2008, 21 (08) : 1370 - 1380

← 1 2 3 4 5 →