Combining Cluster Algorithm and Hybrid Genetic Ant Colony Algorithm for Solving Traveling Salesman Problem
碩士 === 銘傳大學 === 資訊管理學系碩士班 === 98 === Nowadays, ranges of enterprising services expand thanks to the technological development. However, here comes a problem called “Traveling Salesman Problem” which makes people think over--- how to find the shortest route or the least cost to accomplish shipping? I...
Main Authors: | , |
---|---|
Other Authors: | |
Format: | Others |
Language: | zh-TW |
Published: |
2010
|
Online Access: | http://ndltd.ncl.edu.tw/handle/68624439940989791329 |
id |
ndltd-TW-098MCU05396019 |
---|---|
record_format |
oai_dc |
spelling |
ndltd-TW-098MCU053960192015-10-13T19:06:46Z http://ndltd.ncl.edu.tw/handle/68624439940989791329 Combining Cluster Algorithm and Hybrid Genetic Ant Colony Algorithm for Solving Traveling Salesman Problem 結合分群法與混合遺傳蟻群演算法求解TSP問題 Chih-Chung Chen 陳致中 碩士 銘傳大學 資訊管理學系碩士班 98 Nowadays, ranges of enterprising services expand thanks to the technological development. However, here comes a problem called “Traveling Salesman Problem” which makes people think over--- how to find the shortest route or the least cost to accomplish shipping? In this research, a cluster algorithm is used to divide TSP into Clustered TSP (CTSP); a parallel computing technique is integrated with the Hybrid Genetic Ant Colony Optimization Algorithm and 2-opt algorithm to accelerate the procedure for solving the TSP. The experimental results showed that the process did solve the TSP in a shorter time by comparing with TSPLIB examples. Also, The proposed process was proved to be effective when comparing with some existing results. 作者未提供 余仁朋 2010 學位論文 ; thesis 49 zh-TW |
collection |
NDLTD |
language |
zh-TW |
format |
Others
|
sources |
NDLTD |
description |
碩士 === 銘傳大學 === 資訊管理學系碩士班 === 98 === Nowadays, ranges of enterprising services expand thanks to the technological development. However, here comes a problem called “Traveling Salesman Problem” which makes people think over--- how to find the shortest route or the least cost to accomplish shipping?
In this research, a cluster algorithm is used to divide TSP into Clustered TSP (CTSP); a parallel computing technique is integrated with the Hybrid Genetic Ant Colony Optimization Algorithm and 2-opt algorithm to accelerate the procedure for solving the TSP.
The experimental results showed that the process did solve the TSP in a shorter time by comparing with TSPLIB examples. Also, The proposed process was proved to be effective when comparing with some existing results.
|
author2 |
作者未提供 |
author_facet |
作者未提供 Chih-Chung Chen 陳致中 |
author |
Chih-Chung Chen 陳致中 |
spellingShingle |
Chih-Chung Chen 陳致中 Combining Cluster Algorithm and Hybrid Genetic Ant Colony Algorithm for Solving Traveling Salesman Problem |
author_sort |
Chih-Chung Chen |
title |
Combining Cluster Algorithm and Hybrid Genetic Ant Colony Algorithm for Solving Traveling Salesman Problem |
title_short |
Combining Cluster Algorithm and Hybrid Genetic Ant Colony Algorithm for Solving Traveling Salesman Problem |
title_full |
Combining Cluster Algorithm and Hybrid Genetic Ant Colony Algorithm for Solving Traveling Salesman Problem |
title_fullStr |
Combining Cluster Algorithm and Hybrid Genetic Ant Colony Algorithm for Solving Traveling Salesman Problem |
title_full_unstemmed |
Combining Cluster Algorithm and Hybrid Genetic Ant Colony Algorithm for Solving Traveling Salesman Problem |
title_sort |
combining cluster algorithm and hybrid genetic ant colony algorithm for solving traveling salesman problem |
publishDate |
2010 |
url |
http://ndltd.ncl.edu.tw/handle/68624439940989791329 |
work_keys_str_mv |
AT chihchungchen combiningclusteralgorithmandhybridgeneticantcolonyalgorithmforsolvingtravelingsalesmanproblem AT chénzhìzhōng combiningclusteralgorithmandhybridgeneticantcolonyalgorithmforsolvingtravelingsalesmanproblem AT chihchungchen jiéhéfēnqúnfǎyǔhùnhéyíchuányǐqúnyǎnsuànfǎqiújiětspwèntí AT chénzhìzhōng jiéhéfēnqúnfǎyǔhùnhéyíchuányǐqúnyǎnsuànfǎqiújiětspwèntí |
_version_ |
1718040318084907008 |