ScholarGate
دستیار

مقایسهٔ روش‌ها

روش‌های انتخابی خود را کنار هم مرور کنید؛ ردیف‌های متفاوت برجسته شده‌اند.

مدل حد آستانه برش لین×شاخص کار باند (Bond Work Index)×الگوریتم شبه‌جریان (Pseudoflow Algorithm)×
حوزهمهندسی معدنمهندسی معدنمهندسی معدن
خانوادهProcess / pipelineProcess / pipelineProcess / pipeline
سال پیدایش198819521992
پدیدآورK. F. LaneFred C. BondDorit S. Hochbaum
نوعEconomic optimization framework for ore classificationEmpirical method for grinding energy estimationEfficient algorithm for maximum closure problem
منبع بنیادینLane, K. F. (1988). The economic definition of ore: cutoff grades in theory and practice. Mining Journal Books, London. link ↗Bond, F. C. (1952). The third theory of comminution. Transactions of the American Institute of Mining and Metallurgical Engineers, 193, 484-494. link ↗Hochbaum, D. S. (1992). A new-old algorithm for minimum-cut and maximum-flow problems. Journal of the ACM, 1(1), 76-109. link ↗
نام‌های دیگرLane Model, Cut-off Grade Optimization, Lane's Optimization ModelBond Work Index, BWI, Bond Index TestPseudoflow Algorithm, Hochbaum Algorithm
مرتبط333
خلاصهLane's Cut-off Grade Model, developed by Kenneth F. Lane and formalized in his 1988 book, provides a rigorous economic framework for determining the minimum grade at which ore should be mined and processed. It accounts for variable mining costs, metallurgical recovery, and commodity prices to optimize profit per unit processed. The model is foundational in mining economics and underpins daily operational decisions at thousands of mines worldwide.The Bond Work Index, introduced by Fred C. Bond in 1952, is an empirical parameter that characterizes the resistance of an ore to grinding in a tumbling mill. It is defined as the kilowatt-hours per short ton (kWh/st) of electrical energy required to reduce a coarse ore from theoretically infinite size to 80% passing 100 micrometers. The Bond Index is foundational in mineral processing plant design and cost estimation worldwide.The Pseudoflow Algorithm, developed by Dorit Hochbaum in 1992, is a polynomial-time algorithm for computing maximum weighted closures in directed acyclic graphs. In mining, it solves the ultimate pit limit problem more efficiently than earlier methods. By maintaining feasible pseudoflows and iteratively eliminating negative-cost nodes, it achieves near-optimal practical performance even on industrial-scale block models.
ScholarGateمجموعه‌داده
  1. v1
  2. 2 منابع
  3. PUBLISHED
  1. v1
  2. 2 منابع
  3. PUBLISHED
  1. v1
  2. 2 منابع
  3. PUBLISHED

رفتن به جست‌وجو دریافت اسلایدها

ScholarGateمقایسهٔ روش‌ها: Cut-off Grade (Lane) · Bond Work Index · Pseudoflow. بازیابی‌شده در 2026-06-18 از https://scholargate.app/fa/compare