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

ABSTRACT The paper is an extended version of the conference article, which presents a modification of the Harmony Search algorithm, adapted to the effective resolution of the asymmetric case of the Traveling Salesman Problem. The efficacy of the proposed approach was measured with benchmarking tests and in a comparative study based on the results obtained with the Nearest Neighbor Algorithm, Greedy Local Search and Hill Climbing. The discussion also embraced the study of the convergence of the proposed algorithm and the analysis of the impact of the pitch adjustment place on the quality of the solutions.

[1]  Abolfazl Toroghi Haghighat,et al.  Harmony search based algorithms for bandwidth-delay-constrained least-cost multicast routing , 2008, Comput. Commun..

[2]  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.

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

[4]  El-Ghazali Talbi,et al.  Metaheuristics - From Design to Implementation , 2009 .

[5]  Min Huang,et al.  The harmony search for the routing optimization in fourth party logistics with time windows , 2009, 2009 IEEE Congress on Evolutionary Computation.

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

[7]  Quan-Ke Pan,et al.  Discrete harmony search algorithm for flexible job shop scheduling problem with multiple objectives , 2016, J. Intell. Manuf..

[8]  Xiaolei Wang,et al.  An Introduction to Harmony Search Optimization Method , 2014 .

[9]  Jacek Szołtysek,et al.  Wybrane metody optymalizacji systemu transportu odpadów komunalnych w Katowicach , 2008 .

[10]  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 .

[11]  Mekki Ksouri,et al.  “Evaluation and optimization of innovative production systems of goods and services” HARMONY SEARCH ALGORITHM FOR THE CONTAINER STORAGE PROBLEM , 2022 .

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

[13]  Dennis Weyland,et al.  A Rigorous Analysis of the Harmony Search Algorithm: How the Research Community can be Misled by a "Novel" Methodology , 2010, Int. J. Appl. Metaheuristic Comput..

[14]  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).

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

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

[17]  S. O. Degertekin.  Optimum design of steel frames using harmony search algorithm , 2008 .

[18]  Aditya Panchal,et al.  Harmony Search in Therapeutic Medical Physics , 2009 .

[19]  Bogna Mrówczyńska,et al.  Optymalizacja tras przejazdu przy zbiórce zużytego sprzętu elektrycznego i elektronicznego dla zadanych lokalizacji punktów zbiórki , 2015 .

[20]  Damian Słota,et al.  Application of the Harmony Search algorithm in solving the inverse heat conduction problem , 2011 .