带分段仓储能力决策的动态批量优化问题研究
发布时间：2018-08-02 20:47
【摘要】：本文考虑一个单一产品仓储能力决策和库存决策的动态批量集成优化问题.在这个模型中,长度为T个周期的计划期被划分成连续的若干段,每段初需制定该段的仓储能力决策,同一段中各期的期末库存水平均受限于该段仓储能力.假设每段仓储能力费用为仓储能力的非减函数,各期的产品订货费用为固定费用,库存保管费用是一个期末库存量的线性函数.利用分解技术和几何技术,本文开发一个计算复杂度为O(T~3)的动态规划算法.计算测试显示,该算法与求解混合整数规划(MIP)的商业软件相比,在计算时间上具有明显的优势.
[Abstract]:In this paper, a dynamic batch integration optimization problem for single product warehousing capacity decision and inventory decision is considered. In this model, the planning period with T cycle length is divided into several successive segments, and the storage capacity decision of each segment should be made at the beginning of each section, and the end inventory level of each period in the same section is limited by the storage capacity of this section. The cost of storage capacity is assumed to be a non-minus function of storage capacity, the cost of ordering goods in each period is a fixed cost, and the cost of keeping inventory is a linear function of the inventory at the end of the period. In this paper, a dynamic programming algorithm with computational complexity of O (T3) is developed by using decomposition and geometry techniques. The computational tests show that the algorithm has obvious advantages in computing time compared with commercial software for solving mixed integer programming (MIP).
【作者单位】： 暨南大学管理学院;
【基金】：暨南大学企业发展研究所提供部分资助~~
【分类号】：F273;O221.3
本文编号：2160683
[Abstract]:In this paper, a dynamic batch integration optimization problem for single product warehousing capacity decision and inventory decision is considered. In this model, the planning period with T cycle length is divided into several successive segments, and the storage capacity decision of each segment should be made at the beginning of each section, and the end inventory level of each period in the same section is limited by the storage capacity of this section. The cost of storage capacity is assumed to be a non-minus function of storage capacity, the cost of ordering goods in each period is a fixed cost, and the cost of keeping inventory is a linear function of the inventory at the end of the period. In this paper, a dynamic programming algorithm with computational complexity of O (T3) is developed by using decomposition and geometry techniques. The computational tests show that the algorithm has obvious advantages in computing time compared with commercial software for solving mixed integer programming (MIP).
【作者单位】： 暨南大学管理学院;
【基金】：暨南大学企业发展研究所提供部分资助~~
【分类号】：F273;O221.3
【相似文献】
中国期刊全文数据库 前2条
1 林昶;黄庆;卜祥智;;第三方仓储能力配置与分配的收益优化[J];西南交通大学学报;2007年03期
2 林昶;帅斌;卜祥智;黄庆;;基于需求更新的第三方仓储能力分配优化[J];系统工程;2007年03期
，本文编号：2160683
本文链接：https://www.wllwen.com/kejilunwen/yysx/2160683.html
