<abstract xmlns="http://www.w3.org/1999/xhtml">

<p>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.</p>
</abstract>

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.

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

University of Science and Technology Beijing

Foundations of Computing and Decision Sciences

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Bat algorithm is an effective swarm intelligence optimization algorithm which is widely used to solve continuous optimization problems. But it still has some...

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

Data publikacji: 23 lut 2022

Zakres stron: 87 - 103

Otrzymano: 07 kwi 2021

Przyjęty: 17 gru 2021

DOI: https://doi.org/10.2478/fcds-2022-0004

Słowa kluczowe
symmetrical traveling salesman problem, discrete bat algorithm, unordered pair bat algorithm

© 2022 Zhang Nan et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

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

Data publikacji: 23 lut 2022

Zakres stron: 87 - 103

Otrzymano: 07 kwi 2021

Przyjęty: 17 gru 2021

DOI: https://doi.org/10.2478/fcds-2022-0004

Słowa kluczowesymmetrical traveling salesman problem, discrete bat algorithm, unordered pair bat algorithm

© 2022 Zhang Nan et al., published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 3.0 License.

Słowa kluczowe
symmetrical traveling salesman problem, discrete bat algorithm, unordered pair bat algorithm