Search results

1 – 1 of 1
Article
Publication date: 7 November 2024

Jorge Luiz Valença Mariz, Rodrigo de Lemos Peroni, Ricardo Martins de Abreu Silva, Mohammad Mahdi Badiozamani and Hooman Askari-Nasab

The mine sequencing problem is NP-hard. Therefore, simplifying it is necessary. One way to do this is to employ clusters as input instead of individual blocks. The mining cut…

Abstract

Purpose

The mine sequencing problem is NP-hard. Therefore, simplifying it is necessary. One way to do this is to employ clusters as input instead of individual blocks. The mining cut clustering problem has been little addressed in the literature, and the solutions used are almost always heuristic. We solve the mining cut clustering problem, which is NP-hard, through single- and multi-objective optimization, finding results that are local optima in acceptable computational time.

Design/methodology/approach

We first elaborate an ILP-based model to address the mining cut clustering problem. We employ a mono-objective approach and two multi-objective approaches, solving all these models by constraint programming. To choose the best solutions generated by multi-objective approaches, we employ two multi-criteria decision analysis approaches, considering different weight configurations. We developed a case study using real data.

Findings

We verified that the approaches based on multi-objective optimization performed better than the mono-objective approach for the economic return criterion. The weighted-sum multi-objective approach presented the best results considering all objective functions used. Once viable solutions were obtained through multi-objective optimization, multi-criteria decision analysis approaches almost always selected the same solution. We obtained solutions that are local optima in acceptable computational time.

Research limitations/implications

This study solves an instance with 80 blocks. Consequently, it is aimed at short-term mine planning. The methodology has not yet been evaluated in large instances related to medium- and long-term mine planning.

Originality/value

This is the first time that multi-objective optimization has been employed to solve the mining cut custering problem. Even other problems related to mine planning were, at most, solved by goal programming, so that multi-objective optimization is a knowledge that is not widespread among mining researchers. The results are consistent, and the study achieves the objective of finding quality solutions to an NP-hard problem in an acceptable computational time.

Details

Engineering Computations, vol. 41 no. 10
Type: Research Article
ISSN: 0264-4401

Keywords

Access

Year

Last 3 months (1)

Content type

1 – 1 of 1