Evolution-Based Tabu Search Approach to Traveling Salesman Problem
碩士 === 淡江大學 === 資訊管理學系碩士班 === 96 === In the combinatorial optimization problem, Traveling Salesman Problem is the most basic and typical example, lots of problems could transfer to TSP as solution. Meanwhile, as the TSP belongs to NP-Complete problem, it is quite hard to find out the best solution i...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2008
|
Online Access: | http://ndltd.ncl.edu.tw/handle/02159143795539573862 |
id |
ndltd-TW-096TKU05396014 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-096TKU053960142015-10-13T13:47:53Z http://ndltd.ncl.edu.tw/handle/02159143795539573862 Evolution-Based Tabu Search Approach to Traveling Salesman Problem 以演化基礎的塔布搜尋方法解旅行銷售員問題 Chen-Yu Chang 張震宇 碩士 淡江大學 資訊管理學系碩士班 96 In the combinatorial optimization problem, Traveling Salesman Problem is the most basic and typical example, lots of problems could transfer to TSP as solution. Meanwhile, as the TSP belongs to NP-Complete problem, it is quite hard to find out the best solution in case of huge data, the CTSP, Clustered Traveling Salesman Problem, transferred from a big TSP into several smaller ones, came up. Therefore, it becomes highly important to define a good algorithm in order to find the best similar solution. In consequence, this research proposes an algorithm; the cadre is based on genetic algorithm and tabu search, and transfer the TSP problem into CTSP to find out the best similar solution. In this research, the algorithm is divided into two parts: the first one on the cluster path, second on the global best path search. The cluster is top- down; at the beginning making the preliminary cluster on the top, then set up the path. The second part, adopting the tabu search: firstly by using the two-points tabu search as large boundary, then by one point tabu search for detail, finally by using MNIO algorithm for the final solution. In TSPLIB international exemplification linkorA100, the path of genetic algorithm is 5.27% longer than the best solution, in this research only 2.46% longer; in the d198, the path of genetic algorithm is 5.96% longer than the best solution, in this research 3.44% only; as for the rat783, the path of genetic algorithm is 10.52% longer than the best solution, here only longer than 8.72%. Therefore, the algorithm of this research can get a better path research result than by using uniquely the genetic algorithm. Hung-Chang Li 李鴻璋 2008 學位論文 ; thesis 47 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 淡江大學 === 資訊管理學系碩士班 === 96 === In the combinatorial optimization problem, Traveling Salesman Problem is the most basic and typical example, lots of problems could transfer to TSP as solution. Meanwhile, as the TSP belongs to NP-Complete problem, it is quite hard to find out the best solution in case of huge data, the CTSP, Clustered Traveling Salesman Problem, transferred from a big TSP into several smaller ones, came up. Therefore, it becomes highly important to define a good algorithm in order to find the best similar solution. In consequence, this research proposes an algorithm; the cadre is based on genetic algorithm and tabu search, and transfer the TSP problem into CTSP to find out the best similar solution.
In this research, the algorithm is divided into two parts: the first one on the cluster path, second on the global best path search. The cluster is top- down; at the beginning making the preliminary cluster on the top, then set up the path. The second part, adopting the tabu search: firstly by using the two-points tabu search as large boundary, then by one point tabu search for detail, finally by using MNIO algorithm for the final solution. In TSPLIB international exemplification linkorA100, the path of genetic algorithm is 5.27% longer than the best solution, in this research only 2.46% longer; in the d198, the path of genetic algorithm is 5.96% longer than the best solution, in this research 3.44% only; as for the rat783, the path of genetic algorithm is 10.52% longer than the best solution, here only longer than 8.72%. Therefore, the algorithm of this research can get a better path research result than by using uniquely the genetic algorithm.
|
author2 |
Hung-Chang Li |
author_facet |
Hung-Chang Li Chen-Yu Chang 張震宇 |
author |
Chen-Yu Chang 張震宇 |
spellingShingle |
Chen-Yu Chang 張震宇 Evolution-Based Tabu Search Approach to Traveling Salesman Problem |
author_sort |
Chen-Yu Chang |
title |
Evolution-Based Tabu Search Approach to Traveling Salesman Problem |
title_short |
Evolution-Based Tabu Search Approach to Traveling Salesman Problem |
title_full |
Evolution-Based Tabu Search Approach to Traveling Salesman Problem |
title_fullStr |
Evolution-Based Tabu Search Approach to Traveling Salesman Problem |
title_full_unstemmed |
Evolution-Based Tabu Search Approach to Traveling Salesman Problem |
title_sort |
evolution-based tabu search approach to traveling salesman problem |
publishDate |
2008 |
url |
http://ndltd.ncl.edu.tw/handle/02159143795539573862 |
work_keys_str_mv |
AT chenyuchang evolutionbasedtabusearchapproachtotravelingsalesmanproblem AT zhāngzhènyǔ evolutionbasedtabusearchapproachtotravelingsalesmanproblem AT chenyuchang yǐyǎnhuàjīchǔdetǎbùsōuxúnfāngfǎjiělǚxíngxiāoshòuyuánwèntí AT zhāngzhènyǔ yǐyǎnhuàjīchǔdetǎbùsōuxúnfāngfǎjiělǚxíngxiāoshòuyuánwèntí |
_version_ |
1717743465606938624 |