Adaptive hybrid approach: combining the lagrangian relaxation approach and the firefly algorithm for the optimisation of the long-term open-pit mine production scheduling problem APCOM 2021

In mine production scheduling problems are well-known, where most are categorised into deterministic and non-deterministic NP-hard problems because of their complexity. Many researchers have attempted to solve the problem by applying various optimisation techniques. While using traditional methods they observed extreme difficulty in solving highly complex problems. In the 1990s, many researchers addressed long-term production scheduling (LTPS) by using simulated annealing, the genetic algorithm, the tabu search algorithm, and the ant colony algorithm. These algorithms are known as the meta-heuristic algorithms, and have proved to be the most efficient algorithms for solving LTPS thus far. The firefly algorithm is one of the best methods for visualising problems related to LTPS, and provides the best possible optimisation. It is one of the simplest methods, and easy to apply to any NP-hard problem. The experimental, and comparison with other recently published algorithms shows that the proposed algorithm is feasible, and is an effective approach for long-term production scheduling problems. The results indicated that a better solution is obtained by the proposed method, compared to other methods in terms of cumulative net present value, and average ore grade. Additionally, the CPU time via the proposed model is roughly 2.52% higher than the other method.