Energy-Saving Distributed Flexible Job Shop Scheduling Optimization with Dual Resource Constraints Based on Integrated Q-Learning Multi-Objective Grey Wolf Optimizer

The distributed flexible job shop scheduling problem(DFJSP)has attracted great attention with the growth of the global manufacturing industry.General DFJSP research only considers machine constraints and ignores worker constraints.As one critical factor of production,effective utilization of worker resources can increase productivity.Meanwhile,energy consumption is a growing concern due to the increasingly serious environmental issues.Therefore,the distributed flexible job shop scheduling problem with dual resource constraints(DFJSP-DRC)for minimizing makespan and total energy consumption is studied in this paper.To solve the problem,we present a multi-objective mathematical model for DFJSP-DRC and propose a Q-learning-based multi-objective grey wolf optimizer(Q-MOGWO).In Q-MOGWO,high-quality initial solutions are generated by a hybrid initialization strategy,and an improved active decoding strategy is designed to obtain the scheduling schemes.To further enhance the local search capability and expand the solution space,two wolf predation strategies and three critical factory neighborhood structures based on Q-learning are proposed.These strategies and structures enable Q-MOGWO to explore the solution space more efficiently and thus find better Pareto solutions.The effectiveness of Q-MOGWO in addressing DFJSP-DRC is verified through comparison with four algorithms using 45 instances.The results reveal that Q-MOGWO outperforms comparison algorithms in terms of solution quality.

Probabilistic-Ellipsoid Hybrid Reliability Multi-Material Topology Optimization Method Based on Stress Constraint

This paper proposes a multi-material topology optimization method based on the hybrid reliability of the probability-ellipsoid model with stress constraint for the stochastic uncertainty and epistemic uncertainty of mechanical loads in optimization design.The probabilistic model is combined with the ellipsoidal model to describe the uncertainty of mechanical loads.The topology optimization formula is combined with the ordered solid isotropic material with penalization(ordered-SIMP)multi-material interpolation model.The stresses of all elements are integrated into a global stress measurement that approximates the maximum stress using the normalized p-norm function.Furthermore,the sequential optimization and reliability assessment(SORA)is applied to transform the original uncertainty optimization problem into an equivalent deterministic topology optimization(DTO)problem.Stochastic response surface and sparse grid technique are combined with SORA to get accurate information on the most probable failure point(MPP).In each cycle,the equivalent topology optimization formula is updated according to the MPP information obtained in the previous cycle.The adjoint variable method is used for deriving the sensitivity of the stress constraint and the moving asymptote method(MMA)is used to update design variables.Finally,the validity and feasibility of the method are verified by the numerical example of L-shape beam design,T-shape structure design,steering knuckle,and 3D T-shaped beam.

UAVs cooperative task assignment and trajectory optimization with safety and time constraints

This paper proposes new methods and strategies for Multi-UAVs cooperative attacks with safety and time constraints in a complex environment.Delaunay triangle is designed to construct a map of the complex flight environment for aerial vehicles.Delaunay-Map,Safe Flight Corridor(SFC),and Relative Safe Flight Corridor(RSFC)are applied to ensure each UAV flight trajectory's safety.By using such techniques,it is possible to avoid the collision with obstacles and collision between UAVs.Bezier-curve is further developed to ensure that multi-UAVs can simultaneously reach the target at the specified time,and the trajectory is within the flight corridor.The trajectory tracking controller is also designed based on model predictive control to track the planned trajectory accurately.The simulation and experiment results are presented to verifying developed strategies of Multi-UAV cooperative attacks.

Shape and Size Optimization of Truss Structures under Frequency Constraints Based on Hybrid Sine Cosine Firefly Algorithm

Shape and size optimization with frequency constraints is a highly nonlinear problem withmixed design variables,non-convex search space,and multiple local optima.Therefore,a hybrid sine cosine firefly algorithm(HSCFA)is proposed to acquire more accurate solutions with less finite element analysis.The full attraction model of firefly algorithm(FA)is analyzed,and the factors that affect its computational efficiency and accuracy are revealed.A modified FA with simplified attraction model and adaptive parameter of sine cosine algorithm(SCA)is proposed to reduce the computational complexity and enhance the convergence rate.Then,the population is classified,and different populations are updated by modified FA and SCA respectively.Besides,the random search strategy based on Lévy flight is adopted to update the stagnant or infeasible solutions to enhance the population diversity.Elitist selection technique is applied to save the promising solutions and further improve the convergence rate.Moreover,the adaptive penalty function is employed to deal with the constraints.Finally,the performance of HSCFA is demonstrated through the numerical examples with nonstructural masses and frequency constraints.The results show that HSCFA is an efficient and competitive tool for shape and size optimization problems with frequency constraints.

A structural topological optimization method for multi-displacement constraints and any initial topology configuration

In density-based topological design, one expects that the final result consists of elements either black （solid material） or white （void）, without any grey areas. Moreover, one also expects that the optimal topology can be obtained by starting from any initial topology configuration. An improved structural topological optimization method for multidisplacement constraints is proposed in this paper. In the proposed method, the whole optimization process is divided into two optimization adjustment phases and a phase transferring step. Firstly, an optimization model is built to deal with the varied displacement limits, design space adjustments, and reasonable relations between the element stiffness matrix and mass and its element topology variable. Secondly, a procedure is proposed to solve the optimization problem formulated in the first optimization adjustment phase, by starting with a small design space and advancing to a larger deign space. The design space adjustments are automatic when the design domain needs expansions, in which the convergence of the proposed method will not be affected. The final topology obtained by the proposed procedure in the first optimization phase, can approach to the vicinity of the optimum topology. Then, a heuristic algorithm is given to improve the efficiency and make the designed structural topology black/white in both the phase transferring step and the second optimization adjustment phase. And the optimum topology can finally be obtained by the second phase optimization adjustments. Two examples are presented to show that the topologies obtained by the proposed method are of very good 0/1 design distribution property, and the computational efficiency is enhanced by reducing the element number of the design structural finite model during two optimization adjustment phases. And the examples also show that this method is robust and practicable.

A LEVEL SET METHOD FOR STRUCTURAL TOPOLOGY OPTIMIZATION WITH MULTI-CONSTRAINTS AND MULTI-MATERIALS

Combining the vector level set model,the shape sensitivity analysis theory with the gradient projection technique,a level set method for topology optimization with multi-constraints and multi-materials is presented in this paper.The method implicitly describes structural material in- terfaces by the vector level set and achieves the optimal shape and topology through the continuous evolution of the material interfaces in the structure.In order to increase computational efficiency for a fast convergence,an appropriate nonlinear speed mapping is established in the tangential space of the active constraints.Meanwhile,in order to overcome the numerical instability of general topology opti- mization problems,the regularization with the mean curvature flow is utilized to maintain the interface smoothness during the optimization process.The numerical examples demonstrate that the approach possesses a good flexibility in handling topological changes and gives an interface representation in a high fidelity,compared with other methods based on explicit boundary variations in the literature.

Data-driven Wasserstein distributionally robust chance-constrained optimization for crude oil scheduling under uncertainty

Crude oil scheduling optimization is an effective method to enhance the economic benefits of oil refining.But uncertainties,including uncertain demands of crude distillation units(CDUs),might make the production plans made by the traditional deterministic optimization models infeasible.A data-driven Wasserstein distributionally robust chance-constrained(WDRCC)optimization approach is proposed in this paper to deal with demand uncertainty in crude oil scheduling.First,a new deterministic crude oil scheduling optimization model is developed as the basis of this approach.The Wasserstein distance is then used to build ambiguity sets from historical data to describe the possible realizations of probability distributions of uncertain demands.A cross-validation method is advanced to choose suitable radii for these ambiguity sets.The deterministic model is reformulated as a WDRCC optimization model for crude oil scheduling to guarantee the demand constraints hold with a desired high probability even in the worst situation in ambiguity sets.The proposed WDRCC model is transferred into an equivalent conditional value-at-risk representation and further derived as a mixed-integer nonlinear programming counterpart.Industrial case studies from a real-world refinery are conducted to show the effectiveness of the proposed method.Out-of-sample tests demonstrate that the solution of the WDRCC model is more robust than those of the deterministic model and the chance-constrained model.

Accelerated Primal-Dual Projection Neurodynamic Approach With Time Scaling for Linear and Set Constrained Convex Optimization Problems

The Nesterov accelerated dynamical approach serves as an essential tool for addressing convex optimization problems with accelerated convergence rates.Most previous studies in this field have primarily concentrated on unconstrained smooth con-vex optimization problems.In this paper,on the basis of primal-dual dynamical approach,Nesterov accelerated dynamical approach,projection operator and directional gradient,we present two accelerated primal-dual projection neurodynamic approaches with time scaling to address convex optimization problems with smooth and nonsmooth objective functions subject to linear and set constraints,which consist of a second-order ODE(ordinary differential equation)or differential conclusion system for the primal variables and a first-order ODE for the dual vari-ables.By satisfying specific conditions for time scaling,we demonstrate that the proposed approaches have a faster conver-gence rate.This only requires assuming convexity of the objective function.We validate the effectiveness of our proposed two accel-erated primal-dual projection neurodynamic approaches through numerical experiments.

Optimization of Generator Based on Gaussian Process Regression Model with Conditional Likelihood Lower Bound Search

The noise that comes from finite element simulation often causes the model to fall into the local optimal solution and over fitting during optimization of generator.Thus,this paper proposes a Gaussian Process Regression(GPR)model based on Conditional Likelihood Lower Bound Search(CLLBS)to optimize the design of the generator,which can filter the noise in the data and search for global optimization by combining the Conditional Likelihood Lower Bound Search method.Taking the efficiency optimization of 15 kW Permanent Magnet Synchronous Motor as an example.Firstly,this method uses the elementary effect analysis to choose the sensitive variables,combining the evolutionary algorithm to design the super Latin cube sampling plan;Then the generator-converter system is simulated by establishing a co-simulation platform to obtain data.A Gaussian process regression model combing the method of the conditional likelihood lower bound search is established,which combined the chi-square test to optimize the accuracy of the model globally.Secondly,after the model reaches the accuracy,the Pareto frontier is obtained through the NSGA-II algorithm by considering the maximum output torque as a constraint.Last,the constrained optimization is transformed into an unconstrained optimizing problem by introducing maximum constrained improvement expectation(CEI)optimization method based on the re-interpolation model,which cross-validated the optimization results of the Gaussian process regression model.The above method increase the efficiency of generator by 0.76%and 0.5%respectively;And this method can be used for rapid modeling and multi-objective optimization of generator systems.

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.

APPROACH FOR LAYOUT OPTIMIZATION OF TRUSS STRUCTURES WITH DISCRETE VARIABLES UNDER DYNAMIC STRESS, DISPLACEMENT AND STABILITY CONSTRAINTS

A mathematical model was developed for layout optimization of truss structures with discrete variables subjected to dynamic stress, dynamic displacement and dynamic stability constraints. By using the quasi-static method, the mathematical model of structure optimization under dynamic stress, dynamic displacement and dynamic stability constraints were transformed into one subjected to static stress, displacement and stability constraints. The optimization procedures include two levels, i.e., the topology optimization and the shape optimization. In each level, the comprehensive algorithm was used and the relative difference quotients of two kinds of variables were used to search the optimum solution. A comparison between the optimum results of model with stability constraints and the optimum results of model without stability constraint was given. And that shows the stability constraints have a great effect on the optimum solutions.

Topology Optimization with Aperiodic Load Fatigue Constraints Based on Bidirectional Evolutionary Structural Optimization

Because of descriptive nonlinearity and computational inefficiency,topology optimization with fatigue life under aperiodic loads has developed slowly.A fatigue constraint topology optimization method based on bidirectional evolutionary structural optimization(BESO)under an aperiodic load is proposed in this paper.In viewof the severe nonlinearity of fatigue damagewith respect to design variables,effective stress cycles are extracted through transient dynamic analysis.Based on the Miner cumulative damage theory and life requirements,a fatigue constraint is first quantified and then transformed into a stress problem.Then,a normalized termination criterion is proposed by approximatemaximum stress measured by global stress using a P-normaggregation function.Finally,optimization examples show that the proposed algorithm can not only meet the requirements of fatigue life but also obtain a reasonable configuration.

Fail-Safe Topology Optimization of Continuum Structures with Multiple Constraints Based on ICM Method

Traditional topology optimization methods may lead to a great reduction in the redundancy of the optimized structure due to unexpected material removal at the critical components.The local failure in critical components can instantly cause the overall failure in the structure.More and more scholars have taken the fail-safe design into consideration when conducting topology optimization.A lot of good designs have been obtained in their research,though limited regarding minimizing structural compliance(maximizing stiffness)with given amount of material.In terms of practical engineering applications considering fail-safe design,it is more meaningful to seek for the lightweight structure with enough stiffness to resist various component failures and/or to meet multiple design requirements,than the stiffest structure only.Thus,this paper presents a fail-safe topology optimization model for minimizing structural weight with respect to stress and displacement constraints.The optimization problem is solved by utilizing the independent continuous mapping(ICM)method combined with the dual sequence quadratic programming(DSQP)algorithm.Special treatments are applied to the constraints,including converting local stress constraints into a global structural strain energy constraint and expressing the displacement constraint explicitly with approximations.All of the constraints are nondimensionalized to avoid numerical instability caused by great differences in constraint magnitudes.The optimized results exhibit more complex topological configurations and higher redundancy to resist local failures than the traditional optimization designs.This paper also shows how to find the worst failure region,which can be a good reference for designers in engineering.

An Improved Data-Driven Topology Optimization Method Using Feature Pyramid Networks with Physical Constraints

Deep learning for topology optimization has been extensively studied to reduce the cost of calculation in recent years.However,the loss function of the above method is mainly based on pixel-wise errors from the image perspective,which cannot embed the physical knowledge of topology optimization.Therefore,this paper presents an improved deep learning model to alleviate the above difficulty effectively.The feature pyramid network(FPN),a kind of deep learning model,is trained to learn the inherent physical law of topology optimization itself,of which the loss function is composed of pixel-wise errors and physical constraints.Since the calculation of physical constraints requires finite element analysis(FEA)with high calculating costs,the strategy of adjusting the time when physical constraints are added is proposed to achieve the balance between the training cost and the training effect.Then,two classical topology optimization problems are investigated to verify the effectiveness of the proposed method.The results show that the developed model using a small number of samples can quickly obtain the optimization structure without any iteration,which has not only high pixel-wise accuracy but also good physical performance.

Stabilization of linear time-varying systems with state and input constraints using convex optimization

The stabilization problem of linear time-varying systems with both state and input constraints is considered. Sufficient conditions for the existence of the solution to this problem are derived and a gain-switched（gain-scheduled） state feedback control scheme is built to stabilize the constrained timevarying system. The design problem is transformed to a series of convex feasibility problems which can be solved efficiently. A design example is given to illustrate the effect of the proposed algorithm.

A METHOD FOR TOPOLOGICAL OPTIMIZATION OF STRUCTURES WITH DISCRETE VARIABLES UNDER DYNAMIC STRESS AND DISPLACEMENT CONSTRAINTS

A method for topological optimization of structures with discrete variables subjected to dynamic stress and displacement constraints is presented. By using the quasistatic method, the structure optimization problem under dynamic stress and displacement constraints is converted into one subjected to static stress and displacement constraints. The comprehensive algorithm for topological optimization of structures with discrete variables is used to find the optimum solution.

THE CHARACTERIZATION OF EFFICIENCY AND SADDLE POINT CRITERIA FOR MULTIOBJECTIVE OPTIMIZATION PROBLEM WITH VANISHING CONSTRAINTS

In this article, we focus to study about modified objective function approach for multiobjective optimization problem with vanishing constraints. An equivalent η-approximated multiobjective optimization problem is constructed by a modification of the objective function in the original considered optimization problem. Furthermore, we discuss saddle point criteria for the aforesaid problem. Moreover, we present some examples to verify the established results.

Line Segment Optimization Algorithm for High Resolution Optical Remote Sensing Image Based on Geometric and Texture Constraints

Aiming at the problem that high-resolution optical remote sensing image,lines are prone to fracture,and a line segment optimization algorithm is proposed in this paper.Firstly,the line segment is regarded as a way to express the contour of the ground object,and the laws of line segment fracture from two aspects of geometric features and texture features are analyzed;Secondly,the line segment optimization algorithm is proposed.It takes the results of detecting line segments as the processing primitives,determines the initial optimized line segment according to the length of the line segment,establishes the tracking rectangular region and geometric constraint model for the fractured line segments,builds a dynamic optimization model,and gives a complete line optimization process.Through the analysis of experimental results of multiple actual scenes and different types of remote sensing images,it is shown that this algorithm can not only solve the problem of line segment fracture caused by terrain occlusion,edge blurring,and edge serration,but also comparing with other methods,the proposed algorithm has great advantages in optimizing line length and restraining over extraction problem.

On the Second Order Optimality Conditions for Optimization Problems with Inequality Constraints

A nonlinear optimization problem (P) with inequality constraints can be converted into a new optimization problem (PE) with equality constraints only. This is a Valentine method for finite dimensional optimization. We review second order optimality conditions for (PE) in connection with those of (P). A strictly complementary slackness condition can be made to get the property that sufficient optimality conditions for (P) imply the same property for (PE). We give some new results (see Theorems 3.1, 3.2 and 3.3) .Without any assumption, a counterexample is given to show that these conditions are not equivalent.

Distributed optimization for discrete-time multiagent systems with nonconvex control input constraints and switching topologies

This paper addresses the distributed optimization problem of discrete-time multiagent systems with nonconvex control input constraints and switching topologies.We introduce a novel distributed optimization algorithm with a switching mechanism to guarantee that all agents eventually converge to an optimal solution point,while their control inputs are constrained in their own nonconvex region.It is worth noting that the mechanism is performed to tackle the coexistence of the nonconvex constraint operator and the optimization gradient term.Based on the dynamic transformation technique,the original nonlinear dynamic system is transformed into an equivalent one with a nonlinear error term.By utilizing the nonnegative matrix theory,it is shown that the optimization problem can be solved when the union of switching communication graphs is jointly strongly connected.Finally,a numerical simulation example is used to demonstrate the acquired theoretical results.