基于下降搜索的混合遗传算法求解装箱问题

Packing Problem Based on Hybrid Genetic Algorithm of Descend Search

研究一种在基本遗传算法中嵌入下降搜索算子形成的混合遗传算法。这种优化算法是在传统遗传算法的全局随机搜索基础上,借鉴利用每一代群体中最劣个体所包含的优化信息作为下降搜索方向来优化种群。实验证明,该混合算法可以加快算法的收敛速度,具有良好的优化性质和函数适应能力,是解决装箱问题的一种有效途径。

A hybrid genetic algorithm in which the Descend Search operators is embedded in the basic genetic algorithm is studied. This kind of optimized algorithm is in the tradition genetic algorithm situation, based on the use of every generation learn from the worst group of individual information included in the optimization search direction as to optimize the Descend in species. The experiment proved that the hybrid algorithm can speed up the algorithm convergence rate, with good nature and function of the optimization of adaptive capacity. It is an effective way to solve the problem of packing.