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: | Chih-Chung Chen, 陳致中 |
---|---|
Other Authors: | 作者未提供 |
Format: | Others |
Language: | zh-TW |
Published: |
2010
|
Online Access: | http://ndltd.ncl.edu.tw/handle/68624439940989791329 |
Similar Items
-
Using Hybrid of Genetic Algorithm and Ant Colony Optimization to Solve Travelling Salesman Problem
by: Yi-Chiang Chiu, et al.
Published: (2012) -
Combining improved Genetic Algorithm and Ant Colony Optimization to solve the Traveling Salesman Problem
by: Jia-huei Chen, et al.
Published: (2013) -
Comparative Analysis of Ant Colony Optimization and Genetic Algorithm in Solving the Traveling Salesman Problem
by: Mohi El Din, Hatem
Published: (2021) -
Solving the Traveling Salesman Problem by Ant Colony Optimization Algorithms with DNA Computing
by: Hung-Wei Huang, et al.
Published: (2004) -
A Slime Mold-Ant Colony Fusion Algorithm for Solving Traveling Salesman Problem
by: Meijiao Liu, et al.
Published: (2020-01-01)