Multi-Objective Optimization Algorithm for Grouping Decision Variables Based on Extreme Point Pareto Frontier

The existing algorithms for solving multi-objective optimization problems fall into three main categories:Decomposition-based,dominance-based,and indicator-based.Traditional multi-objective optimization problemsmainly focus on objectives,treating decision variables as a total variable to solve the problem without consideringthe critical role of decision variables in objective optimization.As seen,a variety of decision variable groupingalgorithms have been proposed.However,these algorithms are relatively broad for the changes of most decisionvariables in the evolution process and are time-consuming in the process of finding the Pareto frontier.To solvethese problems,a multi-objective optimization algorithm for grouping decision variables based on extreme pointPareto frontier(MOEA-DV/EPF)is proposed.This algorithm adopts a preprocessing rule to solve the Paretooptimal solution set of extreme points generated by simultaneous evolution in various target directions,obtainsthe basic Pareto front surface to determine the convergence effect,and analyzes the convergence and distributioneffects of decision variables.In the later stages of algorithm optimization,different mutation strategies are adoptedaccording to the nature of the decision variables to speed up the rate of evolution to obtain excellent individuals,thusenhancing the performance of the algorithm.Evaluation validation of the test functions shows that this algorithmcan solve the multi-objective optimization problem more efficiently.

Large-Scale Multi-Objective Optimization Algorithm Based on Weighted Overlapping Grouping of Decision Variables

The large-scale multi-objective optimization algorithm(LSMOA),based on the grouping of decision variables,is an advanced method for handling high-dimensional decision variables.However,in practical problems,the interaction among decision variables is intricate,leading to large group sizes and suboptimal optimization effects;hence a large-scale multi-objective optimization algorithm based on weighted overlapping grouping of decision variables(MOEAWOD)is proposed in this paper.Initially,the decision variables are perturbed and categorized into convergence and diversity variables;subsequently,the convergence variables are subdivided into groups based on the interactions among different decision variables.If the size of a group surpasses the set threshold,that group undergoes a process of weighting and overlapping grouping.Specifically,the interaction strength is evaluated based on the interaction frequency and number of objectives among various decision variables.The decision variable with the highest interaction in the group is identified and disregarded,and the remaining variables are then reclassified into subgroups.Finally,the decision variable with the strongest interaction is added to each subgroup.MOEAWOD minimizes the interactivity between different groups and maximizes the interactivity of decision variables within groups,which contributed to the optimized direction of convergence and diversity exploration with different groups.MOEAWOD was subjected to testing on 18 benchmark large-scale optimization problems,and the experimental results demonstrate the effectiveness of our methods.Compared with the other algorithms,our method is still at an advantage.

Multi-Objective Optimization of VBHF in Deep Drawing Based on the Improved QO-Jaya Algorithm

Blank holder force(BHF)is a crucial parameter in deep drawing,having close relation with the forming quality of sheet metal.However,there are different BHFs maintaining the best forming effect in different stages of deep drawing.The variable blank holder force(VBHF)varying with the drawing stage can overcome this problem at an extent.The optimization of VBHF is to determine the optimal BHF in every deep drawing stage.In this paper,a new heuristic optimization algorithm named Jaya is introduced to solve the optimization efficiently.An improved“Quasi-oppositional”strategy is added to Jaya algorithm for improving population diversity.Meanwhile,an innovated stop criterion is added for better convergence.Firstly,the quality evaluation criteria for wrinkling and tearing are built.Secondly,the Kriging models are developed to approximate and quantify the relation between VBHF and forming defects under random sampling.Finally,the optimization models are established and solved by the improved QO-Jaya algorithm.A VBHF optimization example of component with complicated shape and thin wall is studied to prove the effectiveness of the improved Jaya algorithm.The optimization results are compared with that obtained by other algorithms based on the TOPSIS method.

Optimal variable structure control with sliding modes for unstable processes

In this work,a variable structure control(VSC)technique is proposed to achieve satisfactory robustness for unstable processes.Optimal values of unknown parameters of VSC are obtained using Whale optimization algorithm which was recently reported in literature.Stability analysis has been done to verify the suitability of the proposed structure for industrial processes.The proposed control strategy is applied to three different types of unstable processes including non-minimum phase and nonlinear systems.A comparative study ensures that the proposed scheme gives superior performance over the recently reported VSC system.Furthermore,the proposed method gives satisfactory results for a cart inverted pendulum system in the presence of external disturbance and noise.

MODELING, VALIDATION AND OPTIMAL DESIGN OF THE CLAMPING FORCE CONTROL VALVE USED IN CONTINUOUSLY VARIABLE TRANSMISSION

Associated dynamic performance of the clamping force control valve used in continuously variable transmission （CVT） is optimized. Firstly, the structure and working principle of the valve are analyzed, and then a dynamic model is set up by means of mechanism analysis. For the purpose of checking the validity of the modeling method, a prototype workpiece of the valve is manufactured for comparison test, and its simulation result follows the experimental result quite well. An associated performance index is founded considering the response time, overshoot and saving energy, and five structural parameters are selected to adjust for deriving the optimal associated performance index. The optimization problem is solved by the genetic algorithm （GA） with necessary constraints. Finally, the properties of the optimized valve are compared with those of the prototype workpiece, and the results prove that the dynamic performance indexes of the optimized valve are much better than those of the prototype workpiece.

An improved multi-objective optimization algorithm for solving flexible job shop scheduling problem with variable batches

In order to solve the flexible job shop scheduling problem with variable batches,we propose an improved multiobjective optimization algorithm,which combines the idea of inverse scheduling.First,a flexible job shop problem with the variable batches scheduling model is formulated.Second,we propose a batch optimization algorithm with inverse scheduling in which the batch size is adjusted by the dynamic feedback batch adjusting method.Moreover,in order to increase the diversity of the population,two methods are developed.One is the threshold to control the neighborhood updating,and the other is the dynamic clustering algorithm to update the population.Finally,a group of experiments are carried out.The results show that the improved multi-objective optimization algorithm can ensure the diversity of Pareto solutions effectively,and has effective performance in solving the flexible job shop scheduling problem with variable batches.

Neural Network Predictive Control of Variable-pitch Wind Turbines Based on Small-world Optimization Algorithm

通过将混沌映射用于产生初始节点集和进行算子构造,提出一种新的基于实数编码的混沌小世界优化算法。采用4种算法对多例复杂函数的优化问题进行仿真试验,表明所提算法具有能够有效避免陷入局部极小值、快速搜索到最优值的能力。将上述方法应用于变桨距风电机组启动并网时的转速控制,提出一种基于混沌小世界优化算法的神经网络预测控制策略,其预测模型由基于现场数据的神经网络模型建立。仿真与实际测试结果表明,该系统可以根据风速扰动提前预测电机的转速变化,使控制器超前动作,保证系统输出跟踪参考轨迹的方向稳步改变,确保风电机组平稳并网。

STUDIFS ON OPTIMAL TOPOLOGY DES IGN OF STRUCTURES WITH DISCRETE VARIABLES

Some problems in the optimal topology design of structures with discrete variables are studied in this paper.The problem of a model of discrete optimization is discussed and a neglected fact that discrete optimum design may be controlled by the discreteness of sizing variables and global con- straints is pointed out.A heuristic algorithm for solving discrete topology optimization problems of trusses and frames is proposed.

A Variable Metric Algorithm with Broyden Rank One Modifications for Nonlinear Equality Constraints Optimization

In this paper, a variable metric algorithm is proposed with Broyden rank one modifications for the equality constrained optimization. This method is viewed expansion in constrained optimization as the quasi-Newton method to unconstrained optimization. The theoretical analysis shows that local convergence can be induced under some suitable conditions. In the end, it is established an equivalent condition of superlinear convergence.

Analysis and optimization of variable depth increments in sheet metal incremental forming

A method utilizing variable depth increments during incremental forming was proposed and then optimized based on numerical simulation and intelligent algorithm.Initially,a finite element method(FEM) model was set up and then experimentally verified.And the relation between depth increment and the minimum thickness tmin as well as its location was analyzed through the FEM model.Afterwards,the variation of depth increments was defined.The designed part was divided into three areas according to the main deformation mechanism,with Di(i=1,2) representing the two dividing locations.And three different values of depth increment,Δzi(i=1,2,3) were utilized for the three areas,respectively.Additionally,an orthogonal test was established to research the relation between the five process parameters(D and Δz) and tmin as well as its location.The result shows that Δz2 has the most significant influence on the thickness distribution for the corresponding area is the largest one.Finally,a single evaluating indicator,taking into account of both tmin and its location,was formatted with a linear weighted model.And the process parameters were optimized through a genetic algorithm integrated with an artificial neural network based on the evaluating index.The result shows that the proposed algorithm is satisfactory for the optimization of variable depth increment.

A NEW METHOD FOR STRUCTURAL TOPOLOGICAL OPTIMIZATION BASED ON THE CONCEPT OF INDEPENDENT CONTINUOUS VARIABLES AND SMOOTH MODEL

A concept of the independent-continuous topological variable is proposed to establish its corresponding smooth model of structural topological optimization. The method can overcome difficulties that are encountered in conventional models and algorithms for the optimization of the structural topology. Its application to truss topological optimization with stress and displacement constraints is satisfactory, with convergence faster than that of sectional optimizations.

Optimal thermal design of anisotropic plates with arbitrary cutouts using genetic algorithm

Anisotropic plates in different applications may have geometric defects such as openings and cracks.The presence of the opening disturbs the heat flow,which creates significant thermal stress around the opening.When the heat flux is high enough,these extreme stresses can lead to structural failure.This article aims to obtain the optimal parameters for achieving the minimum value of the normalized stress near the cutout’s boundary in perforated anisotropic plates utilizing the genetic algorithm.Optimization parameters include the curvature of opening’s corners,orientation angle of opening,fibers angle,heat flux angle,and opening’s elongation.The plate is under heat flux,and the opening’s border is thermally insulated.The stress distribution around the opening is calculated using Lekhnitskii’s complex variable method and complex potential functions.The genetic algorithm is then implemented to find the optimal values for design parameters.The results show that by selecting the optimal parameters related to the anisotropic material and the opening’s geometry,the stress intensity factor of the perforated anisotropic plates is remarkably reduced.Furthermore,this optimization algorithm can be extended to find the optimized parameters and achieve the optimal designs in anisotropic and isotropic perforated plates under thermal loadings.

Optimal variable step-size LMS model and algorithm with independence assumption

To solve the contradiction between convergence rate and steady-state error in least mean square (LMS) algorithm, basing on independence assumption, this paper proposes and proves the optimal step-size theorem from the view of minimizing mean squared error (MSE). The theorem reveals the one-to-one mapping between the optimal step-size and MSE. Following the theorem, optimal variable step-size LMS (OVS-LMS) model, describing the theoretical bound of the convergence rate of LMS algorithm, is constructed. Then we discuss the selection of initial optimal step-size and updating of optimal step-size at the time of unknown system changing. At last an optimal step-size LMS algorithm is proposed and tested in various environments. Simulation results show the proposed algorithm is very close to the theoretical bound.

OPTIMAL DESIGN OF DUAL STATOR-WINDING INDUCTION GENERATOR WITH PWM CONVERTER

To minimize the reactive power of the converter of the control winding in the novel dual stator-winding induction generator based on the PWM converter, design features of the induction generator with a rectified load are proposed. The optimization method of excited capacitors to minimize the reactive power of the control winding at a variable speed is given. The calculation capacity of the machine with a diode bridge rectifier load is proposed. To achieve global searching, the integrated method with the improved real-coded genetic algorithm and the twodimensional finite element method （FEM） is introduced. Design results of the sample show that reactive power can be reduced by the method, and the converter capacity can be decreased to 1/3 of output rated power at the speed ratio of 1 ： 3, thus reducing the volume and the mass of the inverter.

Effective Hybrid Teaching-learning-based Optimization Algorithm for Balancing Two-sided Assembly Lines with Multiple Constraints

Due to the NP-hardness of the two-sided assembly line balancing （TALB） problem, multiple constraints existing in real applications are less studied, especially when one task is involved with several constraints. In this paper, an effective hybrid algorithm is proposed to address the TALB problem with multiple constraints （TALB-MC）. Considering the discrete attribute of TALB-MC and the continuous attribute of the standard teaching-learning-based optimization （TLBO） algorithm, the random-keys method is hired in task permutation representation, for the purpose of bridging the gap between them. Subsequently, a special mechanism for handling multiple constraints is developed. In the mechanism, the directions constraint of each task is ensured by the direction check and adjustment. The zoning constraints and the synchronism constraints are satisfied by teasing out the hidden correlations among constraints. The positional constraint is allowed to be violated to some extent in decoding and punished in cost fimction. Finally, with the TLBO seeking for the global optimum, the variable neighborhood search （VNS） is further hybridized to extend the local search space. The experimental results show that the proposed hybrid algorithm outperforms the late acceptance hill-climbing algorithm （LAHC） for TALB-MC in most cases, especially for large-size problems with multiple constraints, and demonstrates well balance between the exploration and the exploitation. This research proposes an effective and efficient algorithm for solving TALB-MC problem by hybridizing the TLBO and VNS.

Algorithmic Optimization of BDDs and Performance Evaluation for Multi-level Logic Circuits with Area and Power Trade-offs

Binary Decision Diagrams (BDDs) can be graphically manipulated to reduce the number of nodes and hence the area. In this context, ordering of BDDs play a major role. Most of the algorithms for input variable ordering of OBDD focus primarily on area minimization. However, suitable input variable ordering helps in minimizing the power consumption also. In this particular work, we have proposed two algorithms namely, a genetic algorithm based technique and a branch and bound algorithm to find an optimal input variable order. Of course, the node reordering is taken care of by the standard BDD package buddy-2.4. Moreover, we have evaluated the performances of the proposed algorithms by running an exhaustive search program. Experi-mental results show a substantial saving in area and power. We have also compared our techniques with other state-of-art techniques of variable ordering for OBDDs and found to give superior results.

Research on a Distribution Center Location Model Based on a Particle Swarm Optimization Algorithm

Logistics is supposed to be the important source of profits for the enterprises besides reducing material consumption and improving labor productivity. Transportation costs, distribution center construction costs, ordering costs, safe inventory costs and inventory holding costs are the important parts of the total logistics costs. In this paper, based on the research results of LMRP（ location model of risk pooling） location with fixed construction cost, the LMRPVCC （ location model of risk pooling based on variable construction cost） will be introduced. Applying particle swarm optimization to several computational instances, the authors find the suboptimum solution of the model.

Symplectic multi-level method for solving nonlinear optimal control problem

By converting an optimal control problem for nonlinear systems to a Hamiltonian system,a symplecitc-preserving method is proposed.The state and costate variables are approximated by the Lagrange polynomial.The state variables at two ends of the time interval are taken as independent variables.Based on the dual variable principle,nonlinear optimal control problems are replaced with nonlinear equations.Furthermore,in the implementation of the symplectic algorithm,based on the 2N algorithm,a multilevel method is proposed.When the time grid is refined from low level to high level,the initial state and costate variables of the nonlinear equations can be obtained from the Lagrange interpolation at the low level grid to improve efficiency.Numerical simulations show the precision and the efficiency of the proposed algorithm in this paper.

Discrete Optimization on Unsteady Pressure Fluctuation of a Centrifugal Pump Using ANN and Modified GA

Pressure fluctuation due to rotor-stator interaction in turbomachinery is unavoidable,inducing strong vibration in the equipment and shortening its lifecycle.The investigation of optimization methods for an industrial centrifugal pump was carried out to reduce the intensity of pressure fluctuation to extend the lifecycle of these devices.Considering the time-consuming transient simulation of unsteady pressure,a novel optimization strategy was proposed by discretizing design variables and genetic algorithm.Four highly related design parameters were chosen,and 40 transient sample cases were generated and simulated using an automatic program.70%of them were used for training the surrogate model,and the others were for verifying the accuracy of the surrogate model.Furthermore,a modified discrete genetic algorithm(MDGA)was proposed to reduce the optimization cost owing to transient numerical simulation.For the benchmark test,the proposed MDGA showed a great advantage over the original genetic algorithm regarding searching speed and effectively dealt with the discrete variables by dramatically increasing the convergence rate.After optimization,the performance and stability of the inline pump were improved.The efficiency increased by more than 2.2%,and the pressure fluctuation intensity decreased by more than 20%under design condition.This research proposed an optimization method for reducing discrete transient characteristics in centrifugal pumps.

A Discrete Multi-Objective Squirrel Search Algorithm for Energy-Efficient Distributed Heterogeneous Permutation Flowshop with Variable Processing Speed

In the manufacturing industry,reasonable scheduling can greatly improve production efficiency,while excessive resource consumption highlights the growing significance of energy conservation in production.This paper studies the problem of energy-efficient distributed heterogeneous permutation flowshop problem with variable processing speed(DHPFSP-VPS),considering both the minimum makespan and total energy consumption(TEC)as objectives.A discrete multi-objective squirrel search algorithm(DMSSA)is proposed to solve the DHPFSPVPS.DMSSA makes four improvements based on the squirrel search algorithm.Firstly,in terms of the population initialization strategy,four hybrid initialization methods targeting different objectives are proposed to enhance the quality of initial solutions.Secondly,enhancements are made to the population hierarchy system and position updating methods of the squirrel search algorithm,making it more suitable for discrete scheduling problems.Additionally,regarding the search strategy,six local searches are designed based on problem characteristics to enhance search capability.Moreover,a dynamic predator strategy based on Q-learning is devised to effectively balance DMSSA’s capability for global exploration and local exploitation.Finally,two speed control energy-efficient strategies are designed to reduce TEC.Extensive comparative experiments are conducted in this paper to validate the effectiveness of the proposed strategies.The results of comparing DMSSA with other algorithms demonstrate its superior performance and its potential for efficient solving of the DHPFSP-VPS problem.