Hierarchical Benders decomposition for open-pit mine block sequencing
Vossen, Thomas W.M.
Wood, R. Kevin
Newman, Alexandra M.
MetadataShow full item record
The open-pit mine block sequencing problem (OPBS) models a deposit of ore and surrounding material near the Earth’s surface as a three-dimensional grid of blocks. A solution in discretized time identifies a profit-maximizing extraction (mining) schedule for the blocks. Our model variant, a mixed-integer program (MIP), presumes a predetermined destination for each extracted block, namely, processing plant or waste dump. The MIP incorporates standard constructs but also adds not-so-standard lower bounds on resource consumption in each time period and allows fractional block extraction in a novel fashion while still enforcing pit-wall slope restrictions. A new extension of nested Benders decomposition, “hierarchical” Benders decomposition (HBD), solves the MIP’s linear-programming relaxation. HBD exploits time-aggregated variables and can recursively decompose a model into a master problem and two subproblems rather than the usual single subproblem. A specialized branch-and-bound heuristic then produces high-quality, mixed-integer solutions. Medium-sized problems (e.g., 25,000 blocks and 20 time periods) solve to near optimality in minutes. To the best of our knowledge, these computational results are the best known for instances of OPBS that enforce lower bounds on resource consumption.
The article of record as published may be found at http://dx.doi.org/10.1287/opre.2016.1516
RightsThis publication is a work of the U.S. Government as defined in Title 17, United States Code, Section 101. Copyright protection is not available for this work in the United States.
Showing items related by title, author, creator and subject.
Draftsmans displays for contingency tables using a full-screen, scrollable APL2 spreadsheet input/output editor with application to the PERSEREC database of Special Background Investigation Steinfeld, Uwe H. (Monterey, California. Naval Postgraduate School, 1990);A full-screen, scrollable spreadsheet-like editor written in the APL2 language is described for inputting, examining and outputting data. Mixed numeric and character arrays can be read into or read out to formatted DOS ...
Lewis, Peter A. W.; Steinfeld, Uwe H. (Monterey, California. Naval Postgraduate School, 1990); NPS-55-90-08A full-screen, scrollable spreadsheet-like editor written in the APL2 language is described for inputting, examining and outputting data. Mixed numeric and character arrays can be read into or read out to formatted DOS ...
Hash-based carving: Searching media for complete files and file fragments with sector hashing and hashdb Garfinkel, Simson L.; McCarrin, Michael (Elsevier, 2015);Hash-based carving is a technique for detecting the presence of specific “target files” on digital media by evaluating the hashes of individual data blocks, rather than the hashes of entire files. Unlike whole-file hashing, ...