A Hybrid Algorithm Based on Differential Evolution and Group Search Optimization and Its Application on Ethylene Cracking Furnace

To find the optimal operational condition when the properties of feedstock changes in the cracking furnace online,a hybrid algorithm named differential evolution group search optimization(DEGSO) is proposed,which is based on the differential evolution(DE) and the group search optimization(GSO).The DEGSO combines the advantages of the two algorithms:the high computing speed of DE and the good performance of the GSO for preventing the best particle from converging to local optimum.A cooperative method is also proposed for switching between these two algorithms.If the fitness value of one algorithm keeps invariant in several generations and less than the preset threshold,it is considered to fall into the local optimization and the other algorithm is chosen.Experiments on benchmark functions show that the hybrid algorithm outperforms GSO in accuracy,global searching ability and efficiency.The optimization of ethylene and propylene yields is illustrated as a case by DEGSO.After optimization,the yield of ethylene and propylene is increased remarkably,which provides the proper operational condition of the ethylene cracking furnace.

Soft Sensor for Ammonia Concentration at the Ammonia Converter Outlet Based on an Improved Group Search Optimization and BP Neural Network

The ammonia synthesis reactor is the core unit in the whole ammonia synthesis production. The ammonia concentration at the ammonia converter outlet is a significant process variable, which reflects directly the production efficiency. However, it is hard to be measured reliably online in real applications. In this paper, a soft sensor based on BP neural network (BPNN) is applied to estimate the ammonia concentration. A modified group search optimization with nearest neighborhood (GSO-NH) is proposed to optimize the weights and thresholds of BPNN. GSO-NH is integrated with BPNN to build a soft sensor model. Finally, the soft sensor model based on BPNN and GSO-NH (GSO-NH-NN) is used to infer the outlet ammonia concentration in a real-world application. Three other modeling methods are applied for comparison with GSO-NH-NN. The results show that the soft sensor based on GSO-NH-NN has a good prediction performance with high accuracy. Moreover, the GSO-NH-NN also provides good generalization ability to other modeling problems in ammonia synthesis production.

Optimizing combination of aircraft maintenance tasks by adaptive genetic algorithm based on cluster search

It is significant to combine multiple tasks into an optimal work package in decision-making of aircraft maintenance to reduce cost,so a cost rate model of combinatorial maintenance is an urgent need.However,the optimal combination under various constraints not only involves numerical calculations but also is an NP-hard combinatorial problem.To solve the problem,an adaptive genetic algorithm based on cluster search,which is divided into two phases,is put forward.In the first phase,according to the density,all individuals can be homogeneously scattered over the whole solution space through crossover and mutation and better individuals are collected as candidate cluster centres.In the second phase,the search is confined to the neighbourhood of some selected possible solutions to accurately solve with cluster radius decreasing slowly,meanwhile all clusters continuously move to better regions until all the peaks in the question space is searched.This algorithm can efficiently solve the combination problem.Taking the optimization on decision-making of aircraft maintenance by the algorithm for an example,maintenance which combines multiple parts or tasks can significantly enhance economic benefit when the halt cost is rather high.

An AW-HARIS Based Automated Segmentation of Human Liver Using CT Images

In the digestion of amino acids,carbohydrates,and lipids,as well as protein synthesis from the consumed food,the liver has many diverse responsibilities and functions that are to be performed.Liver disease may impact the hormonal and nutritional balance in the human body.The earlier diagnosis of such critical conditions may help to treat the patient effectively.A computationally efficient AW-HARIS algorithm is used in this paper to perform automated segmentation of CT scan images to identify abnormalities in the human liver.The proposed approach can recognize the abnormalities with better accuracy without training,unlike in supervisory procedures requiring considerable computational efforts for training.In the earlier stages,the CT images are pre-processed through an Adaptive Multiscale Data Condensation Kernel to normalize the underlying noise and enhance the image’s contrast for better segmentation.Then,the preliminary phase’s outcome is being fed as the input for the Anisotropic Weighted—Heuristic Algorithm for Real-time Image Segmentation algorithm that uses texture-related information,which has resulted in precise outcome with acceptable computational latency when compared to that of its counterparts.It is observed that the proposed approach has outperformed in the majority of the cases with an accuracy of 78%.The smart diagnosis approach would help the medical staff accurately predict the abnormality and disease progression in earlier ailment stages.

Algorithmic Design for the Examination Arrangement System on a Large Scale for Universities

It is a multifactor optimization problem to arrange examinations on a large scale for universities. In this paper, a kind of grouped optimization algorithm was proposed. A principle about related degree, which plays a core role in realization, was introduced in the algorithm. According to the algorithm, we worked out a set of software correspondingly and applied it to a certain university in Shanghai to arrange examinations. It shows that the algorithm is very effective.

Strategy of changing cracking furnace feedstock based on improved group search optimization

The scheduling process of cracking furnace feedstock is important in an ethylene plant. In this paper it is described as a constraint optimization problem. The constraints consist of the cycle of operation, maximum tube metal temperature, process time of each feedstock, and flow rate. A modified group search optimizer is proposed to deal with the optimization problem. Double fitness values are defined for every group. First, the factor of penalty function should be changed adaptively by the ratio of feasible and general solutions. Second, the "excellent" infeasible solution should be retained to guide the search. Some benchmark functions are used to evaluate the new algorithm. Finally, the proposed algorithm is used to optimize the scheduling process of cracking furnace feedstock. And the optimizing result is obtained.

Managing of Smart Micro-Grid Connected Scheme Using Group Search Optimization

This article introduces a group search optimization (GSO) based tuning model for modelling and managing Smart Micro-Grids connected system. In existing systems, typically tuned PID controllers are engaged to point out the load frequency control (LFC) problems through different tuning techniques. Though, inappropriately tuned PID controller may reveal pitiable dynamical reply and also incorrect option of integral gain may even undermine the complete system. This research is used to explain about an optimized energy management system through Group Search Optimization (GSO) for building incorporation in smart micro-grids (MGs) with zero grid-impact. The essential for this technique is to develop the MG effectiveness, when the complete PI controller requires to be tuned. Consequently, we proposed that the proposed GSO based algorithm with appropriate explanation or member representation, derivation of fitness function, producer process, scrounger process, and ranger process. An entire and adaptable design of MATLAB/SIMULINK also proposed. The related solutions and practical test verifications are given. This paper verified that the proposed method was effective in Micro-Grid (MG) applications. The comparison results demonstrate the advantage of the proposed technique and confirm its potential to solve the problem.

Optimal allocation of multi-type FACTS devices in power systems based on power flow entropy

Flexible AC transmission systems(FACTS)devices can effectively optimize the distribution of power flow.Power flow entropy can be applied as a measure of load distribution.In this paper,a method is proposed to optimize the distribution of power flow with the coordination of multi-type FACTS devices and establishes the corresponding mathematical models.The modified group searcher optimization(GSO)algorithm is proposed,in which the angle search is combined with chaotic search model to avoid jumping into local optimization.Compared with the different optimal allocation of multi-FACTS devices,the optimal allocation of multi-FACTS devices is achieved under the economic constraints.The locations obtained by this method can achieve the purpose of balancing power flow and enhancing the system performances.The simulations are demonstrated in an IEEE 118-bus power system with two classical types of FACTS,namely static var compensator(SVC)and thyristor controlled series Compensator(TCSC).The simulation results show that the proposed method is feasible and effective.

Optimal reactive power dispatch with wind power integrated using group search optimizer with intraspecific competition and le´vy walk

This paper presents the mean–variance(MV)model to solve power system reactive power dispatch problems with wind power integrated.The MV model considers the profit and risk simultaneously under the uncertain wind power(speed)environment.To describe this uncertain environment,the Latin hypercube sampling with Cholesky decomposition simulation method is used to sample uncertain wind speeds.An improved optimization algorithm,group search optimizer with intraspecific competition and le´vy walk,is then used to optimize the MV model by introducing the risk tolerance parameter.The simulation is conducted based on the IEEE 30-bus power system,and the results demonstrate the effectiveness and validity of the proposed model and the optimization algorithm.

Many-objective Optimization Method Based on Dimension Reduction for Operation of Large-scale Cooling Energy Systems

Large-scale cooling energy system has developed well in the past decade.However,its optimization is still a problem to be tackled due to the nonlinearity and large scale of existing systems.Reducing the scale of problems without oversimplifying the actual system model is a big challenge nowadays.This paper proposes a dimension reduction-based many-objective optimization(DRMO)method to solve an accurate nonlinear model of a practical large-scale cooling energy system.In the first stage,many-objective and many-variable of the large system are pre-processed to reduce the overall scale of the optimization problem.The relationships between many objectives are analyzed to find a few representative objectives.Key control variables are extracted to reduce the dimension of variables and the number of equality constraints.In the second stage,the manyobjective group search optimization(GSO)method is used to solve the low-dimensional nonlinear model,and a Pareto-front is obtained.In the final stage,candidate solutions along the Paretofront are graded on many-objective levels of system operators.The candidate solution with the highest average utility value is selected as the best running mode.Simulations are carried out on a 619-node-614-branch cooling system,and results show the ability of the proposed method in solving large-scale system operation problems.

Attitude maneuvers avoiding forbidden directions

Many space missions require the execution of large-angle attitude slews during which stringent pointing constraints must be satisfied.For example,the pointing direction of a space telescope must be kept away from directions to bright objects,maintaining a prescribed safety margin.In this paper we propose an open-loop attitude control algorithm which determines a rest-to-rest maneuver between prescribed attitudes while ensuring that any of an arbitrary number of body-fixed directions of light-sensitive instruments stays clear of any of an arbitrary number of space-fixed directions.The approach is based on an application of a version of Pontryagin’s Maximum Principle tailor-made for optimal control problems on Lie groups,and the pointing constraints are ensured by a judicious choice of the cost functional.The existence of up to three first integrals of the resulting system equations is established,depending on the number of light-sensitive and forbidden directions.These first integrals can be exploited in the numerical implementation of the attitude control algorithm,as is shown in the case of one light-sensitive and several forbidden directions.The results of the test cases presented confirm the applicability of the proposed algorithm.

A practical interconnection network RP(k) and its routing algorithms

Based on Petersen graph, a new interconnection network, the RP(k) network, is devel-oped and the properties of the RP(k) network are investigated. The diameter of the RP(k) network is [ k/2] + 2 and its degree is 5. We prove that the diameter of the RP(k) network is much smaller than that of the 2-D Torus network when the number of nodes in interconnection networks is less than or equal to 300. In order to analyze the communication performance in a group of nodes, we propose the concepts of the optimal node groups and the diameter of the optimal node groups. We also show that the diameter of the optimal node groups in the RP(k) network is less than that in the 2-D Torus net-work. Especially when the number of nodes in an optimal node group is between 6 and 100, the diam-eter of the optimal node groups in the RP(k) network is half of that in the 2-D Torus network. Further-more based on the RP(k) network we design a set of routing algorithms which are point-to-point rout-ing, permutation routing, one-to-all routing and all-to-all routing. Their communication efficiencies are [ k/2] +2, k + 5, [k/2] + 2, and k + 5 respectively. The RP(k) network and the routing algorithms can provide efficient communication means for parallel and distributed computer system.

Simplified Group Search Optimizer Algorithm for Large Scale Global Optimization

A simplified group search optimizer algorithm denoted as"SGSO"for large scale global optimization is presented in this paper to obtain a simple algorithm with superior performance on high-dimensional problems.The SGSO adopts an improved sharing strategy which shares information of not only the best member but also the other good members,and uses a simpler search method instead of searching by the head angle.Furthermore,the SGSO increases the percentage of scroungers to accelerate convergence speed.Compared with genetic algorithm(GA),particle swarm optimizer(PSO)and group search optimizer(GSO),SGSO is tested on seven benchmark functions with dimensions 30,100,500 and 1 000.It can be concluded that the SGSO has a remarkably superior performance to GA,PSO and GSO for large scale global optimization.