4.1 Article

An Optimization for Ore Blending Schedules Using Mathematical Programming Methods

出版社

IRON STEEL INST JAPAN KEIDANREN KAIKAN
DOI: 10.2355/tetsutohagane.TETSU-2020-008

关键词

ore blending; mathematical programming; optimization; linear programming; meta heuristics; particle swarm optimization; multi-point search method

向作者/读者索取更多资源

We have developed an optimal scheduling method for raw material operations aiming the raw materials cost reduction. In this paper, we report optimization approaches to minimize the cost of ore blending in steel works. The ore blending problem is to make schedules for the purpose of cost minimization under several constraints such as the stock in yards, ingredients in sintered ore. When formulating as a mathematical model, nonlinearity exists in this problem and make it complicated. However, this problem has characteristic that becomes a linear problem by fixing several key variables as constants. To overcome the nonlinearity, we developed our original Hybrid model that was a combination of Particle Swarm Optimization (PSO) and Linear Programming method (LP). We applied PSO to search the best way of fixing key variables, and obtained blending schedules by solving LPs. Our Hybrid model searched wide area effectively, and derived the solution within 2 minutes. Numerical experiments indicated a cost reduction of secondary materials by 1%.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.1
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据