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
Open Access
- 31 July 2018
- journal article
- research article
- Published by Taylor & Francis in Journal of Information and Telecommunication
- Vol. 3 (1) , 2-18
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.Keywords
This publication has 9 references indexed in Scilit:
- Vehicle route planning in e-waste mobile collection on demand supported by artificial intelligence algorithmsTransportation Research Part D: Transport and Environment, 2018
- An Introduction to Harmony Search Optimization Method2015
- Discrete harmony search algorithm for flexible job shop scheduling problem with multiple objectivesJournal of Intelligent Manufacturing, 2014
- A Rigorous Analysis of the Harmony Search AlgorithmInternational Journal of Applied Metaheuristic Computing, 2010
- Metaheuristics2009
- A comparative analysis of several asymmetric traveling salesman problem formulationsComputers & Operations Research, 2009
- Harmony search based algorithms for bandwidth-delay-constrained least-cost multicast routingComputer Communications, 2008
- Optimum design of steel frames using harmony search algorithmStructural and Multidisciplinary Optimization, 2007
- A New Heuristic Optimization Algorithm: Harmony SearchSIMULATION, 2001