4.1 Article

An Optimization for Ore Stockyard Layout Operation Schedules Using Multi -Start Greedy Algorithm

出版社

IRON STEEL INST JAPAN KEIDANREN KAIKAN
DOI: 10.2355/tetsutohagane.TETSU-2023-043

关键词

stockyard layout; mathematical programming; optimization; linear programming; rolling schedule; greedy; metaheuristics; multipoint search

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

This article introduces an optimal scheduling method for multiple stockpiles in a stockyard, aiming to improve logistics efficiency and operational stability for steelworks. The developed Stockpile Layout Planner utilizes a multi-start Greedy algorithm to optimize yard operations and ensure efficient ore management.
We have developed an optimal scheduling method for the highly efficient management of multiple stockpiles of iron ore in the stockyard to significantly improve both yard logistics and the operational stability of steelworks. The ore stockyard layout problem is to make inventory schedules for the purpose of cost minimization under several constraints such as uptime of facilities. While the number of stockpiles generally must be minimized for efficiency, excessive minimization can raise the risk of undelivery of iron ore if the required transport equipment become unavailable due to daily maintenance or a mechanical problem. The key, therefore, is to devise a plan that realizes both efficient yard operations and stable steelworks operation. In response, we developed Stockpile Layout Planner which optimizes yard operations by creating ideal plans for up to several months with multi -start Greedy based algorithm that completes complicated logistical calculations in less than one minute. The new method ensures that such logistics are handled efficiently to realize highly stable ore management.

作者

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

评论

主要评分

4.1
评分不足

次要评分

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

推荐

暂无数据
暂无数据