Abstract
Annotation . This article describes algorithm for solving ultimate pit limit problem (UPIT), or a maximum weight closure problem. There are several method for solving this problem. We provides new approach, forsolving ultimate pit limit problem using precedence model.Block model of open pit can be easily represented as an oriented graph. Then to solve ultimate pit limit problem it is required to find such a subgraph in a graph whose sum of weights will be maximal. One of the possible solutions of this problem is using genetic algorithms.We use a parallel genetic algorithm for accelerating of computational process. In this version of algorithm fitness function of each individual calculating in different thread. It allows reducing running time of algorithm.Details of implementation parallel genetic algorithm for searching open pit limitsare provided. Comparison with other methods and results of computational experiments provided.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
