Please use this identifier to cite or link to this item:
https://ptsldigital.ukm.my/jspui/handle/123456789/578523| Title: | Water flow-like algorithm improvement using k-opt local search |
| Authors: | Wu Diyi (UKM) Zulaiha Ali Othman (UKM) Suhaila Zainudin (UKM) Ayman Srour (UKM) |
| Keywords: | Combinatorial optimization Nature-inspired metaheuristics Traveling Salesman Problem Water flow-liked algorithm |
| Issue Date: | Jun-2017 |
| Description: | The water flow-like algorithm (WFA) is a relatively new metaheuristic algorithm, which has shown good solution for the Travelling Salesman Problem (TSP) and is comparable to state of the art results. The basic WFA for TSP uses a 2-opt searching method to decide a water flow splitting decision. Previous algorithms, such as the Ant Colony System for the TSP, has shown that using k-opt (k>2) improves the solution, but increases its complexity exponentially. Therefore, this paper aims to present the performance of the WFA-TSP using 3-opt and 4-opt, respectively, compare them with the basic WFA-TSP using 2-opt and the state of the art algorithms. The algorithms are evaluated using 16 benchmarks TSP datasets. The experimental results show that the proposed WFA-TSP-4opt outperforms in solution quality compare with others, due to its capacity of more exploration and less convergence. |
| News Source: | Pertanika Journals |
| ISSN: | 0128-7680 |
| Volume: | 25 |
| Pages: | 199-210 |
| Publisher: | Universiti Putra Malaysia Press |
| Appears in Collections: | Journal Content Pages/ Kandungan Halaman Jurnal |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| ukmvital_115994+Source01+Source010.PDF | 928.5 kB | Adobe PDF |  View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.