A mixed integer programming model for long term capacity expansion planning: A case study from The Hunter Valley Coal Chain

A mixed integer programming model for long term capacity expansion planning: A case study from The Hunter Valley Coal Chain

0.00 Avg rating0 Votes
Article ID: iaor20122414
Volume: 220
Issue: 1
Start Page Number: 210
End Page Number: 224
Publication Date: Jul 2012
Journal: European Journal of Operational Research
Authors: , , , , , ,
Keywords: programming: integer, combinatorial optimization, networks, supply & supply chains
Abstract:

The Hunter Valley Coal Chain is the largest coal export operation in the world with a throughput in excess of 100 million tonnes per annum (Mtpa). Coal is delivered to the shipping terminal from 40 mines using 27 coal load points spread across the Hunter Valley region. This paper describes an MILP model for determining the capacity requirements, and the most cost effective capacity improvement initiatives, to meet demand while minimising the total cost of infrastructure and demurrage. We present results from computational experiments on the model’s performance along with a comparison of the model’s output with detailed analyses by the coal chain analysts and planners.

Reviews

Required fields are marked *. Your email address will not be published.