A FLEXIBLE OBJECTIVE-CONSTRAINT APPROACH AND A NEW ALGORITHM FOR CONSTRUCTING THE PARETO FRONT OF MULTIOBJECTIVE OPTIMIZATION PROBLEMS

In this article, a novel scalarization technique, called the improved objective-constraint approach, is introduced to find efficient solutions of a given multiobjective programming problem. The presented scalarized problem extends the objective-constraint problem. It is demonstrated that how adding variables to the scalarized problem, can lead to find conditions for (weakly, properly) Pareto optimal solutions. Applying the obtained necessary and sufficient conditions, two algorithms for generating the Pareto front approximation of bi-objective and three-objective programming problems are designed. These algorithms are easy to implement and can achieve an even approximation of (weakly, properly) Pareto optimal solutions. These algorithms can be generalized for optimization problems with more than three criterion functions, too. The effectiveness and capability of the algorithms are demonstrated in test problems.

Multiobjective Differential Evolution for Higher-Dimensional Multimodal Multiobjective Optimization

In multimodal multiobjective optimization problems(MMOPs),there are several Pareto optimal solutions corre-sponding to the identical objective vector.This paper proposes a new differential evolution algorithm to solve MMOPs with higher-dimensional decision variables.Due to the increase in the dimensions of decision variables in real-world MMOPs,it is diffi-cult for current multimodal multiobjective optimization evolu-tionary algorithms(MMOEAs)to find multiple Pareto optimal solutions.The proposed algorithm adopts a dual-population framework and an improved environmental selection method.It utilizes a convergence archive to help the first population improve the quality of solutions.The improved environmental selection method enables the other population to search the remaining decision space and reserve more Pareto optimal solutions through the information of the first population.The combination of these two strategies helps to effectively balance and enhance conver-gence and diversity performance.In addition,to study the per-formance of the proposed algorithm,a novel set of multimodal multiobjective optimization test functions with extensible decision variables is designed.The proposed MMOEA is certified to be effective through comparison with six state-of-the-art MMOEAs on the test functions.

Analysis and Research on Mechanical Stress and Multiobjective Optimization of Synchronous Reluctance Motor

The mechanical strength of the synchronous reluctance motor(SynRM)has always been a great challenge.This paper presents an analysis method for assessing stress equivalence and magnetic bridge stress interaction,along with a multiobjective optimization approach.Considering the complex flux barrier structure and inevitable stress concentration at the bridge,the finite element model suitable for SynRM is established.Initially,a neural network structure with two inputs,one output,and three layers is established.Continuous functions are constructed to enhance accuracy.Additionally,the equivalent stress can be converted into a contour distribution of a three-dimensional stress graph.The contour line distribution illustrates the matching scheme for magnetic bridge lengths under equivalent stress.Moreover,the paper explores the analysis of magnetic bridge interaction stress.The optimization levels corresponding to the length of each magnetic bridge are defined,and each level is analyzed by the finite element method.The Taguchi method is used to determine the specific gravity of the stress source on each magnetic bridge.Based on this,a multiobjective optimization employing the Multiobjective Particle Swarm Optimization(MOPSO)technique is introduced.By taking the rotor magnetic bridge as the design parameter,ten optimization objectives including air-gap flux density,sinusoidal property,average torque,torque ripple,and mechanical stress are optimized.The relationship between the optimization objectives and the design parameters can be obtained based on the response surface method(RSM)to avoid too many experimental samples.The optimized model is compared with the initial model,and the optimized effect is verified.Finally,the temperature distribution of under rated working conditions is analyzed,providing support for addressing thermal stress as mentioned earlier.

MULTIOBJECTIVE OPTIMIZATION OF EIGHT-DOF VEHICLE SUSPENSION BASED ON GAME THEORY

A systematic and effective optimization is proposed for the design of a three-dimensional （3-D） vehicle suspension model with eight degrees of freedom （DOF）, including vertical seat motion, vehicle suspension, pitching and rolling motions, and vertical wheel motions using the evolutionary game theory. A new design of the passive suspension is aided by game theory to attain the best compromise between ride quality and suspension deflections. Extensive simulations are performed on three type road surface models A, B, C pavement grades based on the guidelines provided by ISO-2631 with the Matlab/Simulink environment. The preliminary results show that, when the passive suspension is optimized via the proposed approach, a substantial improvement in the vertical ride quality is obtained while keeping the suspension deflections within their allowable clearance when the vehicle moves at a constant velocity v=20 m/s, and the comfort performance of a suspension seat can be enhanced by 20%-30%.

Multiobjective Optimization of Simulated Moving Bed by Tissue P System

The binaphthol enantiomers separation process using simulation moving bed technology is simulated with the true moving bed approach （TMB）. In order to systematically optimize the process with multiple productive objectives, this article develops a variant of tissue P system （TPS）. Inspired by general tissue P systems, the special TPS has a tissue-like structure with several membranes. The key rules of each membrane are the communication rule and mutation rule. These characteristics contribute to the diversity of the population, the conquest of the multimodal of objective function, and the convergence of algorithm. The results of comparison with a popular algorithm——the non-dominated sorting genetic algorithm 2（NSGA-2） illustrate that the new algorithm has satisfactory performance. Using the algorithm, this study maximizes synchronously several conflicting objectives, purities of different products, and productivity.

Multiobjective Optimization of the Industrial Naphtha Catalytic Re-forming Process

In this article, a multiobjective optimization strategy for an industrial naphtha continuous catalytic reform-ing process that aims to obtain aromatic products is proposed. The process model is based on a 20-lumped kinetics re-action network and has been proved to be quite effective in terms of industrial application. The primary objectives in-clude maximization of yield of the aromatics and minimization of the yield of heavy aromatics. Four reactor inlet tem-peratures, reaction pressure, and hydrogen-to-oil molar ratio are selected as the decision variables. A genetic algorithm, which is proposed by the authors and named as the neighborhood and archived genetic algorithm (NAGA), is applied to solve this multiobjective optimization problem. The relations between each decision variable and the two objectives are also proposed and used for choosing a suitable solution from the obtained Pareto set.

Multiobjective optimization and multivariable control of the beer fermentation process with the use of evolutionary algorithms

This paper describes empirical research on the model, optimization and supervisory control of beer fermentation.Conditions in the laboratory were made as similar as possible to brewery industry conditions. Since mathematical models that consider realistic industrial conditions were not available, a new mathematical model design involving industrial conditions was first developed. Batch fermentations are multiobjective dynamic processes that must be guided along optimal paths to obtain good results.The paper describes a direct way to apply a Pareto set approach with multiobjective evolutionary algorithms (MOEAs).Successful finding of optimal ways to drive these processes were reported.Once obtained, the mathematical fermentation model was used to optimize the fermentation process by using an intelligent control based on certain rules.

Multiobjective optimization scheme for industrial synthesis gas sweetening plant in GTL process

In industrial amine plants the optimized operating conditions are obtained from the conclusion of occurred events and challenges that are normal in the working units. For the sake of reducing the costs, time consuming, and preventing unsuitable accidents, the optimization could be performed by a computer program. In this paper, simulation and parameter analysis of amine plant is performed at first. The optimization of this unit is studied using Non-Dominated Sorting Genetic Algorithm-II in order to produce sweet gas with CO 2 mole percentage less than 2.0% and H 2 S concentration less than 10 ppm for application in Fischer-Tropsch synthesis. The simulation of the plant in HYSYS v.3.1 software has been linked with MATLAB code for real-parameter NSGA-II to simulate and optimize the amine process. Three scenarios are selected to cover the effect of （DEA/MDEA） mass composition percent ratio at amine solution on objective functions. Results show that sour gas temperature and pressure of 33.98 ？ C and 14.96 bar, DEA/CO 2 molar flow ratio of 12.58, regeneration gas temperature and pressure of 94.92 ？ C and 3.0 bar, regenerator pressure of 1.53 bar, and ratio of DEA/MDEA = 20%/10% are the best values for minimizing plant energy consumption, amine circulation rate, and carbon dioxide recovery.

Reliability based multiobjective optimization for design of structures subject to random vibrations

Based on a multiobjective approach whose objective function (OF) vector collects stochastic reliability performance and structural cost indices, a structural optimization criterion for mechanical systems subject to random vibrations is presented for supporting engineer’s design. This criterion differs from the most commonly used conventional optimum design criterion for random vibrating structure, which is based on minimizing displacement or acceleration variance of main structure responses, without considering explicitly required performances against failure. The proposed criterion can properly take into account the design-reliability required performances, and it becomes a more efficient support for structural engineering decision making. The multiobjective optimum (MOO) design of a tuned mass damper (TMD) has been developed in a typical seismic design problem, to control structural vibration induced on a multi-storey building structure excited by nonstationary base acceleration random process. A numerical example for a three-storey building is developed and a sensitivity analysis is carried out. The results are shown in a useful manner for TMD design decision support.

Reactive Search Optimization;Application to Multiobjective Optimization Problems

During the last few years we have witnessed impressive developments in the area of stochastic local search techniques for intelligent optimization and Reactive Search Optimization. In order to handle the complexity, in the framework of stochastic local search optimization, learning and optimization has been deeply interconnected through interaction with the decision maker via the visualization approach of the online graphs. Consequently a number of complex optimization problems, in particular multiobjective optimization problems, arising in widely different contexts have been effectively treated within the general framework of RSO. In solving real-life multiobjective optimization problems often most emphasis are spent on finding the complete Pareto-optimal set and less on decision-making. However the com-plete task of multiobjective optimization is considered as a combined task of optimization and decision-making. In this paper, we suggest an interactive procedure which will involve the decision-maker in the optimization process helping to choose a single solution at the end. Our proposed method works on the basis of Reactive Search Optimization (RSO) algorithms and available software architecture packages. The procedure is further compared with the excising novel method of Interactive Multiobjective Optimization and Decision-Making, using Evolutionary method (I-MODE). In order to evaluate the effectiveness of both methods the well-known study case of welded beam design problem is reconsidered.

Evolutionary Algorithm with Ensemble Classifier Surrogate Model for Expensive Multiobjective Optimization

For many real-world multiobjective optimization problems,the evaluations of the objective functions are computationally expensive.Such problems are usually called expensive multiobjective optimization problems(EMOPs).One type of feasible approaches for EMOPs is to introduce the computationally efficient surrogates for reducing the number of function evaluations.Inspired from ensemble learning,this paper proposes a multiobjective evolutionary algorithm with an ensemble classifier(MOEA-EC)for EMOPs.More specifically,multiple decision tree models are used as an ensemble classifier for the pre-selection,which is be more helpful for further reducing the function evaluations of the solutions than using single inaccurate model.The extensive experimental studies have been conducted to verify the efficiency of MOEA-EC by comparing it with several advanced multiobjective expensive optimization algorithms.The experimental results show that MOEA-EC outperforms the compared algorithms.

Multiobjective Optimization of Truss Topology by Linear/Sequential Linear Programming Method

The present paper deals with a multiobjective optimization of truss topology by either Sequential Linear Programming （SLP） method or Linear Programming （LP） method. The ground structure approach is often used to solve this kind of design problems. In this paper, the topology optimization is formulated as a Multiobjective Optimization Problem （MOP）, which is to find the cross-sectional area of truss members, such that both the total volume of members and the weighted mean compliance are minimized. Based upon the Karush-Kuhn-Tucker conditions （the optimality condition）, the Pareto optimal front of this problem can be obtained theoretically. The truss topology optimization under multiple load cases can be solved by the SLP. On the other hand, the LP such as the Simplex method or the interior point method can be applied to find one of the Pareto optimal solutions of the MOP under single load case. The applications of either the SLP or the LP are illustrated in numerical examples with discussion on characteristics of design results.

Lagrangian Relaxation Method for Multiobjective Optimization Methods: Solution Approaches

This paper introduces the Lagrangian relaxation method to solve multiobjective optimization problems. It is often required to use the appropriate technique to determine the Lagrangian multipliers in the relaxation method that leads to finding the optimal solution to the problem. Our analysis aims to find a suitable technique to generate Lagrangian multipliers, and later these multipliers are used in the relaxation method to solve Multiobjective optimization problems. We propose a search-based technique to generate Lagrange multipliers. In our paper, we choose a suitable and well-known scalarization method that transforms the original multiobjective into a scalar objective optimization problem. Later, we solve this scalar objective problem using Lagrangian relaxation techniques. We use Brute force techniques to sort optimum solutions. Finally, we analyze the results, and efficient methods are recommended.

A New Multiobjective Particle Swarm Optimization Using Local Displacement and Local Guides

This paper introduces a novel variant of particle swarm optimization that leverages local displacements through attractors for addressing multiobjective optimization problems. The method incorporates a square root distance mechanism into the external archives to enhance the diversity. We evaluate the performance of the proposed approach on a set of constrained and unconstrained multiobjective test functions, establishing a benchmark for comparison. In order to gauge its effectiveness relative to established techniques, we conduct a comprehensive comparison with well-known approaches such as SMPSO, NSGA2 and SPEA2. The numerical results demonstrate that our method not only achieves efficiency but also exhibits competitiveness when compared to evolutionary algorithms. Particularly noteworthy is its superior performance in terms of convergence and diversification, surpassing the capabilities of its predecessors.

Variable Metric Method for Unconstrained Multiobjective Optimization Problems

In this paper,we propose a variable metric method for unconstrained multiobjective optimization problems(MOPs).First,a sequence of points is generated using different positive definite matrices in the generic framework.It is proved that accumulation points of the sequence are Pareto critical points.Then,without convexity assumption,strong convergence is established for the proposed method.Moreover,we use a common matrix to approximate the Hessian matrices of all objective functions,along which a new nonmonotone line search technique is proposed to achieve a local superlinear convergence rate.Finally,several numerical results demonstrate the effectiveness of the proposed method.

Multiobjective optimization using an immunodominance and clonal selection inspired algorithm

Based on the mechanisms of immunodominance and clonal selection theory, we propose a new multiobjective optimization algorithm, immune dominance clonal multiobjective algorithm （IDCMA）. IDCMA is unique in that its fitness values of current dominated individuals are assigned as the values of a custom distance measure, termed as Ab-Ab affinity, between the dominated individuals and one of the nondominated individuals found so far. According to the values of Ab-Ab affinity, all dominated individuals （antibodies） are divided into two kinds, subdominant antibodies and cryptic antibodies. Moreover, local search only applies to the subdominant antibodies, while the cryptic antibodies are redundant and have no function during local search, but they can become subdominant （active） antibodies during the subsequent evolution. Furthermore, a new immune operation, clonal proliferation is provided to enhance local search. Using the clonal proliferation operation, IDCMA reproduces individuals and selects their improved maturated progenies after local search, so single individuals can exploit their surrounding space effectively and the newcomers yield a broader exploration of the search space. The performance comparison of IDCMA with MISA, NSGA-Ⅱ, SPEA, PAES, NSGA, VEGA, NPGA, and HLGA in solving six well-known multiobjective function optimization problems and nine multiobjective 0/1 knapsack problems shows that IDCMA has a good performance in converging to approximate Pareto-optimal fronts with a good distribution.

Hybrid particle swarm optimization for multiobjective resource allocation

Resource allocation （RA） is the problem of allocating resources among various artifacts or business units to meet one or more expected goals, such a.s maximizing the profits, minimizing the costs, or achieving the best qualities. A complex multiobjective RA is addressed, and a multiobjective mathematical model is used to find solutions efficiently. Then, all improved particie swarm algorithm （mO_PSO） is proposed combined with a new particle diversity controller policies and dissipation operation. Meanwhile, a modified Pareto methods used in PSO to deal with multiobjectives optimization is presented. The effectiveness of the provided algorithm is validated by its application to some illustrative example dealing with multiobjective RA problems and with the comparative experiment with other algorithm.

Multiobjective extremal optimization with applications to engineering design

In this paper, we extend a novel unconstrained multiobjective optimization algorithm, so-called multiobjective extremal optimization （MOEO）, to solve the constrained multiobjective optimization problems （MOPs）. The proposed approach is validated by three constrained benchmark problems and successfully applied to handling three multiobjective engineering design problems reported in literature. Simulation results indicate that the proposed approach is highly competitive with three state-of-the-art multiobjective evolutionary algorithms, i.e., NSGA-11, SPEA2 and PAES. Thus MOEO can be considered a good alternative to solve constrained multiobjective optimization problems.

Second-Order Optimality Conditions for Multiobjective Optimization Whose Order Induced by Second-Order Cone

This paper is devoted to developing first-order necessary,second-order necessary,and second-order sufficient optimality conditions for a multiobjective optimization problem whose order is induced by a finite product of second-order cones(here named as Q-multiobjective optimization problem).For an abstract-constrained Q-multiobjective optimization problem,we derive two basic necessary optimality theorems for weak efficient solutions and a second-order sufficient optimality theorem for efficient solutions.For Q-multiobjective optimization problem with explicit constraints,we demonstrate first-order and second-order necessary optimality conditions under Robinson constraint qualification as well as second-order sufficient optimality conditions under upper second-order regularity for the explicit constraints.As applications,we obtain optimality conditions for polyhedral conic,second-order conic,and semi-definite conic Q-multiobjective optimization problems.

Analysis of the energy-minimization multiscale model with multiobjective optimization

Gas-solid two-phase flow is ubiquitous in nature and many engineering fields,such as chemical engineering,energy,and mining.The closure of its hydrodynamic model is difficult owing to the complex multiscale structure of such flow.To address this problem,the energy-minimization multi-scale(EMMS)model introduces a stability condition that presents a compromise of the different dominant mechanisms involved in the systems,each expressed as an extremum tendency.However,in the physical system,each dominant mechanism should be expressed to a certain extent,and this has been formulated as a multiobjective optimization problem according to the EMMS principle generalized from the EMMS model.The mathematical properties and physical meanings of this multiobjective optimization problem have not yet been explored.This paper presents a numerical solution of this multiobjective optimization problem and discusses the correspondence between the solution characteristics and flow regimes in gas-solid fluidization.This suggests that,while the most probable flow structures may correspond to the stable states predicted by the EMMS model,the noninferior solutions are in qualitative agreement with the observable flow structures under corresponding conditions.This demonstrates that both the dominant mechanisms and stability condition proposed for the EMMS model are physically reasonable and consistent,suggesting a general approach of describing complex systems with multiple dominant mechanisms.