| Bin-packing Problem (BP) is one of the combination optimization problems. It lies in our daily life. The commonness of BP is putting some "goods'" into some "boxes" and not overlapping. In other words, use the resource suitably after fulfilling our needs. So, there is an important value in studying the BP.BP has aroused man's attention from the early 1970s. We mostly study linear BP and 2-D BP up to now. There are no mature theory and numerical implementation by far. Scholars began to study approximate algorithms from 1980s, such as next fit (NF), first fit (FF), best fit (BF) and harmonic algorithms.The article utilizes Genetic Algorithm (GA) in solving BP on the basic of the superiors. It analyses the Standard Genetic Algorithm (SGA) using in the field of BP in detail. The article advanced a hybrid genetic algorithm which is constituted by Best Fit Decreasing (BFD) algorithm and SGA in resolving BP. And implement GUI procedure based on the Database in VC. The article discusses the detail steps of the procedure and the main procedural flow charts. After the comparison of the example, we have a conclusion that the hybrid genetic algorithm constituted by BFD and SGA is better than SGA in solving BP and it has an applied value.
|
PDF Full Text Request