The Harmony Search algorithm with additional improvement of harmony memory for Asymmetric Traveling Salesman Problem

被引：28

作者：

Boryczka, Urszula ^{[1
]}

Szwarc, Krzysztof ^{[1
]}

机构：

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

来源：

EXPERT SYSTEMS WITH APPLICATIONS | 2019年 / 122卷

关键词：

Harmony Search with harmony memory improvement; Harmony Search; Asymmetric Traveling Salesman Problem;

D O I：

10.1016/j.eswa.2018.12.044

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

This article constitutes the continuation of the work on adapting the Harmony Search algorithm to effectively solve the Asymmetric Traveling Salesman Problem (ATSP) instances. The author's modification suggested in this work enables the improvement of harmony memory during the time of running the technique, making it possible to increase the effectiveness of the technique by almost 59% (the summary average error was reduced from 13.42 to 5.54%) and to eliminate the imperfectness revealed in the previous research. The article includes a description of the approach and a comparative study spanning various variants of implementing the improvement, conducted on 19 instances of ATSP, described by means of the occurrence of 17 to 443 nodes. The achieved results were also compared with the results found in reference articles, showing a significant effectiveness of the modification. (C) 2018 Elsevier Ltd. All rights reserved.

引用

页码：43 / 53

页数：11

共 33 条

[1]

Ahmed Z. H., 2010, Proc. Int. J. Biometrics Bioinf. (JBB), V3, P96

[2]

[Anonymous], 2000, WATER SCI, DOI DOI 10.1007/S13201-020-01352-7

[3]

Antosiewicz M., 2013, J THEOR APPL COMPUT, V7, P46

[4] 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 [J].