本文選題：配礦 + 供應(yīng)鏈�。� 參考：《同濟(jì)大學(xué)學(xué)報(自然科學(xué)版)》2017年04期

【摘要】：從供應(yīng)鏈角度出發(fā),分析原礦配礦的生產(chǎn)特點,考慮生產(chǎn)任務(wù)和生產(chǎn)能力限制、庫存平衡約束、資源消耗量限制以及質(zhì)量指標(biāo)等要求,以生產(chǎn)、運輸、庫存總成本最小、所獲得凈利潤最大及質(zhì)量品位偏差最小為目標(biāo)建立了0-1混合整數(shù)規(guī)劃數(shù)學(xué)模型.采用拉格朗日松弛(LR)算法對該模型進(jìn)行求解.仿真實驗結(jié)果表明,中規(guī)模算例LR算法可以在較快時間內(nèi)獲得可行解,大規(guī)模算例可以在CPLEX軟件求不到解的情況下運用LR算法在可接受時間內(nèi)得到可行解.最后對出礦點品位參數(shù)進(jìn)行了靈敏度分析,品位的擾動對質(zhì)量偏差以及總目標(biāo)函數(shù)值有較大的敏感性.
[Abstract]:From the point of view of supply chain, this paper analyzes the production characteristics of raw ore blending, considers the requirements of production task and production capacity restriction, inventory balance constraint, resource consumption limitation and quality index, etc. The total cost of production, transportation and inventory is the lowest. A 0-1 mixed integer programming mathematical model is established for the purpose of maximum net profit and minimum quality grade deviation. Lagrange relaxation LR algorithm is used to solve the model. The simulation results show that the LR algorithm can obtain the feasible solution in a faster time, and the large scale example can obtain the feasible solution in the acceptable time by using LR algorithm when the CPLEX software is not able to find the solution. Finally, the sensitivity analysis of the ore point grade parameters is carried out. The disturbance of grade has a great sensitivity to the mass deviation and the total objective function value.
【作者單位】： 東北大學(xué)工業(yè)與系統(tǒng)工程研究所;遼寧省交通高等�？茖W(xué)校;
【基金】：國家自然科學(xué)基金(71321001)
【分類號】：F274;F426.1
，

本文編號：1837459