One of the surface mining methods is open-pit mining,by which a pit is dug to extract ore or waste downwards from the earth’s surface.In the mining industry,one of the most significant difficulties is long-term produ...One of the surface mining methods is open-pit mining,by which a pit is dug to extract ore or waste downwards from the earth’s surface.In the mining industry,one of the most significant difficulties is long-term production scheduling(LTPS)of the open-pit mines.Deterministic and uncertainty-based approaches are identified as the main strategies,which have been widely used to cope with this problem.Within the last few years,many researchers have highly considered a new computational type,which is less costly,i.e.,meta-heuristic methods,so as to solve the mine design and production scheduling problem.Although the optimality of the final solution cannot be guaranteed,they are able to produce sufficiently good solutions with relatively less computational costs.In the present paper,two hybrid models between augmented Lagrangian relaxation(ALR)and a particle swarm optimization(PSO)and ALR and bat algorithm(BA)are suggested so that the LTPS problem is solved under the condition of grade uncertainty.It is suggested to carry out the ALR method on the LTPS problem to improve its performance and accelerate the convergence.Moreover,the Lagrangian coefficients are updated by using PSO and BA.The presented models have been compared with the outcomes of the ALR-genetic algorithm,the ALR-traditional sub-gradient method,and the conventional method without using the Lagrangian approach.The results indicated that the ALR is considered a more efficient approach which can solve a large-scale problem and make a valid solution.Hence,it is more effectual than the conventional method.Furthermore,the time and cost of computation are diminished by the proposed hybrid strategies.The CPU time using the ALR-BA method is about 7.4%higher than the ALR-PSO approach.展开更多
In order to solve the constraint satisfied problem in the genetic algorithm, the partheno-genetic algorithm is designed. And then the schema theorem of the partheno-genetic algorithm is proposed to show that the high ...In order to solve the constraint satisfied problem in the genetic algorithm, the partheno-genetic algorithm is designed. And then the schema theorem of the partheno-genetic algorithm is proposed to show that the high rank schemas at the subsequent generation decrease exponentially even though its fitness is more optimal than the average one in the population and the low rank schemas at the subsequent generation increase exponentially when its fitness is more optimal than the average one in the population. In order to overcome the shortcoming that the optimal high rank schema can be deserted arbitrarily, the HGA (hybrid partheno-genetic algorithm) is proposed, that is, the hill-climbing algorithm is integrated to search for a better individual. Finally, the results of the simulation for facility layout problem and no-wait schedule problem are given. It is shown that the hybrid partheno- genetic algorithm is of high efficiency.展开更多
针对浮选过程变量滞后、耦合特征及建模样本数量少所导致精矿品位难以准确预测的问题,提出了一种基于改进麻雀搜索算法(Improved Sparrow Search Algorithm,ISSA)优化混核最小二乘支持向量机(Hybrid Kernel Least Squares Support Vecto...针对浮选过程变量滞后、耦合特征及建模样本数量少所导致精矿品位难以准确预测的问题,提出了一种基于改进麻雀搜索算法(Improved Sparrow Search Algorithm,ISSA)优化混核最小二乘支持向量机(Hybrid Kernel Least Squares Support Vector Machine,HKLSSVM)的浮选过程精矿品位预测方法.首先采集浮选现场载流X荧光品位分析仪数据作为建模变量并进行预处理,建立基于最小二乘支持向量机(Least Squares Support Vector Machine,LSSVM)的预测模型,以此构建新型混合核函数,将输入空间映射至高维特征空间,再引入改进麻雀搜索算法对模型参数进行优化,提出基于ISSA-HKLSSVM方法实现精矿品位预测,最后开发基于LabVIEW的浮选精矿品位预测系统对本文提出方法实际验证.实验结果表明,本文提出方法对于浮选过程小样本建模具有良好拟合能力,相比现有方法提高了预测准确率,可实现精矿品位的准确在线预测,为浮选过程的智能调控提供实时可靠的精矿品位反馈信息.展开更多
文摘One of the surface mining methods is open-pit mining,by which a pit is dug to extract ore or waste downwards from the earth’s surface.In the mining industry,one of the most significant difficulties is long-term production scheduling(LTPS)of the open-pit mines.Deterministic and uncertainty-based approaches are identified as the main strategies,which have been widely used to cope with this problem.Within the last few years,many researchers have highly considered a new computational type,which is less costly,i.e.,meta-heuristic methods,so as to solve the mine design and production scheduling problem.Although the optimality of the final solution cannot be guaranteed,they are able to produce sufficiently good solutions with relatively less computational costs.In the present paper,two hybrid models between augmented Lagrangian relaxation(ALR)and a particle swarm optimization(PSO)and ALR and bat algorithm(BA)are suggested so that the LTPS problem is solved under the condition of grade uncertainty.It is suggested to carry out the ALR method on the LTPS problem to improve its performance and accelerate the convergence.Moreover,the Lagrangian coefficients are updated by using PSO and BA.The presented models have been compared with the outcomes of the ALR-genetic algorithm,the ALR-traditional sub-gradient method,and the conventional method without using the Lagrangian approach.The results indicated that the ALR is considered a more efficient approach which can solve a large-scale problem and make a valid solution.Hence,it is more effectual than the conventional method.Furthermore,the time and cost of computation are diminished by the proposed hybrid strategies.The CPU time using the ALR-BA method is about 7.4%higher than the ALR-PSO approach.
文摘In order to solve the constraint satisfied problem in the genetic algorithm, the partheno-genetic algorithm is designed. And then the schema theorem of the partheno-genetic algorithm is proposed to show that the high rank schemas at the subsequent generation decrease exponentially even though its fitness is more optimal than the average one in the population and the low rank schemas at the subsequent generation increase exponentially when its fitness is more optimal than the average one in the population. In order to overcome the shortcoming that the optimal high rank schema can be deserted arbitrarily, the HGA (hybrid partheno-genetic algorithm) is proposed, that is, the hill-climbing algorithm is integrated to search for a better individual. Finally, the results of the simulation for facility layout problem and no-wait schedule problem are given. It is shown that the hybrid partheno- genetic algorithm is of high efficiency.
文摘针对浮选过程变量滞后、耦合特征及建模样本数量少所导致精矿品位难以准确预测的问题,提出了一种基于改进麻雀搜索算法(Improved Sparrow Search Algorithm,ISSA)优化混核最小二乘支持向量机(Hybrid Kernel Least Squares Support Vector Machine,HKLSSVM)的浮选过程精矿品位预测方法.首先采集浮选现场载流X荧光品位分析仪数据作为建模变量并进行预处理,建立基于最小二乘支持向量机(Least Squares Support Vector Machine,LSSVM)的预测模型,以此构建新型混合核函数,将输入空间映射至高维特征空间,再引入改进麻雀搜索算法对模型参数进行优化,提出基于ISSA-HKLSSVM方法实现精矿品位预测,最后开发基于LabVIEW的浮选精矿品位预测系统对本文提出方法实际验证.实验结果表明,本文提出方法对于浮选过程小样本建模具有良好拟合能力,相比现有方法提高了预测准确率,可实现精矿品位的准确在线预测,为浮选过程的智能调控提供实时可靠的精矿品位反馈信息.
