联合补充库存的拉格朗日松弛与退火算法  

A Ragelari Relaxation Method and Annealing Algorithm of Joint Replenishment Problem

作　　者：梁志杰[1] 彭杰[1] 

机构地区：[1]西南财经大学工商管理学院,四川成都610074

出　　处：《西华大学学报（自然科学版）》2010年第1期37-41,共5页Journal of Xihua University:Natural Science Edition

基　　金：国家自然科学基金(70502028)

摘　　要：针对确定性需求的联合生产补充(JRP)问题,有多种启发式算法,但这些算法或不能保证最优或计算复杂。本文利用现代优化方法模拟退火算法和拉格朗日松驰算法,设计出一种新的算法,通过算例表明该算法可得出较优的可行解,可以更有效地解决实际问题。There are several heuristic algorithms for joint replenishment inventory problems, but among which none can guarantee to yield an optimal solution or the computation is complex. This paper presents a new algorithm based on simulated annealing algorithm and Ragelari relaxation algorithm. The algorithm is illustrated with an example, and the result indicates that the algorithm can efficiently solve the problem.

关 键 词：库存 联合补充 拉格郎日松弛算法 模拟退火算法 确定性需求 

分 类 号：F22[经济管理—国民经济] O232[理学—运筹学与控制论]