An ant colony optimization algorithm for the zero-one Multidimensional Knapsack Problem
碩士 === 國立清華大學 === 工業工程與工程管理學系 === 91 === In this thesis, we design an Ant Colony Optimization Algorithm (ACO Algorithm) for the zero-one Multidimensional Knapsack Problem. The zero-one Multidimensional Knapsack Problem is the problem of choosing some of n items such that the corresponding profit sum...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | zh-TW |
| Published: |
2003
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/24063706988712558735 |