Comparative analysis of three metaheuristics for short-term open pit block sequencing
From MaRDI portal
Publication:525065
DOI10.1007/s10732-016-9311-zzbMath1360.90307OpenAlexW2407291853MaRDI QIDQ525065
Erhan Kozan, Amin Mousavi, Shi Qiang Liu
Publication date: 28 April 2017
Published in: Journal of Heuristics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10732-016-9311-z
simulated annealingtabu searchmixed integer programminghybrid metaheuristicopen pit miningshort-term block sequencing
Mixed integer programming (90C11) Approximation methods and heuristics in mathematical programming (90C59)
Related Items
A real-world mine excavators timetabling methodology in open-pit mining ⋮ Optimization of open-pit mine design and production planning with an improved floating cone algorithm ⋮ Solution procedures for block selection and sequencing in flat-bedded potash underground mines
Uses Software
Cites Work
- Optimization by Simulated Annealing
- Long term production planning of open pit mines by ant colony optimization
- Aggregation heuristic for the open-pit block scheduling problem
- MineLib: a library of open pit mining problems
- Optimising a coal rail network under capacity constraints
- A sliding time window heuristic for open pit mine block sequencing
- An application of branch and cut to open pit mine scheduling
- An effective two-stage simulated annealing algorithm for the minimum linear arrangement problem
- Large-scale multi-period precedence constrained knapsack problem: A mining application
- Hybrid Metaheuristics: An Introduction
- Tabu Search—Part I
- Tabu Search—Part II
- A New Algorithm for the Open-Pit Mine Production Scheduling Problem
- A simulated annealing approach to mine production scheduling
