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 条
  • [31] AN IMPROVED ARTIFICIAL BEE COLONY ALGORITHM WITH LOCAL SEARCH FOR TRAVELING SALESMAN PROBLEM
    Kocer, Hasan Erdinc
    Akca, Melike Ruhan
    CYBERNETICS AND SYSTEMS, 2014, 45 (08) : 635 - 649
  • [32] A hybrid Search Algorithm with Hopfield Neural Network and Genetic Algorithm for Solving Traveling Salesman Problem
    Vahdati, Gohar
    Ghouchani, Sima Yaghoubian
    Yaghoobi, Mahdi
    2010 2ND INTERNATIONAL CONFERENCE ON COMPUTER AND AUTOMATION ENGINEERING (ICCAE 2010), VOL 1, 2010, : 435 - 439
  • [33] AN ADDITIVE BOUNDING PROCEDURE FOR THE ASYMMETRIC TRAVELING SALESMAN PROBLEM
    FISCHETTI, M
    TOTH, P
    MATHEMATICAL PROGRAMMING, 1992, 53 (02) : 173 - 197
  • [34] State transition algorithm for traveling salesman problem
    Yang Chunhua
    Tang Xiaolin
    Zhou Xiaojun
    Gui Weihua
    PROCEEDINGS OF THE 31ST CHINESE CONTROL CONFERENCE, 2012, : 2481 - 2485
  • [35] A Quantum Heuristic Algorithm for the Traveling Salesman Problem
    Bang, Jeongho
    Ryu, Junghee
    Lee, Changhyoup
    Yoo, Seokwon
    Lim, James
    Lee, Jinhyoung
    JOURNAL OF THE KOREAN PHYSICAL SOCIETY, 2012, 61 (12) : 1944 - 1949
  • [36] Lifted cycle inequalities for the asymmetric traveling salesman problem
    Balas, E
    Fischetti, M
    MATHEMATICS OF OPERATIONS RESEARCH, 1999, 24 (02) : 273 - 292
  • [37] Improved extremal optimization for the asymmetric traveling salesman problem
    Chen, Yu-Wang
    Zhu, Yao-Jia
    Yang, Gen-Ke
    Lu, Yong-Zai
    PHYSICA A-STATISTICAL MECHANICS AND ITS APPLICATIONS, 2011, 390 (23-24) : 4459 - 4465
  • [38] An Efficient and Scalable Algorithm for the Traveling Salesman Problem
    Ye, Chen
    Yang, Zhongcheng
    Yan, Tianxing
    2014 5TH IEEE INTERNATIONAL CONFERENCE ON SOFTWARE ENGINEERING AND SERVICE SCIENCE (ICSESS), 2014, : 335 - 339
  • [39] New heuristic algorithm for traveling salesman problem
    Shahab, M. L.
    INTERNATIONAL CONFERENCE ON MATHEMATICS: PURE, APPLIED AND COMPUTATION, 2019, 1218
  • [40] Solving the asymmetric traveling salesman problem with periodic constraints
    Paletta, G
    Triki, C
    NETWORKS, 2004, 44 (01) : 31 - 37
12345