Processing may take a few seconds...

Article


Title

An Improved Unordered Pair Bat Algorithm for Solving the Symmetrical Traveling Salesman Problem

Authors

Year of publication

2022

Published in

Foundations of Computing and Decision Sciences

Journal year: 2022 | Journal volume: vol. 47 | Journal number: no. 1

Article type

scientific article

Publication language

english

Keywords
EN
  • symmetrical traveling salesman problem
  • discrete bat algorithm
  • unordered pair bat algorithm
Abstract

EN Bat algorithm is an effective swarm intelligence optimization algorithm which is widely used to solve continuous optimization problems. But it still has some limitations in search process and can’t solve discrete optimization problems directly. Therefore, this paper introduces an unordered pair and proposes an unordered pair bat algorithm (UPBA) to make it more suitable for solving symmetric discrete traveling salesman problems. To verify the effectiveness of this method, the algorithm has been tested on 23 symmetric benchmarks and compared its performance with other algorithms. The results have shown that the proposed UPBA outperforms all the other alternatives significantly in most cases.

Date of online publication

23.02.2022

Pages (from - to)

87 - 103

DOI

10.2478/fcds-2022-0004

URL

https://www.sciendo.com/pl/article/10.2478/fcds-2022-0004

License type

CC BY-NC-ND (attribution - noncommercial - no derivatives)

Open Access Mode

open journal

Open Access Text Version

final published version

Date of Open Access to the publication

at the time of publication

Points of MNiSW / journal

40.0

This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.