摘要
基于ＳＬＵＬＳＰ问题的性质提出了用遗传算法（ＧＡ）来进行求解．通过１０个随机产生的问题进行实验．结果表明，这１０个问题的平均计算结果与通过动态规划获得的最优解进行比较，近优率平均可达３．２９％以内．
The single level uncapacitated lot sizing problem (SLULSP) is to determine production lot sizes of a single itcm over pcriods so as to minimize the sum of setup costs and inventory holding costs over the planning horizon,while satisfying given demands in discrcte time pcriods. In this paper authors proposed a new heuristic based on genetic stochastic search method to solve SLULSP. Computational results for 10 randomly generated problems involving from 5 to 50 periods in the planning horizon show that the average percent errors given by our algorithm are within 7% as compared to opitimum solutions given by use of dynamic programming algorithm.
出处
《东北大学学报（自然科学版）》
EI
CAS
CSCD
北大核心
1997年第3期312-315,共4页
Journal of Northeastern University(Natural Science)
基金
国家"八六三"高技术项目
