摘要
实验室预约是实验教学中不可或缺的组成部分,现有的关于解决预约的机制或多或少存在着一定的问题。背包算法、模拟退火算法在实验室预约机制中的应用比较广泛,不管是背包算法还是模拟退火算法,其最终目的都是为了寻找出相对较优的解决方案。本文分别对以上2种算法进行对比分析,简述了2种算法的实现过程及适用情况,对比了2种算法应用于实验室预约机制上的优缺点。
Laboratory appointments are an integral part of experimental teaching. The existing mechanisms for resolving appointments have more or less problems. The knapsack algorithm and simulated annealing algorithm are widely used in the laboratory reservation mechanism. Whether it is a knapsack algorithm or a simulated annealing algorithm,the ultimate goal is to find a relatively better solution. In this paper,the above two algorithms are compared and analyzed respectively. The implementation process and application of the two algorithms are briefly described. The advantages and disadvantages of the two algorithms applied to the laboratory reservation mechanism are also compared.
作者
董萃莲
董海峰
DONG Cuilian;DONG Haifeng(School of Computer Science,Xi'an Shiyou University,Xi'an 710065,China)
出处
《智能计算机与应用》
2019年第2期172-174,179,共4页
Intelligent Computer and Applications
关键词
背包算法
模拟退火算法
实验室预约
对比分析
knapsack algorithm
simulated annealing algorithm
laboratory reservation
comparative analysis
