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:
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Theses and Dissertations |
| Language: | English |
| Published: |
2012
|
| Subjects: | |
| Online Access: | https://hdl.handle.net/10356/48091 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Institution: | Nanyang Technological University |
| Language: | English |