Rail schedule optimisation in the hunter valley coal chain

DOI10.1051/ro/2014049zbMath1310.90016OpenAlexW2025285845MaRDI QIDQ5247704

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

Publication date: 27 April 2015

Published in: RAIRO - Operations Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1051/ro/2014049

zbMATH Keywords

Lagrangian relaxationmixed integer programmingcoal supply chainrail scheduling

Mathematics Subject Classification ID

Transportation, logistics and supply chain management (90B06) Deterministic scheduling theory in operations research (90B35)

Related Items

Mathematical models for the berth allocation problem in dry bulk terminals

Cites Work

• Unnamed Item
• Resource constraint scheduling with a fractional shared resource
• Optimising a coal rail network under capacity constraints
• Railway track allocation: Models and methods
• A column generation approach to the heterogeneous fleet vehicle routing problem
• On the choice of explicit stabilizing terms in column generation
• The volume algorithm: Producing primal solutions with a subgradient method
• A mixed integer programming model for long term capacity expansion planning: a case study from the Hunter valley coal chain
• A Survey of Optimization Models for Train Routing and Scheduling
• Solving a resource allocation problem in wireless mesh networks: A comparison between a CP-based and a classical column generation
• A Genetic Algorithm for Railway Scheduling Problems