Optimizing chemical reaction parameters is an expensive optimization problem. Each experiment takes a long time and the raw materials are expensive. High-throughput methods combined with the parallel Efficient Global ...Optimizing chemical reaction parameters is an expensive optimization problem. Each experiment takes a long time and the raw materials are expensive. High-throughput methods combined with the parallel Efficient Global Optimization algorithm can effectively improve the efficiency of the search for optimal chemical reaction parameters. In this paper, we propose a multi-objective populated expectation improvement criterion for providing multiple near-optimal solutions in high-throughput chemical reaction optimization. An l-NSGA2, employing the Pseudo-power transformation method, is utilized to maximize the expected improvement acquisition function, resulting in a Pareto solution set comprising multiple designs. The approximation of the cost function can be calculated by the ensemble Gaussian process model, which greatly reduces the cost of the exact Gaussian process model. The proposed optimization method was tested on a SNAr benchmark problem. The results show that compared with the previous high-throughput experimental methods, our method can reduce the number of experiments by almost half. At the same time, it theoretically enhances temporal and spatial yields while minimizing by-product formation, potentially guiding real chemical reaction optimization.展开更多
This work investigates a multi-product parallel disassembly line balancing problem considering multi-skilled workers.A mathematical model for the parallel disassembly line is established to achieve maximized disassemb...This work investigates a multi-product parallel disassembly line balancing problem considering multi-skilled workers.A mathematical model for the parallel disassembly line is established to achieve maximized disassembly profit and minimized workstation cycle time.Based on a product’s AND/OR graph,matrices for task-skill,worker-skill,precedence relationships,and disassembly correlations are developed.A multi-objective discrete chemical reaction optimization algorithm is designed.To enhance solution diversity,improvements are made to four reactions:decomposition,synthesis,intermolecular ineffective collision,and wall invalid collision reaction,completing the evolution of molecular individuals.The established model and improved algorithm are applied to ball pen,flashlight,washing machine,and radio combinations,respectively.Introducing a Collaborative Resource Allocation(CRA)strategy based on a Decomposition-Based Multi-Objective Evolutionary Algorithm,the experimental results are compared with four classical algorithms:MOEA/D,MOEAD-CRA,Non-dominated Sorting Genetic Algorithm Ⅱ(NSGA-Ⅱ),and Non-dominated Sorting Genetic Algorithm Ⅲ(NSGA-Ⅲ).This validates the feasibility and superiority of the proposed algorithm in parallel disassembly production lines.展开更多
Extreme learning machine(ELM)allows for fast learning and better generalization performance than conventional gradient-based learning.However,the possible inclusion of non-optimal weight and bias due to random selecti...Extreme learning machine(ELM)allows for fast learning and better generalization performance than conventional gradient-based learning.However,the possible inclusion of non-optimal weight and bias due to random selection and the need for more hidden neurons adversely influence network usability.Further,choosing the optimal number of hidden nodes for a network usually requires intensive human intervention,which may lead to an ill-conditioned situation.In this context,chemical reaction optimization(CRO)is a meta-heuristic paradigm with increased success in a large number of application areas.It is characterized by faster convergence capability and requires fewer tunable parameters.This study develops a learning framework combining the advantages of ELM and CRO,called extreme learning with chemical reaction optimization(ELCRO).ELCRO simultaneously optimizes the weight and bias vector and number of hidden neurons of a single layer feed-forward neural network without compromising prediction accuracy.We evaluate its performance by predicting the daily volatility and closing prices of BSE indices.Additionally,its performance is compared with three other similarly developed models—ELM based on particle swarm optimization,genetic algorithm,and gradient descent—and find the performance of the proposed algorithm superior.Wilcoxon signed-rank and Diebold–Mariano tests are then conducted to verify the statistical significance of the proposed model.Hence,this model can be used as a promising tool for financial forecasting.展开更多
Economic globalization has transformed many manufacturing enterprises from a single-plant production mode to a multi-plant cooperative production mode.The distributed flexible job-shop scheduling problem(DFJSP)has bec...Economic globalization has transformed many manufacturing enterprises from a single-plant production mode to a multi-plant cooperative production mode.The distributed flexible job-shop scheduling problem(DFJSP)has become a research hot topic in the field of scheduling because its production is closer to reality.The research of DFJSP is of great significance to the organization and management of actual production process.To solve the heterogeneous DFJSP with minimal completion time,a hybrid chemical reaction optimization(HCRO)algorithm is proposed in this paper.Firstly,a novel encoding-decoding method for flexible manufacturing unit(FMU)is designed.Secondly,half of initial populations are generated by scheduling rule.Combined with the new solution acceptance method of simulated annealing(SA)algorithm,an improved method of critical-FMU is designed to improve the global and local search ability of the algorithm.Finally,the elitist selection strategy and the orthogonal experimental method are introduced to the algorithm to improve the convergence speed and optimize the algorithm parameters.In the experimental part,the effectiveness of the simulated annealing algorithm and the critical-FMU refinement methods is firstly verified.Secondly,in the comparison with other existing algorithms,the proposed optimal scheduling algorithm is not only effective in homogeneous FMUs examples,but also superior to existing algorithms in heterogeneous FMUs arithmetic cases.展开更多
基金the Nature Foundation(Basic Research)Special Project of Shenyang(22-315-6-20)Liaoning Province Artificial Intelligence Innovation and Development Program Project(2023JH26/10300014)Basic Research Program of Shenyang Institute of Automation,Chinese Academy of Sciences(2023JC2K03).
文摘Optimizing chemical reaction parameters is an expensive optimization problem. Each experiment takes a long time and the raw materials are expensive. High-throughput methods combined with the parallel Efficient Global Optimization algorithm can effectively improve the efficiency of the search for optimal chemical reaction parameters. In this paper, we propose a multi-objective populated expectation improvement criterion for providing multiple near-optimal solutions in high-throughput chemical reaction optimization. An l-NSGA2, employing the Pseudo-power transformation method, is utilized to maximize the expected improvement acquisition function, resulting in a Pareto solution set comprising multiple designs. The approximation of the cost function can be calculated by the ensemble Gaussian process model, which greatly reduces the cost of the exact Gaussian process model. The proposed optimization method was tested on a SNAr benchmark problem. The results show that compared with the previous high-throughput experimental methods, our method can reduce the number of experiments by almost half. At the same time, it theoretically enhances temporal and spatial yields while minimizing by-product formation, potentially guiding real chemical reaction optimization.
文摘This work investigates a multi-product parallel disassembly line balancing problem considering multi-skilled workers.A mathematical model for the parallel disassembly line is established to achieve maximized disassembly profit and minimized workstation cycle time.Based on a product’s AND/OR graph,matrices for task-skill,worker-skill,precedence relationships,and disassembly correlations are developed.A multi-objective discrete chemical reaction optimization algorithm is designed.To enhance solution diversity,improvements are made to four reactions:decomposition,synthesis,intermolecular ineffective collision,and wall invalid collision reaction,completing the evolution of molecular individuals.The established model and improved algorithm are applied to ball pen,flashlight,washing machine,and radio combinations,respectively.Introducing a Collaborative Resource Allocation(CRA)strategy based on a Decomposition-Based Multi-Objective Evolutionary Algorithm,the experimental results are compared with four classical algorithms:MOEA/D,MOEAD-CRA,Non-dominated Sorting Genetic Algorithm Ⅱ(NSGA-Ⅱ),and Non-dominated Sorting Genetic Algorithm Ⅲ(NSGA-Ⅲ).This validates the feasibility and superiority of the proposed algorithm in parallel disassembly production lines.
文摘Extreme learning machine(ELM)allows for fast learning and better generalization performance than conventional gradient-based learning.However,the possible inclusion of non-optimal weight and bias due to random selection and the need for more hidden neurons adversely influence network usability.Further,choosing the optimal number of hidden nodes for a network usually requires intensive human intervention,which may lead to an ill-conditioned situation.In this context,chemical reaction optimization(CRO)is a meta-heuristic paradigm with increased success in a large number of application areas.It is characterized by faster convergence capability and requires fewer tunable parameters.This study develops a learning framework combining the advantages of ELM and CRO,called extreme learning with chemical reaction optimization(ELCRO).ELCRO simultaneously optimizes the weight and bias vector and number of hidden neurons of a single layer feed-forward neural network without compromising prediction accuracy.We evaluate its performance by predicting the daily volatility and closing prices of BSE indices.Additionally,its performance is compared with three other similarly developed models—ELM based on particle swarm optimization,genetic algorithm,and gradient descent—and find the performance of the proposed algorithm superior.Wilcoxon signed-rank and Diebold–Mariano tests are then conducted to verify the statistical significance of the proposed model.Hence,this model can be used as a promising tool for financial forecasting.
基金This work was supported by the National Natural Science Foundation of China(Nos.61973120,62076095,61673175,and 61573144).
文摘Economic globalization has transformed many manufacturing enterprises from a single-plant production mode to a multi-plant cooperative production mode.The distributed flexible job-shop scheduling problem(DFJSP)has become a research hot topic in the field of scheduling because its production is closer to reality.The research of DFJSP is of great significance to the organization and management of actual production process.To solve the heterogeneous DFJSP with minimal completion time,a hybrid chemical reaction optimization(HCRO)algorithm is proposed in this paper.Firstly,a novel encoding-decoding method for flexible manufacturing unit(FMU)is designed.Secondly,half of initial populations are generated by scheduling rule.Combined with the new solution acceptance method of simulated annealing(SA)algorithm,an improved method of critical-FMU is designed to improve the global and local search ability of the algorithm.Finally,the elitist selection strategy and the orthogonal experimental method are introduced to the algorithm to improve the convergence speed and optimize the algorithm parameters.In the experimental part,the effectiveness of the simulated annealing algorithm and the critical-FMU refinement methods is firstly verified.Secondly,in the comparison with other existing algorithms,the proposed optimal scheduling algorithm is not only effective in homogeneous FMUs examples,but also superior to existing algorithms in heterogeneous FMUs arithmetic cases.
