Can I read Recursive Heuristic for Knapsack Problems on EtoBox?
Recursive Heuristic for Knapsack Problems by Kevin Rios is a document available to read on EtoBox.
What is Recursive Heuristic for Knapsack Problems about?
This document presents a recursive time aggregation-disaggregation (RAD) heuristic aimed at solving large-scale multidimensional and multiperiod precedence-constrained knapsack problems (MMPKP), particularly applied to the open-pit mine block sequencing problem (BSP). The RAD heuristic effectively maximizes net present value while adhering to resource consumption constraints and precedence rules, demonstrating its capability to handle extensive instances with over 2 million blocks. The research highlights t
- Author
- Kevin Rios
- Language
- EN