共查询到18条相似文献,搜索用时 46 毫秒
1.
地质处理是为露天煤矿研制的短期生产计划优化软件包的一部分。短期生产计划主要包括年、季、月和周计划,而编制最频繁的当属月和周计划。为适应这一要求,对地质数据和采场界线的处理,采用了灵活适用切合矿山生产实际的方法。 相似文献
2.
3.
4.
应用遗传算法优化露天矿设备 总被引:2,自引:0,他引:2
文章结合露天矿设备的型号和数量优化问题,阐述了遗传算法的原理和优化步骤,通过实例应用表明遗传算法能很好优化露天矿设备的型号和数量。 相似文献
5.
提出一种评价露天矿边坡稳定的新方法——概率法,并引入了变异系数的概念,通过与极限平衡法比较,证明失稳状态概率比安全系数更接近实际,适用于对露天矿边坡进行验证与设计。 相似文献
6.
7.
应用露天矿剥离工艺优化选择模型,优化准格尔矿区二期即将开发的哈尔乌素露天矿表土和岩石剥离工艺。通过研究认为哈尔乌素露天矿中部60m左右的岩石剥离最佳开采工艺是采用单斗一汽车-破碎机-胶带-排土机半连续系统,表土及上下部岩石的剥离宜采用单斗-汽车间断工艺系统。 相似文献
8.
在确定矿山生产规模时,由于受许多内外部因素的影响而变得很困难。除此还有一些人为因素的影响,如矿山规模往往多变,造成投资极大浪费。为合理确定矿山生产规模,作者建议从影响矿山规模的各种因素分析中寻求合理确定规模的步骤。 相似文献
9.
露天矿最终边坡角确定的神经网络方法 总被引:2,自引:0,他引:2
露天矿最终坡角确定的合理与否对整个矿山开采的经济效益有直接影响,但传统的确定方法存在一定的局限性,本文提出了露天矿最终边坡角确定的神经网络方法,经实例验证该方法是科学合理的。 相似文献
10.
11.
分析了露天矿数据仓库的应用现状,讨论了露天矿数据仓库的建设方式,并以露天矿卡车班产量和设备加油量这两个主题为例建立了相应的数据集市. 相似文献
12.
Data‐driven mathematical modeling and global optimization framework for entire petrochemical planning operations 下载免费PDF全文
Xin Xiao Christodoulos A. Floudas Baoguo Zhao Guangming Du Xin Su Hongwei Liu 《American Institute of Chemical Engineers》2016,62(9):3020-3040
In this work we develop a novel modeling and global optimization‐based planning formulation, which predicts product yields and properties for all of the production units within a highly integrated refinery‐petrochemical complex. Distillation is modeled using swing‐cut theory, while data‐based nonlinear models are developed for other processing units. The parameters of the postulated models are globally optimized based on a large data set of daily production. Property indices in blending units are linearly additive and they are calculated on a weight or volume basis. Binary variables are introduced to denote unit and operation modes selection. The planning model is a large‐scale non‐convex mixed integer nonlinear optimization model, which is solved to ε‐global optimality. Computational results for multiple case studies indicate that we achieve a significant profit increase (37–65%) using the proposed data‐driven global optimization framework. Finally, a user‐friendly interface is presented which enables automated updating of demand, specification, and cost parameters. © 2016 American Institute of Chemical Engineers AIChE J, 62: 3020–3040, 2016 相似文献
13.
With diversified requirements and varying manufacturing environments, the optimal production planning for a steelmill becomes more flexible and complicated. The flexibility provides operators with auxiliary requirements through an implementable integrated production planning. In this paper, a mixed-integer nonlinear programming (MINLP) model is proposed for the optimal planning that incorporates various manufacturing constraints and flexibility in a steel plate mill. Furthermore, two solution strategies are developed to overcome theweakness in solving the MINLP problem directly. The first one is to transformthe original MINLP formulation to an approximate mixed integer linear programming using a classic linearization method. The second one is to decompose the originalmodel using a branch-and-bound based iterative method. Computational experiments on various instances are presented in terms of the effectiveness and applicability. The result shows that the second method performs better in computational efforts and solution accuracy. 相似文献
14.
混凝沉淀法处理含铅矿坑涌水 总被引:1,自引:0,他引:1
实验采用常见的聚合氯化铝(PAC)、聚合硫酸铁(PFS)、聚丙烯酰胺(PAM)通过烧杯混凝实验进行除铅, 比较了3种絮凝剂对矿坑涌水中铅的去除效果;进而比较了3种絮凝剂分别组合之后对铅的去除效果, 筛选出既高效又经济的混凝剂组合, 并最终确定混凝剂组合为PFS和PAM。并且考察了投加顺序和pH值对组合混凝剂除铅效果的影响。结果表明:分别在最佳PAC、PFS投药条件下与PAM混用, 对含铅矿坑涌水的处理效果要比单独使用PAC、PFS任何一种絮凝剂效果好, PAM有利于提高PAC、PFS对铅的去除率。PFS与PAM组合除铅最佳工艺条件为:pH值为9.5, PFS投加量200mg/L, PAM投加量1mg/L, 投加顺序为快速搅拌时投加PFS, 慢速搅拌时投加PAM, 混凝反应时间14min, 静沉15min, 含铅矿坑涌水经该工艺处理后, 铅去除率可达99.05%, 出水铅浓度降至0.238mg/L, 达到国家污水综合排放标准(GB8978—1996)。 相似文献
15.
16.
We formulate the capacity expansion planning as a bilevel optimization to model the hierarchical decision structure involving industrial producers and consumers. The formulation is a mixed-integer bilevel linear program in which the upper level maximizes the profit of a producer and the lower level minimizes the cost paid by markets. The upper-level problem includes mixed-integer variables that establish the expansion plan; the lower level problem is an LP that decides demands assignments. We reformulate the bilevel optimization as a single-level problem using two different approaches: KKT reformulation and duality-based reformulation. We analyze the performance of these reformulations and compare their results with the expansion plans obtained from the traditional single-level formulation. For the solution of large-scale problems, we propose improvements on the duality-based reformulation that allows reducing the number of variables and constraints. The formulations and the solution methods are illustrated with examples from the air separation industry. 相似文献
17.
Braulio Brunaud José M. Laínez-Aguirre Jose M. Pinto Ignacio E. Grossmann 《American Institute of Chemical Engineers》2019,65(1):99-112
In this article, traditional supply chain planning models are extended to simultaneously optimize inventory policies. The inventory policies considered are the (r,Q) and (s,S) policies. In the (r,Q) inventory policy an order for Q units is placed every time the inventory level reaches level r, while in the s,S policy the inventory is reviewed in predefined intervals. If the inventory is found to be below level s, an order is placed to bring the level back to level S. Additionally, to address demand uncertainty four safety stock formulations are presented: (1) proportional to throughput, (2) proportional to throughput with risk-pooling effect, (3) explicit risk-pooling, and (4) guaranteed service time. The models proposed allow simultaneous optimization of safety stock, reserve, and base stock levels in tandem with material flows in supply chain planning. The formulations are evaluated using simulation. © 2018 American Institute of Chemical Engineers AIChE J, 65: 99–112, 2019 相似文献
18.
This article addresses a production planning optimization problem of overall refinery. The authors formulated the optimization problem as mixed integer linear programming. The model considers the main factors for optimizing the production plan of overall refinery related to the use of run-modes of processing units. The aim of this planning is to decide which run-mode to use in each processing unit in each period of a given horizon, to satisfy the demand, such as the total cost of production and inventory is minimized. The resulting model can be regarded as a generalized lot-sizing problem where a run-mode can produce and consume more than one product. The resulting optimization problem is large-sized and NP-hard. The authors have proposed a column generation-based algorithm called branch-and-price (BP) for solving the interested optimization problem. The model and implementation of the algorithm are described in detail in this article. The computational results verify the effectiveness of the proposed model and the solution method. 相似文献