Added to the superior segments and subtracted from inferior segments Ant System for Combinatorial Optimization Problems
碩士 === 國立臺灣大學 === 工業工程學研究所 === 92 === Ant colony optimization (ACO) is a new kind of heuristic algorithms in recent years. There are successful implementations of applying ACO to a number of different combinational optimization problems such as traveling salesman problem (TSP), bin packing problem (...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2004
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/68370825031982378507 |