摘要
对确定性需求的联合补充问题,有多种算法,这些算法或不能保证最优解或计算复杂性大,因此提出将模拟退火思想引入遗传算法,应用遗传模拟退火算法求解,阐明了该算法的具体实现过程,并通过算例表明该算法可以更有效地解决此类问题。
There are several algorithms for solving the joint replenishment inventory problem, but they cannot yield the optimal solution or their computational procedures are complex. The simulated annealing idea is introduced into the genetic algorithm to solve the JRP problem, and the specific process for realizing the problem is expounded in this paper. The algorithm is illustrated with an example, and the result obtained indicates that the algorithm can more efficiently solve the problem.
出处
《西华大学学报(自然科学版)》
CAS
2005年第1期56-59,共4页
Journal of Xihua University:Natural Science Edition
关键词
库存
联合补充
遗传算法
模拟退火算法
确定性需求
inventory
joint replenishment
genetic algorithm
simulated annealing algorithm
deterministic demand