Abstract
A multi-period planning model for underground cut-and-fill operations was constructed for the purpose of maximizing discounted profit under given production constraints. The ore grades were estimated through geostatistics for minimizing the estimation errors, and production costs were calculated on the basis of the practical operation data. A sequential planning algorithm based on dynamic programming (DP) was then developed to specify the most profitable mining sequence, and applied to a Chinese copper-iron mine employing cut-and-fill stoping. Calculation results showed that the proposed DP-based sequential planning strategy can produce larger discounted profits than those obtained by the advance and retreat mining sequences.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
