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(河南师范大学)
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.
Comparing the Digital Annealer with Classical Evolutionary Algorithm
Fujitsu Research of Europe Ltd.(富士通欧洲研究有限公司)
在最近几年,已经有越来越多的研究兴趣,利用特定应用的硬件来解决优化问题。使用专用硬件的求解器的例子是IBM的Quantum System One和D-wave的Quantum Annealer(QA)和Fujitsu的Digital Annealer(DA)。这些求解器的开发是为了比在通用机器上实现的传统元算法更快地优化问题。以前的研究表明,这些求解器可以比精确求解器(如GUROBI和CPLEX)更快地优化许多问题。这样的结论还没有作出比较时,硬件求解器与经典的进化算法。传统的进化算法,如遗传算法(GA),和DA(或其他类似的求解器)之间进行公平的比较是具有挑战性的,因为后者受益于使用专用硬件,而进化算法往往是在通用机器上实现。此外,量子或量子启发的求解器仅限于以特定格式解决问题。二次无约束二进制优化(QUBO)。然而,许多优化问题是受约束的,并且具有非二进制的自然表示。将这样的问题转换为QUBO可能导致更多的问题难度和/或更大的搜索空间。在本文中解决的问题是量子或量子启发的求解器是否可以优化QUBO变换的组合优化问题的速度比经典的进化算法应用于相同的问题,在其自然表示。我们发现,DA往往提出更好的平均目标函数值比GA旅行推销员,二次分配和多维背包问题的实例。