| 固定采购成本与最小采购量约束下的周期库存 |
| |
| 引用本文： | 张龙,宋士吉,刘连臣,吴澄.固定采购成本与最小采购量约束下的周期库存[J].哈尔滨工业大学学报,2003,35(12):1412-1414,1421. |
| |
| 作者姓名： | 张龙 宋士吉 刘连臣 吴澄 |
| |
| 作者单位： | 清华大学,国家CIMS工程技术研究中心,北京,100084 |
| |
| 基金项目： | 国家重点基础研究发展规划资助项目(2002cb312205)，清华大学基础研究基金资助项目(JC 2001029) |
| |
| 摘 要： | 对最低采购量约束下带有固定采购成本的随机库存模型进行了分析．当约束作用在单周期或双周期下，得到了最优库存控制策略，并给出求解方法．当约束作用在多周期下，问题性质复杂，难以得到最优解，给出了利用进化计算与BP神经网络结合寻找多周期问题近优解的方法，有效降低了计算复杂度．仿真实例表明使用该方法的误差很小．
|
| 关 键 词： | 采购成本 库存管理 BP神经网络 企业管理 供应链管理 |
| 文章编号： | 0367-6234(2003)12-1412-03 |
Inventory management with setup cost and total minimum commitment |
| |
| ZHANG Long,SONG Shi-ji,LIU Lian-chen,WU Cheng.Inventory management with setup cost and total minimum commitment[J].Journal of Harbin Institute of Technology,2003,35(12):1412-1414,1421. |
| |
| Authors: | ZHANG Long SONG Shi-ji LIU Lian-chen WU Cheng |
| |
| Abstract: | The inventory stochastic model with setup cost and total minimum commitment is used to establish. The optimal purchase policy while the commitment is restricted on one or two periods, and the method is given to find the optimal solution. When the commitment is restricted on three or more period, this question is complex, and finding optimal solution is almost impossible. Combining the evolutionary computation and neural network, an algorithm is proposed to easily find the near optimal solution. Numeral analyses show that the computational complexity is reduced and the error is small. |
| |
| Keywords: | inventory management minimum commitment optimization |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
