:::
Trans. Planning Journal
| Title | A Modified Nested Partitions Meta-heuristics for the Traveling Salesman Problem |
|---|---|
| Author | Ching Chang, Yuh-Jen Cho, Yi-Hsiang Lan |
| Summary | This paper presents an implementation of the Modified Nested Partitions (MNP) meta-heuristics for solving the Traveling Salesman Problem (TSP). The NP method systematically partitions the feasible region and concentrates the search in regions that are the most promising. The most promising region is selected in each iteration based on information obtained from random sampling of the entire feasible region and local search. In the MNP, we modified the NP method’s random sampling, local search methods and backtracking rules. Twenty problems from TSPLIB library are used to test the quality of the MNP. The average accuracy of the best solutions of the twenty problems computed by the MNP is 1.14% above the performance of the current best known solutions. |
| Vol. | 34 |
| No. | 4 |
| Page | 549 |
| Year | 2005 |
| Month | 12 |
Count Views:422