arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2202.05698cs.NEcs.AI
收藏

求解集合并背包问题的自调整优化算法

Self-adjusting optimization algorithm for solving the setunion knapsack problem

China University of Geosciences(中国地质大学);Hebei GEO University(河北地质大学);Capital University of Economics and Business(首都经济贸易大学);Henan Normal University(河南师范大学)

Congcong Wu, Xiangyun Gao, Xueyong Liu, Bowen Sun

摘要:

集并背包问题(SUKP)是一个约束组合优化问题。由于值和权重分别依赖于项目和元素,因此求解起来比较困难。本文提出了两种自调整优化算法,分别从项目和元素的角度来逼近SUKP。通过分析SUKP的动态特性,设计了两种基于不同加载过程的自调整修复和优化算子。我们使用新的教学为基础的优化算法(TLBO)设计一个通用的离散框架(DTLBO)适合这两种类型的运营商。此外,我们引入精英反向搜索和自然选择机制到DTLBO从人口的角度进一步提高算法的性能。最后,我们在基准集上进行了实验比较,以验证所提出的算法的有效性。实验结果表明,基于项目的自调整优化算法I-DTLBO在求解SUKP问题上优于其他群体智能方法。IDTLBO算法在求解SUKP的10个实例中达到了现有群体智能算法的上界,在15个实例中得到了新的上界。基于元素加载的E-DTLBO算法仅在中小数据集上表现稍好,但在大规模实例上表现较差。这表明基于单元的设计不适合求解SUKP。

英文摘要:

The set-union knapsack problem (SUKP) is a constrained composed optimization problem. It is more difficulty for solving because values and weights depend on items and elements respectively. In this paper, we present two self-adjusting optimization algorithms for approximating SUKP from items and elements perspective respectively. By analyzing the dynamic characters in the SUKP, we design two types of self-adjusting repair and optimization operators that are based on the different loading process. We use the novel teaching-learning-based optimization algorithm (TLBO) to design a general discrete framework (DTLBO) suitable for these two types of operators. In addition, we introduce elite opposite search and natural selection mechanism into DTLBO to furtherly improve the performance of the algorithm from the perspective of population. Finally, we performed experimental comparisons on benchmark sets to verify the effectiveness of the proposed algorithm. The experimental results show that the item-based self-adjusting optimization algorithm I-DTLBO is outstanding, and the algorithm is superior to the other swarm intelligence methods for solving SUKP. IDTLBO algorithm reaches the upper boundary of the current swarm intelligence algorithms for solving SUKP in 10 instances, and gotten new upper boundary in 15 instances. The algorithm E-DTLBO based on element loading only perform slightly better on small and middle data sets, but worse on large-scale instances. It shows that element-based design is not suitable for solving SUKP.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑