Sequential Max-Min Ant Colony System for Traveling Salesman Problem
碩士 === 國立中正大學 === 應用數學研究所 === 93 === Traveling salesman problem (TSP) is a typical NP-hard problem in combinatorial situation. In this paper, we introduces sequential Max-Min ant colony system (s-MMACS) which is a distributed algorithm to solve the TSP. The s-MMACS is based on two ant algorithms, an...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2005
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/76975307233622422789 |