A Multiple-Evaluation Genetic Algorithm for One-dimensional Bin Packing Problems
碩士 === 中原大學 === 資訊管理研究所 === 95 === In this thesis, a new design of multiple-evaluation genetic algorithm (MEGA) is proposed to solve the one-dimensional bin packing problems, which is to pack a given set of items into the minimum number of bins. GA should be designed in such a way that offspring inh...
| Main Authors: | , |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | en_US |
| Published: |
2007
|
| Online Access: | http://ndltd.ncl.edu.tw/handle/01084609116325920277 |