基于改进自适应与禁忌鲸鱼算法的二维多箱型装箱问题研究

OPTIMIZATION OF TWO-DIMENSIONAL VARIABLE-SIZED BIN PACKING PROBLEM BASED ON TSWOA AND IBF ALGORITHM

  • 摘要: 针对二维多箱型装箱问题,以最大装载率为优化目标,提出改进自适应算法(IBF)与禁忌鲸鱼算法(TSWOA)。在算法的搜索过程中,通过禁忌搜索策略帮助鲸鱼算法跳出局部最优解;在确定物品的摆放位置时,基于最小落差原则对自适应算法进行改进,减少浪费空间的生成。算例实验结果表明,TSWOA-IBF算法与现有文献算法相比求解精度更高,与遗传算法、灰狼算法、鲸鱼算法相比收敛性更好,能够有效解决二维多箱型装箱问题。

     

    Abstract: To improve the loading rate of two-dimensional variable-sized bin packing problem, the tabu search whale optimization algorithm (TSWOA) and improved best-fit algorithm (IBF) are proposed. Tabu search strategy was used to help the whale optimization algorithm jump out of the local optimal solution during the search process of the algorithm. Best-fit algorithm was improved based on the principle of minimum drop to reduce the generation of wasted space when placing the items. The results show that the TSWOA-IBF algorithm has higher solution accuracy compared with algorithms in existing literature and has better convergence than genetic algorithm, gray wolf optimization algorithm and whale optimization algorithm. TSWOA-IBF algorithm can effectively solve two-dimensional variable-sized bin packing problem.

     

/

返回文章
返回