A modified shuffled frog leaping algorithm for the bin packing problem
Bin packing is a mathematical way to efficiently fit elements into bins. Since the bin packing problem (BPP) is NP-hard, the most efficient known algorithms use heuristics to accomplish results which, although very good in most cases, may not be the optimal solution. Among the heuristics currently u...
| מחבר ראשי: | |
|---|---|
| פורמט: | Thesis |
| שפה: | English |
| יצא לאור: |
2008
|
| נושאים: |