A generic bee colony optimization framework for combinatorial optimization problems
Combinatorial optimization is one of the areas that has been studied intensively in computer science and operations research. Solving a Combinatorial Optimization Problem (COP) is NP-hard [55] and it involves finding a set of feasible solutions with the least-cost in a discrete search space [90]. It...
Saved in:
主要作者: | |
---|---|
其他作者: | |
格式: | Theses and Dissertations |
語言: | English |
出版: |
2012
|
主題: | |
在線閱讀: | https://hdl.handle.net/10356/48091 |
標簽: |
添加標簽
沒有標簽, 成為第一個標記此記錄!
|