Rail schedule optimisation in the hunter valley coal chain
RAIRO - Operations Research - Recherche Opérationnelle, New challenges in scheduling theory, Tome 49 (2015) no. 2, pp. 413-434

Voir la notice de l'article provenant de la source Numdam

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.

Reçu le :
Accepté le :
DOI : 10.1051/ro/2014049
Classification : 90B06, 90B35
Keywords: Mixed integer programming, coal supply chain, rail scheduling, lagrangian relaxation

Singh, Gaurav 1 ; Ernst, Andreas T. 1 ; Baxter, Matthew 1 ; Sier, David 1

1 CSIRO Mathematics, Informatics and Statistics Private Bag 33, Clayton South MDC, 3168 Victoria, Australia.
@article{RO_2015__49_2_413_0,
     author = {Singh, Gaurav and Ernst, Andreas T. and Baxter, Matthew and Sier, David},
     editor = {Blazewicz, Jacek and Pesch, Erwin and Philipps, Cynthia and Trystram, Denis and Zhang, Guochuan},
     title = {Rail schedule optimisation in the hunter valley coal chain},
     journal = {RAIRO - Operations Research - Recherche Op\'erationnelle},
     pages = {413--434},
     publisher = {EDP-Sciences},
     volume = {49},
     number = {2},
     year = {2015},
     doi = {10.1051/ro/2014049},
     mrnumber = {3349157},
     zbl = {1310.90016},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.1051/ro/2014049/}
}
TY  - JOUR
AU  - Singh, Gaurav
AU  - Ernst, Andreas T.
AU  - Baxter, Matthew
AU  - Sier, David
ED  - Blazewicz, Jacek
ED  - Pesch, Erwin
ED  - Philipps, Cynthia
ED  - Trystram, Denis
ED  - Zhang, Guochuan
TI  - Rail schedule optimisation in the hunter valley coal chain
JO  - RAIRO - Operations Research - Recherche Opérationnelle
PY  - 2015
SP  - 413
EP  - 434
VL  - 49
IS  - 2
PB  - EDP-Sciences
UR  - http://geodesic.mathdoc.fr/articles/10.1051/ro/2014049/
DO  - 10.1051/ro/2014049
LA  - en
ID  - RO_2015__49_2_413_0
ER  - 
%0 Journal Article
%A Singh, Gaurav
%A Ernst, Andreas T.
%A Baxter, Matthew
%A Sier, David
%E Blazewicz, Jacek
%E Pesch, Erwin
%E Philipps, Cynthia
%E Trystram, Denis
%E Zhang, Guochuan
%T Rail schedule optimisation in the hunter valley coal chain
%J RAIRO - Operations Research - Recherche Opérationnelle
%D 2015
%P 413-434
%V 49
%N 2
%I EDP-Sciences
%U http://geodesic.mathdoc.fr/articles/10.1051/ro/2014049/
%R 10.1051/ro/2014049
%G en
%F RO_2015__49_2_413_0
Singh, Gaurav; Ernst, Andreas T.; Baxter, Matthew; Sier, David. Rail schedule optimisation in the hunter valley coal chain. RAIRO - Operations Research - Recherche Opérationnelle, New challenges in scheduling theory, Tome 49 (2015) no. 2, pp. 413-434. doi: 10.1051/ro/2014049

Cité par Sources :