BRAIN Journal-An Efficient Combined Meta-Heuristic Algorithm for Solving the Traveling Salesman Problem-Figure 5. The process of MICALK for solving the TSP
| Main Authors: | Majid Yousefikhoshbakht, Azam Dolatnejad |
|---|---|
| Format: | info Image eJournal |
| Bahasa: | eng |
| Terbitan: |
, 2016
|
| Subjects: | |
| Online Access: |
https://www.edusoft.ro/brain/index.php/brain/article/view/631/696 |
Daftar Isi:
- Moreover, in order to prevent the ICA from getting trapped in stagnation, we used a local searching algorithm when the algorithm attained a better solution compared to previous iterations. In fact, the probability of finding better solutions near a good solution is relatively high. There exist many algorithms for the local search and they have of course their pros and cons. Since LinKernighan algorithm is simple and it is one of the most successful methods for generating optimal or near optimal solutions for the TSP, we have used it in this study. The main steps of MICALK are summarized in the pseudo-code given in Figure 5.