A hybrid heuristic algorithm for the open-pit-mining operational planning problem
From MaRDI portal
Recommendations
- Multi-objective approaches for the open-pit mining operational planning problem
- A hybrid method based on linear programming and variable neighborhood descent for scheduling production in open-pit mines
- Optimizing open-pit truck route based on minimization of time-varying transport energy consumption
- Modelling and optimizing an open-pit truck scheduling problem
- The new Fundamental Tree Algorithm for production scheduling of open pit mines
Cites work
- scientific article; zbMATH DE number 1219584 (Why is no real title available?)
- scientific article; zbMATH DE number 2050711 (Why is no real title available?)
- A Modeling Language for Mathematical Programming
- A general structure of achievement function for a goal programming model.
- Greedy randomized adaptive search procedures
- Handbook of metaheuristics
- LP-based disaggregation approaches to solving the open pit mining production scheduling problem with block processing selectivity
- Variable neighborhood search
- Variable neighborhood search: Principles and applications
- Variable neighbourhood search: Methods and applications
Cited in
(39)- Multi-objective approaches for the open-pit mining operational planning problem
- Robust planning for an open-pit mining problem under ore-grade uncertainty
- Solving the integrated multi-period scheduling routing problem for cleaning debris in the aftermath of disasters
- A variable neighborhood search-based algorithm with adaptive local search for the vehicle routing problem with time windows and multi-depots aiming for vehicle fleet reduction
- Optimizing open-pit truck route based on minimization of time-varying transport energy consumption
- Energy efficient scheduling of open-pit coal mine trucks
- A hybrid method based on linear programming and variable neighborhood descent for scheduling production in open-pit mines
- Optimizing the open pit-to-underground mining transition
- Large neighborhood-based metaheuristic and branch-and-price for the pickup and delivery problem with split loads
- Importance of verifying queue model assumptions before planning with simulation software
- Layout optimization of crushing station in open-pit mine based on two-stage fusion particle swarm algorithm
- Lexicographic goal programming approach for a short-term mining planning problem
- Optimization of open-pit mine design and production planning with an improved floating cone algorithm
- Evolutionary approach for large-scale mine scheduling
- A sliding time window heuristic for open pit mine block sequencing
- A metaheuristic algorithm for a locomotive routing problem arising in the steel industry
- A multi-objective green UAV routing problem
- Generic Pareto local search metaheuristic for optimization of targeted offers in a bi-objective direct marketing campaign
- A general VNS for the multi-depot open vehicle routing problem with time windows
- An ILS-based algorithm to solve a large-scale real heterogeneous fleet VRP with multi-trips and docking constraints
- A variable neighborhood search for flying sidekick traveling salesman problem
- scientific article; zbMATH DE number 1836380 (Why is no real title available?)
- A novel list-constrained randomized VND approach in GPU for the traveling thief problem
- Efficient algorithms of pathwise dynamic programming for decision optimization in mining operations
- Optimal decision trees for the algorithm selection problem: integer programming based approaches
- A diversified tabu search approach for the open-pit mine production scheduling problem with metal uncertainty
- OPTIMISING THE OPERATIONAL ENERGY EFFICIENCY OF AN OPEN-PIT COAL MINE SYSTEM
- A hybrid iterated local search heuristic for the traveling salesperson problem with hotel selection
- A hybrid variable neighborhood search algorithm for targeted offers in direct marketing
- An enumeration algorithm for solving the fleet management problem in underground mines
- Bi-objective optimization model for the heterogeneous dynamic dial-a-ride problem with no rejects
- Development of a scenario-based robust model for the optimal truck-shovel allocation in open-pit mining
- A dynamic-material-value-based decomposition method for optimizing a mineral value chain with uncertainty
- Concurrent open-pit mine production and in-pit crushing–conveying system planning
- Ils-based algorithms for the profit maximizing uncapacitated hub network design problem with multiple allocation
- Stochastic short-term mine production schedule accounting for fleet allocation, operational considerations and blending restrictions
- An optimization model for the real-time truck dispatching problem in open-pit mining operations
- Dragline operation modelling and task assignment based on mixed-integer linear programming
- Comparative analysis of three metaheuristics for short-term open pit block sequencing
This page was built for publication: A hybrid heuristic algorithm for the open-pit-mining operational planning problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q992718)
