The Mix Integer Programming Model for Torpedo Car Scheduling in Iron and Steel Industry

DOI

10.2991/cisia-15.2015.199How to use a DOI?

Keywords

torpedo car scheduling; mixed integer programming; heuristics; the nearest neighbourhood

Abstract

The scheduling for molten iron logistic optimization is to determine the distribution of molten iron from iron-making stage to steelmaking stage, the transportation routes of torpedo cars and locomotives such that the molten iron from blast furnaces can be delivered to the steelmaking shops on schedule and on quality. By taking the molten iron transportation process of an iron and steel enterprise as research background, the paper investigated the torpedo car scheduling problem, which is a key problem in the molten iron logistics optimization and developed a mixed integer programming model. The model was then solved by commercial optimization software CPLEX to obtain the torpedo car scheduling scheme. Meanwhile, another scheduling scheme was obtained by a heuristics based on the nearest neighborhood idea in which the earliest available torpedo car is used to service the un-serviced task whose tapping time is the earliest. Two schemes were compared to validate the efficacy and reasonability of the model.

Copyright

© 2015, the Authors. Published by Atlantis Press.

Open Access

This is an open access article distributed under the CC BY-NC license (http://creativecommons.org/licenses/by-nc/4.0/).

Download article (PDF)

TY  - CONF
AU  - Y.Y Liu
AU  - G.S Wang
PY  - 2015/06
DA  - 2015/06
TI  - The Mix Integer Programming Model for Torpedo Car Scheduling in Iron and Steel Industry
BT  - Proceedings of the International Conference on Computer Information Systems and Industrial Applications
PB  - Atlantis Press
SP  - 731
EP  - 734
SN  - 2352-538X
UR  - https://doi.org/10.2991/cisia-15.2015.199
DO  - 10.2991/cisia-15.2015.199
ID  - Liu2015/06
ER  -