Name
Abstract | ||
|---|---|---|
Metaheuristic algorithms have been applied widely for real-world problems in many fields, e.g., engineering, financial, healthcare. Bats algorithm (BA) is a recent metaheuristic algorithm with considering as a robust optimization method that can outperform existing algorithms. However, when dealing with complicated combinatorial problems such as traveling salesman problems (TSP), the BA can be fallen in a local optimum. This paper proposes a new hybridizing Parallel BA (HPBA) with a mutation in local-search to escape such its drawback scenario for TSP. A graph theory mutation method is used to embed for hybridizing BA with exploiting similarities among individuals. The proposed method is extensively evaluated in TSP with series instances of the benchmark from TSPLIB to test its performance. The compared experimental result with the previous method and the best-known solutions (B.K.S) in the literature shows that the proposed approach offers competitive results. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.3233/JIFS-179668 | JOURNAL OF INTELLIGENT & FUZZY SYSTEMS |
Keywords | DocType | Volume |
Transportation applications,metaheuristic algorithms,hybridized parallel bats algorithm | Journal | 38 |
Issue | ISSN | Citations |
5 | 1064-1246 | 0 |
PageRank | References | Authors |
0.34 | 0 | 7 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Trong-The Nguyen | 1 | 67 | 15.26 |
| Yu Qiao | 2 | 2267 | 152.01 |
| Jeng-Shyang Pan | 3 | 0 | 0.68 |
| Chu Shu-Chuan | 4 | 425 | 53.51 |
| Kuo-Chi Chang | 5 | 0 | 0.34 |
| Xingsi Xue | 6 | 0 | 0.34 |
| Thi-Kien Dao | 7 | 58 | 11.95 |