Modified Augmented Lagrange Multiplier Methods for Large-Scale Chemical Process Optimization

Chemical process optimization can be described as large-scale nonlinear constrained minimization. The modified augmented Lagrange multiplier methods (MALMM) for large-scale nonlinear constrained minimization are studied in this paper. The Lagrange function contains the penalty terms on equality and inequality constraints and the methods can be applied to solve a series of bound constrained sub-problems instead of a series of unconstrained sub-problems. The steps of the methods are examined in full detail. Numerical experiments are made for a variety of problems, from small to very large-scale, which show the stability and effectiveness of the methods in large-scale problems.

Extreme learning with chemical reaction optimization for stock volatility prediction

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.

A chemical-reaction-optimization-based neuro-fuzzy hybrid network for stock closing price prediction

Accurate prediction of stock market behavior is a challenging issue for financial forecasting.Artificial neural networks,such as multilayer perceptron have been established as better approximation and classification models for this domain.This study proposes a chemical reaction optimization(CRO)based neuro-fuzzy network model for prediction of stock indices.The input vectors to the model are fuzzified by applying a Gaussian membership function,and each input is associated with a degree of membership to different classes.A multilayer perceptron with one hidden layer is used as the base model and CRO is used to the optimal weights and biases of this model.CRO was chosen because it requires fewer control parameters and has a faster convergence rate.Five statistical parameters are used to evaluate the performance of the model,and the model is validated by forecasting the daily closing indices for five major stock markets.The performance of the proposed model is compared with four state-of-art models that are trained similarly and was found to be superior.We conducted the Deibold-Mariano test to check the statistical significance of the proposed model,and it was found to be significant.This model can be used as a promising tool for financial forecasting.

Multi-Objective Optimization of Multi-Product Parallel Disassembly Line Balancing Problem Considering Multi-Skilled Workers Using a Discrete Chemical Reaction Optimization Algorithm

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.

Simultaneous optimization of transit network and public bicycle station network

The traditional manner to design public transportation system is to sequentially design the transit network and public bicycle network. A new public transportation system design problem that simultaneously considers both bus network design and public bicycle network design is proposed. The chemical reaction optimization(CRO) is designed to solve the problem. A shortcoming of CRO is that, when the two-molecule collisions take place, the molecules are randomly picked from the container.Hence, we improve CRO by employing different mating strategies. The computational results confirm the benefits of the mating strategies. Numerical experiments are conducted on the Sioux-Falls network. A comparison with the traditional sequential modeling framework indicates that the proposed approach has a better performance and is more robust. The practical applicability of the approach is proved by employing a real size network.

A Hybrid Algorithm Based on Binary Chemical Reaction Optimization and Tabu Search for Feature Selection of High-Dimensional Biomedical Data

In recent years, there have been rapid developments in various bioinformatics technologies, which have led to the accumulation of a large amount of biomedical data. The biomedical data can be analyzed to enhance assessment of at-risk patients and improve disease diagnosis, treatment, and prevention. However, these datasets usually have many features, which contain many irrelevant or redundant information. Feature selection is a solution that involves finding the optimal subset, which is known to be an NP problem because of the large search space. Considering this, a new feature selection approach based on Binary Chemical Reaction Optimization algorithm （BCRO） and k-Nearest Neighbors （KNN） classifier is presented in this paper. Tabu search is integrated with CRO framework to enhance local search capacity. KNN is adopted to evaluate the quality of selected candidate subset. The results for an experiment conducted on nine standard medical datasets demonstrate that the proposed approach outperforms other state-of-the-art methods.

Distributed Flexible Job-Shop Scheduling Problem Based on Hybrid Chemical Reaction Optimization Algorithm

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.

On the Regression-Tensor Analysis of the Hardening Process of Metal Coatings

This paper constructs and studies a nonlinear multivariate regression-tensor model for substantiation of necessary/sufficient conditions of optimization of technological calculation of multifactor physical and chemical process of hardening of complex composite media for metal coatings. An adaptive a posteriori procedure for parametric formation of the target quality functional of integrative physical and mechanical properties of the designed metal coating has been proposed. The results of the research may serve as elements of a mathematical language when creating automated design of precision nanotechnologies for surface hardening of complex composite metal coatings on the basis of complex tribological and anticorrosive tests.