Apply Sequential Pattern For Data Mining To Improve Ant System
碩士 === 國立臺北科技大學 === 生產系統工程與管理研究所 === 90 === Conventional optimization problems use Linear Programming to solve for optimal solution. However, NP-Hard problems are time consuming. Many heuristics are developed to solve NP-Hard problems, and the solution qualities are satisfiable. Now, many...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2002
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/58177521914625048034 |