{'fraction_non_alphanumeric': 0.02077687443541102, 'fraction_numerical': 0.011743450767841012, 'mean_word_length': 5.404624277456647, 'pattern_counts': {'":': 0, '<': 0, '<?xml version=': 0, '>': 0, 'https://': 0, 'lorem ipsum': 0, 'www.': 0, 'xml': 0}, 'pii_count': 0, 'substrings_counts': 0, 'word_list_counts': {'cursed_substrings.json': 0, 'profanity_word_list.json': 0, 'sexual_word_list.json': 0, 'zh_pornsignals.json': 0}}
An application of mathematical programming to determine the best height of draw in block-cave sequence optimisation

Abstract Planning block-caving operations poses complexities in different areas such as safety, environment, ground control and production scheduling. The objective of this paper is to develop a practical optimisation framework for production scheduling of block-caving operations. A mixed-integer linear programming (MILP) formulation is developed, implemented and verified in the TOMLAB/CPLEX environment. In this formulation, the slices within each draw column are aggregated into selective units using a hierarchical clustering algorithm and the mining reserve is computed as a result of the optimal production schedule for each advancement direction. This paper presents a model application of a production schedule for 102 drawpoints with 3457 slices over 14 periods. The results show in order to obtain the maximum net present value (NPV), only 88% of the reserve is extracted. Also, the solving time for the presented method is 78 times faster than method without slice aggregation.