Abstract:
This research focuses on the short-term scheduling of the
vertical slicing method applied dredge mine sites. An algorithm was developed
to outline the region to mine, when the block model, optimum pit limit,
topography limit and the market demand are given. The algorithm is based on
the concepts. of dynamic programming and zero-one integer programming to
avoid repetitive solutions and memorize the previous stage outcome for the
next stage process. It utilizes 3D matrix to store previous and next stage
solutions with three integers representation for "possible future mining",
"already mined" and "never mine" conditions. The algorithm is used on 2D
resource block model, which is obtained by pre-processing optimized 3D block
model to 2D plan-view block model. The developed algorithm was faster and
required less data storage over the conventional method due to exclusion of
repetitive solutions in the processing.
