...
首页> 外文期刊>International Journal of Mineral Processing >Simultaneous optimization of the performance of flotation circuits and their simplification using the jumping gene adaptations of genetic algorithm
【24h】

Simultaneous optimization of the performance of flotation circuits and their simplification using the jumping gene adaptations of genetic algorithm

机译:使用遗传算法的跳跃基因自适应算法同时优化浮选回路的性能并简化浮选回路

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

The elitist non-dominated sorting genetic algorithm with the modified jumping gene operator (NSGA-II-mJG) is used to optimize the performance of froth flotation circuits. Four example optimization problems (Mehrotra and Kapur, 1974; Green, 1984; Dey et al., 1989) [Mehrotra, S. P., Kapur, P.C., 1974. Optimal-sub-optimal synthesis and design of flotation circuits. Sep. Sci. 9, 167-184; Green, J. C. A., 1984. The optimization of flotation networks. Int. J. Miner. Process. 13, 83-103; Dey, A. K., Kapur, PC, Mehrotra, S. P., 1989. A search strategy for optimization of flotation circuits. Int. J. Miner. Process. 26, 73-93.] of varying complexity are solved using single-objective functions. In one example, the overall recovery of the concentrate steam is maximized for a desired grade of the concentrate and a fixed total cell volume. The interconnecting cell linkage parameters (fraction flow rates) and the mean cell residence times are the decision variables. In all these cases, the optimal solutions obtained using NSGA-II-mJG are superior to those obtained by earlier techniques (which converged to local optimal solutions). Thereafter, a few two-objective optimization problems are solved. In these, the performance of the circuit is optimized, and simultaneously, the number of connecting streams is minimized so as to give simple circuits. Pareto optimal sets of equally good (non-dominating) solutions are obtained. This is probably the first study involving the multi-objective optimization of flotation circuits with one aim being to simplify them.
机译:利用改进的跳跃基因算子(NSGA-II-mJG)的精英非主导排序遗传算法来优化泡沫浮选回路的性能。四个示例性优化问题(Mehrotra和Kapur,1974; Green,1984; Dey等,1989)[Mehrotra,S.P.,Kapur,P.C.,1974。浮选回路的最佳次优合成和设计。 9月。 9、167-184; Green,J. C. A.,1984年。浮选网络的优化。诠释J.矿工。处理。 13、83-103; Dey,A. K.,Kapur,PC,Mehrotra,S。P.,1989年。一种优化浮选回路的搜索策略。诠释J.矿工。处理。 [26,73-93。]使用单目标函数解决了各种复杂性问题。在一个实例中,对于期望等级的浓缩物和固定的总室体积而言,浓缩物蒸汽的总回收率最大化。互连单元链接参数(馏分流速)和平均单元停留时间是决策变量。在所有这些情况下,使用NSGA-II-mJG获得的最优解均优于通过早期技术获得的最优解(收敛到局部最优解)。此后,解决了一些两目标优化问题。在这些电路中,电路的性能得以优化,同时,连接流的数量也得以最小化,从而提供了简单的电路。获得同等好(非支配)解决方案的帕累托最优集。这可能是第一项涉及浮选回路多目标优化的研究,目的是简化浮选回路。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号