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

Abstract 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.

[1]  Urszula Boryczka,et al.  The Adaptation of the Harmony Search Algorithm to the ATSP , 2018, ACIIDS.

[2]  Javier Del Ser,et al.  A discrete water cycle algorithm for solving the symmetric and asymmetric traveling salesman problem , 2018, Appl. Soft Comput..

[3]  Eneko Osaba,et al.  AMCPA: A Population Metaheuristic With Adaptive Crossover Probability and Multi-Crossover Mechanism for Solving Combinatorial Optimization Problems , 2014 .

[4]  Wan-Suk Yoo,et al.  Transient Analysis and Leakage Detection Algorithm using GA and HS algorithm for a Pipeline System , 2006 .

[5]  Urszula Boryczka,et al.  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 , 2018, J. Inf. Telecommun..

[6]  A. Perallos,et al.  Focusing on the Golden Ball Metaheuristic: An Extended Study on a Wider Set of Problems , 2014, TheScientificWorldJournal.

[7]  Rajesh Kumar,et al.  An Improved Harmony Search algorithm for optimal scheduling of the diesel generators in oil rig platforms , 2011 .

[8]  Nouara Achour,et al.  An effective operations permutation-based discrete harmony search approach for the flexible job shop scheduling problem with makespan criterion , 2017, Applied Intelligence.

[9]  Peter I. Cowling,et al.  Effective Local and Guided Variable Neighbourhood Search Methods for the Asymmetric Travelling Salesman Problem , 2001, EvoWorkshops.

[10]  Zong Woo Geem,et al.  A survey on applications of the harmony search algorithm , 2013, Eng. Appl. Artif. Intell..

[11]  Shaya Sheikh,et al.  A Hybrid Harmony Search algorithm to minimize total weighted tardiness in the permutation flow shop , 2014, 2014 IEEE Symposium on Computational Intelligence in Production and Logistics Systems (CIPLS).

[12]  Anna Syberfeldt,et al.  Simulation-based Optimization of a Real-world Travelling Salesman Problem Using an Evolutionary Algorithm with a Repair Function , 2015 .

[13]  Zulkifli Ahmad,et al.  Enhanced Harmony Search Algorithm for Nurse Rostering Problems , 2013 .

[14]  Mehmet Fatih Tasgetiren,et al.  Minimizing the total flow time in a flow shop with blocking by using hybrid harmony search algorithms , 2010, Expert Syst. Appl..

[15]  Bogumił Kamiński,et al.  Choice of best possible metaheuristic algorithm for the travelling salesman problem with limited computational time: quality, uncertainty and speed , 2013 .

[16]  Hasan Erdinc Kocer,et al.  AN IMPROVED ARTIFICIAL BEE COLONY ALGORITHM WITH LOCAL SEARCH FOR TRAVELING SALESMAN PROBLEM , 2014, Cybern. Syst..

[17]  Miroslaw Malek,et al.  Serial and parallel simulated annealing and tabu search algorithms for the traveling salesman problem , 1990 .

[18]  Urszula Boryczka,et al.  Vehicle route planning in e-waste mobile collection on demand supported by artificial intelligence algorithms , 2018, Transportation Research Part D: Transport and Environment.

[19]  Kyung-Sup Kim,et al.  Advanced Harmony Search with Ant Colony Optimization for Solving the Traveling Salesman Problem , 2013, J. Appl. Math..

[20]  Mauro Dell'Orco,et al.  A Harmony Search Algorithm approach for optimizing traffic signal timings , 2013 .

[21]  Luca Maria Gambardella,et al.  Solving symmetric and asymmetric TSPs by ant colonies , 1996, Proceedings of IEEE International Conference on Evolutionary Computation.

[22]  Z H Ahmed,et al.  GENETIC ALGORITHM FOR THE TRAVELING SALESMAN PROBLEM USING SEQUENTIAL CONSTRUCTIVE CROSSOVER , 2010 .

[23]  Majid Yousefikhoshbakht,et al.  New Imperialist Competitive Algorithm to solve the travelling salesman problem , 2013, Int. J. Comput. Math..

[24]  Zong Woo Geem,et al.  Harmony Search for Generalized Orienteering Problem: Best Touring in China , 2005, ICNC.

[25]  Shih-Pang Tseng.  An improved harmony search for travelling salesman problem , 2016, 2016 2nd IEEE International Conference on Computer and Communications (ICCC).

[26]  Xin-She Yang,et al.  An improved discrete bat algorithm for symmetric and asymmetric Traveling Salesman Problems , 2016, Eng. Appl. Artif. Intell..

[27]  Zong Woo Geem,et al.  A New Heuristic Optimization Algorithm: Harmony Search , 2001, Simul..

[28]  Tanapat Tongchan,et al.  Harmony search algorithm's parameter tuning for traveling salesman problem , 2017, 2017 International Conference on Robotics and Automation Sciences (ICRAS).

[29]  Dexuan Zou,et al.  A novel global harmony search algorithm for chemical equation balancing , 2010, 2010 International Conference On Computer Design and Applications.

[30]  Temel Öncan,et al.  A comparative analysis of several asymmetric traveling salesman problem formulations , 2009, Comput. Oper. Res..