Analysis of Different Approaches to Designing the Parallel Harmony Search Algorithm for ATSP
| Autor: | Urszula Boryczka, Krzysztof Szwarc |
|---|---|
| Rok vydání: | 2019 |
| Předmět: |
Mathematical optimization
021103 operations research Computer science media_common.quotation_subject 0211 other engineering and technologies 02 engineering and technology Travelling salesman problem Search algorithm 0202 electrical engineering electronic engineering information engineering Percentage difference Harmony search 020201 artificial intelligence & image processing Quality (business) Parallel harmony Sequential algorithm media_common |
| Zdroj: | Intelligent Information and Database Systems ISBN: 9783030148010 ACIIDS (2) |
| DOI: | 10.1007/978-3-030-14802-7_19 |
| Popis: | This article proposes three approaches to designing the Parallel Harmony Search Algorithm, adjusted to effectively solve the Asymmetric Traveling Salesman Problem. The paper contains a comparative study of the developed models, based on 19 varied instances of the problem, as well as recommendations concerning their appropriate configuration. The quality of developed models was assessed through determination of the percentage difference between the surplus of the values of objective function of solutions and the values describing the sequential algorithm variant. Each of the examined Parallel Harmony Search variants created better results than the sequential Harmony Search algorithm. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|