Volume 49, Number 2, April-May 2015
New challenges in scheduling theory
|Page(s)||413 - 434|
|Published online||19 January 2015|
Rail schedule optimisation in the hunter valley coal chain
CSIRO Mathematics, Informatics and Statistics Private Bag 33, Clayton South
MDC, 3168 Victoria, Australia.
Accepted: 26 September 2014
This paper describes a method for scheduling trains on the Hunter Valley Coal Chain rail network. Coal for a particular ship is railed from different mines to stockpiles at one of the Port’s terminals. The coal producers decide which mines will supply each order in what proportion, so there is no flexibility in the allocation of mines to cargoes. We are presented with a list of tonnes of coal which need to be transported from specified load points at mines to specified stockpiles at the port. The operators of the rail network provide a number of paths, with specified arrival and departure times, that can be used for coal movement. The requirement to assign coal trains to these existing paths makes this rail scheduling problem different to most of those discussed in the literature. In this paper we describe the problem in detail, demonstrate that it is very large making it difficult to solve with commercial MILP solvers, and show that our Lagrangian heuristic is able to produce high quality solutions in a reasonable amount of time.
Mathematics Subject Classification: 90B06 / 90B35
Key words: Mixed integer programming / coal supply chain / rail scheduling / lagrangian relaxation
© EDP Sciences, ROADEF, SMAI 2015
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.