Optimum Utilisation of Rolling Stocks for Iron Ore Mining Industries

被引:2
作者
Liu, Shi Qiang [1 ]
Kozan, Erhan [1 ]
机构
[1] Queensland Univ Technol, Brisbane, Qld 4001, Australia
来源
NATURAL RESOURCES AND SUSTAINABLE DEVELOPMENT, PTS 1-3 | 2012年 / 361-363卷
关键词
mining; resources utilisation; energy saving; iron ore; scheduling; SCHEDULING TRAINS;
D O I
10.4028/www.scientific.net/AMR.361-363.1529
中图分类号
TE [石油、天然气工业]; TK [能源与动力工程];
学科分类号
0807 ; 0820 ;
摘要
In this paper, a generic and flexible optimisation methodology is developed to represent, model, solve and analyse the iron ore supply chain system by integrating of iron ore shipment, stockpiles and railing within a whole system. As a result, an integrated train-stockpile-ship timetable is created and optimised for improving efficiency of overall supply chain system. The proposed methodology provides better decision making on how to significantly improve rolling stock utilisation with the best cost-effectiveness ratio. Based on extensive computational experiments and analysis, insightful and quantitative advices are suggested for iron ore mine industry practitioners. The proposed methodology contributes to the sustainability of the environment by reducing pollution due to better utilisation of transportation resources and fuel.
引用
收藏
页码:1529 / 1534
页数:6
相关论文
共 11 条
[1]   A disjunctive graph model and framework for constructing new train schedules [J].
Burdett, R. L. ;
Kozan, E. .
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 200 (01) :85-98
[2]   Techniques for inserting additional trains into existing timetables [J].
Burdett, R. L. ;
Kozan, E. .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2009, 43 (8-9) :821-836
[3]   A column generation approach to train timetabling on a corridor [J].
Cacchiani, Valentina ;
Caprara, Alberto ;
Toth, Paolo .
4OR-A QUARTERLY JOURNAL OF OPERATIONS RESEARCH, 2008, 6 (02) :125-142
[4]   A Lagrangian heuristic algorithm for a real-world train timetabling problem [J].
Caprara, A ;
Monaci, M ;
Toth, P ;
Guida, PL .
DISCRETE APPLIED MATHEMATICS, 2006, 154 (05) :738-753
[5]   Scheduling trains on a network of busy complex stations [J].
Carey, Malachy ;
Crawford, Ivan .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2007, 41 (02) :159-178
[6]   A tabu search algorithm for rerouting trains during rail operations [J].
Corman, Francesco ;
D'Ariano, Andrea ;
Pacciarelli, Dario ;
Pranzo, Marco .
TRANSPORTATION RESEARCH PART B-METHODOLOGICAL, 2010, 44 (01) :175-192
[7]   Design of an effective algorithm for fast response to the re-scheduling of railway traffic during disturbances [J].
Krasemann, Johanna Tornquist .
TRANSPORTATION RESEARCH PART C-EMERGING TECHNOLOGIES, 2012, 20 (01) :62-78
[8]   A hybrid shifting bottleneck procedure algorithm for the parallel-machine job-shop scheduling problem [J].
Liu, S. Q. ;
Kozan, E. .
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 2012, 63 (02) :168-182
[9]   Scheduling Trains with Priorities: A No-Wait Blocking Parallel-Machine Job-Shop Scheduling Model [J].
Liu, Shi Qiang ;
Kozan, Erhan .
TRANSPORTATION SCIENCE, 2011, 45 (02) :175-198
[10]   Scheduling trains as a blocking parallel-machine job shop scheduling problem [J].
Liu, Shi Qiang ;
Kozan, Erhan .
COMPUTERS & OPERATIONS RESEARCH, 2009, 36 (10) :2840-2852