帶分段倉儲能力決策的動態(tài)批量優(yōu)化問題研究
發(fā)布時間:2018-08-02 20:47
【摘要】:本文考慮一個單一產(chǎn)品倉儲能力決策和庫存決策的動態(tài)批量集成優(yōu)化問題.在這個模型中,長度為T個周期的計劃期被劃分成連續(xù)的若干段,每段初需制定該段的倉儲能力決策,同一段中各期的期末庫存水平均受限于該段倉儲能力.假設每段倉儲能力費用為倉儲能力的非減函數(shù),各期的產(chǎn)品訂貨費用為固定費用,庫存保管費用是一個期末庫存量的線性函數(shù).利用分解技術和幾何技術,本文開發(fā)一個計算復雜度為O(T~3)的動態(tài)規(guī)劃算法.計算測試顯示,該算法與求解混合整數(shù)規(guī)劃(MIP)的商業(yè)軟件相比,在計算時間上具有明顯的優(yōu)勢.
[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).
【作者單位】: 暨南大學管理學院;
【基金】:暨南大學企業(yè)發(fā)展研究所提供部分資助~~
【分類號】: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).
【作者單位】: 暨南大學管理學院;
【基金】:暨南大學企業(yè)發(fā)展研究所提供部分資助~~
【分類號】:F273;O221.3
【相似文獻】
中國期刊全文數(shù)據(jù)庫 前2條
1 林昶;黃慶;卜祥智;;第三方倉儲能力配置與分配的收益優(yōu)化[J];西南交通大學學報;2007年03期
2 林昶;帥斌;卜祥智;黃慶;;基于需求更新的第三方倉儲能力分配優(yōu)化[J];系統(tǒng)工程;2007年03期
,本文編號:2160683
本文鏈接:http://sikaile.net/kejilunwen/yysx/2160683.html
最近更新
教材專著