A Genetic Algorithm with Zooming for the Determination of the Optimal Open Pit Mines Layout
نویسندگان
چکیده
منابع مشابه
A Genetic Algorithm with Zooming for the Determination of the Optimal Open Pit Mines Layout
Different genetic procedures are applied to increase robustness, namely two typologies of admissible mutations for the elite subpopulation subjected to zooming and mutation and reproduction for the remaining individuals. In order to further improve convergence rate, a user-defined population percentage, depending on individuals fitness, is replaced with new phenotypes, enforcing chromosomic ren...
متن کاملDetermination of the largest pit with the non-negative net profit in the open pit mines
The determination of the Ultimate Pit Limit (UPL) is the first step in the open pit mine planning process. In this stage that parts of the mineral deposit that are economic to mine are determined. There are several mathematical, heuristic and meta-heuristic algorithms to determine UPL. The optimization criterion in these algorithms is maximization of the total profit whilst satisfying...
متن کاملA genetic algorithm approach for open-pit mine production scheduling
In an Open-Pit Production Scheduling (OPPS) problem, the goal is to determine the mining sequence of an orebody as a block model. In this article, linear programing formulation is used to aim this goal. OPPS problem is known as an NP-hard problem, so an exact mathematical model cannot be applied to solve in the real state. Genetic Algorithm (GA) is a well-known member of evolutionary algorithms...
متن کاملdetermination of the largest pit with the non-negative net profit in the open pit mines
the determination of the ultimate pit limit (upl) is the first step in the open pit mine planning process. in this stage that parts of the mineral deposit that are economic to mine are determined. there are several mathematical, heuristic and meta-heuristic algorithms to determine upl. the optimization criterion in these algorithms is maximization of the total profit whilst satisfying the...
متن کاملthe algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Open Civil Engineering Journal
سال: 2016
ISSN: 1874-1495
DOI: 10.2174/1874149501610010301