Multi-objective optimization and evaluation of supercritical CO_(2) Brayton cycle for nuclear power generation

The supercritical CO_(2) Brayton cycle is considered a promising energy conversion system for Generation IV reactors for its simple layout,compact structure,and high cycle efficiency.Mathematical models of four Brayton cycle layouts are developed in this study for different reactors to reduce the cost and increase the thermohydraulic performance of nuclear power generation to promote the commercialization of nuclear energy.Parametric analysis,multi-objective optimizations,and four decision-making methods are applied to obtain each Brayton scheme’s optimal thermohydraulic and economic indexes.Results show that for the same design thermal power scale of reactors,the higher the core’s exit temperature,the better the Brayton cycle’s thermo-economic performance.Among the four-cycle layouts,the recompression cycle(RC)has the best overall performance,followed by the simple recuperation cycle(SR)and the intercooling cycle(IC),and the worst is the reheating cycle(RH).However,RH has the lowest total cost of investment(C_(tot))of$1619.85 million,and IC has the lowest levelized cost of energy(LCOE)of 0.012$/(kWh).The nuclear Brayton cycle system’s overall performance has been improved due to optimization.The performance of the molten salt reactor combined with the intercooling cycle(MSR-IC)scheme has the greatest improvement,with the net output power(W_(net)),thermal efficiencyη_(t),and exergy efficiency(η_(e))improved by 8.58%,8.58%,and 11.21%,respectively.The performance of the lead-cooled fast reactor combined with the simple recuperation cycle scheme was optimized to increase C_(tot) by 27.78%.In comparison,the internal rate of return(IRR)increased by only 7.8%,which is not friendly to investors with limited funds.For the nuclear Brayton cycle,the molten salt reactor combined with the recompression cycle scheme should receive priority,and the gas-cooled fast reactor combined with the reheating cycle scheme should be considered carefully.

A modified back analysis method for deep excavation with multi-objective optimization procedure

Real-time prediction of excavation-induced displacement of retaining pile during the deep excavation process is crucial for construction safety.This paper proposes a modified back analysis method with multi-objective optimization procedure,which enables a real-time prediction of horizontal displacement of retaining pile during construction.As opposed to the traditional stage-by-stage back analysis,time series monitoring data till the current excavation stage are utilized to form a multi-objective function.Then,the multi-objective particle swarm optimization (MOPSO) algorithm is applied for parameter identification.The optimized model parameters are immediately adopted to predict the excavation-induced pile deformation in the continuous construction stages.To achieve efficient parameter optimization and real-time prediction of system behavior,the back propagation neural network (BPNN) is established to substitute the finite element model,which is further implemented together with MOPSO for automatic operation.The proposed approach is applied in the Taihu tunnel excavation project,where the effectiveness of the method is demonstrated via the comparisons with the site monitoring data.The method is reliable with a prediction accuracy of more than 90%.Moreover,different optimization algorithms,including non-dominated sorting genetic algorithm (NSGA-II),Pareto Envelope-based Selection Algorithm II (PESA-II) and MOPSO,are compared,and their influences on the prediction accuracy at different excavation stages are studied.The results show that MOPSO has the best performance for high dimensional optimization task.

A reduced combustion mechanism of ammonia/diesel optimized with multi-objective genetic algorithm

For the deep understanding on combustion of ammonia/diesel,this study develops a reduced mechanism of ammonia/diesel with 227 species and 937 reactions.The sub-mechanism on ammonia/interactions of N-based and C-based species(N—C)/NOx is optimized using the Non-dominated Sorting Genetic Algorithm II(NSGA-II)with 200 generations.The optimized mechanism(named as 937b)is validated against combustion characteristics of ammonia/methane(which is used to examine the accuracy of N—C interactions)and ammonia/diesel blends.The ignition delay times(IDTs),the laminar flame speeds and most of key intermediate species during the combustion of ammonia/methane blends can be accurately simulated by 937b under a wide range of conditions.As for ammonia/diesel blends with various diesel energy fractions,reasonable predictions on the IDTs under pressures from 1.0 MPa to5.0 MPa as well as the laminar flame speeds are also achieved by 937b.In particular,with regard to the IDT simulations of ammonia/diesel blends,937b makes progress in both aspects of overall accuracy and computational efficiency,compared to a detailed ammonia/diesel mechanism.Further kinetic analysis reveals that the reaction pathway of ammonia during the combustion of ammonia/diesel blend mainly differs in the tendencies of oxygen additions to NH_2 and NH with different equivalence ratios.

Multi-objective global optimization approach predicted quasi-layered ternary TiOS crystals with promising photocatalytic properties

Titanium dioxide(TiO_(2))has attracted considerable research attentions for its promising applications in solar cells and photocatalytic devices.However,the intrinsic challenge lies in the relatively low energy conversion efficiency of TiO_(2),primarily attributed to the substantial band gaps(exceeding 3.0 eV)associated with its rutile and anatase phases.Leveraging multi-objective global optimization,we have identified two quasi-layered ternary Ti-O-S crystals,composed of titanium,oxygen,and sulfur.The calculations of formation energy,phonon dispersions,and thermal stability confirm the chemical,dynamical and thermal stability of these newly discovered phases.Employing the state-of-art hybrid density functional approach and many-body perturbation theory(quasiparticle GW approach and Bethe-Salpeter equation),we calculate the optical properties of both the TiOS phases.Significantly,both phases show favorable photocatalytic characteristics,featuring band gaps suitable for visible optical absorption and appropriate band alignments with water for effective charge carrier separation.Therefore,ternary compound TiOS holds the potential for achieving high-efficiency photochemical conversion,showing our multi-objective global optimization provides a new approach for novel environmental and energy materials design with multicomponent compounds.

Multi-Strategy Assisted Multi-Objective Whale Optimization Algorithm for Feature Selection

In classification problems,datasets often contain a large amount of features,but not all of them are relevant for accurate classification.In fact,irrelevant features may even hinder classification accuracy.Feature selection aims to alleviate this issue by minimizing the number of features in the subset while simultaneously minimizing the classification error rate.Single-objective optimization approaches employ an evaluation function designed as an aggregate function with a parameter,but the results obtained depend on the value of the parameter.To eliminate this parameter’s influence,the problem can be reformulated as a multi-objective optimization problem.The Whale Optimization Algorithm(WOA)is widely used in optimization problems because of its simplicity and easy implementation.In this paper,we propose a multi-strategy assisted multi-objective WOA(MSMOWOA)to address feature selection.To enhance the algorithm’s search ability,we integrate multiple strategies such as Levy flight,Grey Wolf Optimizer,and adaptive mutation into it.Additionally,we utilize an external repository to store non-dominant solution sets and grid technology is used to maintain diversity.Results on fourteen University of California Irvine(UCI)datasets demonstrate that our proposed method effectively removes redundant features and improves classification performance.The source code can be accessed from the website:https://github.com/zc0315/MSMOWOA.

Crashworthiness Design and Multi-Objective Optimization of Bionic Thin-Walled Hybrid Tube Structures

Thin-walled structures are widely used in cars due to their lightweight construction and energy-absorbing properties.However,issues such as high initial stress and lowenergy-absorbing efficiency arise.This study proposes a novel energy-absorbing structure inwhich a straight tube is combinedwith a conical tube and a bamboo-inspired bulkhead structure is introduced.This configuration allows the conical tube to flip outward first and then fold together with the straight tube.This deformation mode absorbs more energy and less peak force than the conical tube sinking and flipping inward.Through finite element numerical simulation,the specific energy absorption capacity of the structure is increased by 26%compared to that of a regular circular cross-section tube.Finally,the impact resistance of the bionic straight tapered tube structure is further improved through multi-objective optimization,promoting the engineering application and lightweight design of hybrid cross-section tubes.

Effect of distribution of fines on evolution of cooperation in spatial public goods game

In the realm of public goods game,punishment,as a potent tool,stands out for fostering cooperation.While it effectively addresses the first-order free-rider problem,the associated costs can be substantial.Punishers incur expenses in imposing sanctions,while defectors face fines.Unfortunately,these monetary elements seemingly vanish into thin air,representing a loss to the system itself.However,by virtue of the redistribution of fines to cooperators and punishers,not only can we mitigate this loss,but the rewards for these cooperative individuals can be enhanced.Based upon this premise,this paper introduces a fine distribution mechanism to the traditional pool punishment model.Under identical parameter settings,by conducting a comparative experiment with the conventional punishment model,the paper aims to investigate the impact of fine distribution on the evolution of cooperation in spatial public goods game.The experimental results clearly demonstrate that,in instances where the punishment cost is prohibitively high,the cooperative strategies of the traditional pool punishment model may completely collapse.However,the model enriched with fine distribution manages to sustain a considerable number of cooperative strategies,thus highlighting its effectiveness in promoting and preserving cooperation,even in the face of substantial punishment cost.

Multi-objective Design of Blending Fuel by Intelligent Optimization Algorithms

Fuel design is a complex multi-objective optimization problem in which facile and robust methods are urgently demanded.Herein,a complete workflow for designing a fuel blending scheme is presented,which is theoretically supported,efficient,and reliable.Based on the data distribution of the composition and properties of the blending fuels,a model of polynomial regression with appropriate hypothesis space was established.The parameters of the model were further optimized by different intelligence algorithms to achieve high-precision regression.Then,the design of a blending fuel was described as a multi-objective optimization problem,which was solved using a Nelder–Mead algorithm based on the concept of Pareto domination.Finally,the design of a target fuel was fully validated by experiments.This study provides new avenues for designing various blending fuels to meet the needs of next-generation engines.

MOALG: A Metaheuristic Hybrid of Multi-Objective Ant Lion Optimizer and Genetic Algorithm for Solving Design Problems

This study proposes a hybridization of two efficient algorithm’s Multi-objective Ant Lion Optimizer Algorithm(MOALO)which is a multi-objective enhanced version of the Ant Lion Optimizer Algorithm(ALO)and the Genetic Algorithm(GA).MOALO version has been employed to address those problems containing many objectives and an archive has been employed for retaining the non-dominated solutions.The uniqueness of the hybrid is that the operators like mutation and crossover of GA are employed in the archive to update the solutions and later those solutions go through the process of MOALO.A first-time hybrid of these algorithms is employed to solve multi-objective problems.The hybrid algorithm overcomes the limitation of ALO of getting caught in the local optimum and the requirement of more computational effort to converge GA.To evaluate the hybridized algorithm’s performance,a set of constrained,unconstrained test problems and engineering design problems were employed and compared with five well-known computational algorithms-MOALO,Multi-objective Crystal Structure Algorithm(MOCryStAl),Multi-objective Particle Swarm Optimization(MOPSO),Multi-objective Multiverse Optimization Algorithm(MOMVO),Multi-objective Salp Swarm Algorithm(MSSA).The outcomes of five performance metrics are statistically analyzed and the most efficient Pareto fronts comparison has been obtained.The proposed hybrid surpasses MOALO based on the results of hypervolume(HV),Spread,and Spacing.So primary objective of developing this hybrid approach has been achieved successfully.The proposed approach demonstrates superior performance on the test functions,showcasing robust convergence and comprehensive coverage that surpasses other existing algorithms.

A Prediction-Based Multi-Objective VM Consolidation Approach for Cloud Data Centers

Virtual machine(VM)consolidation aims to run VMs on the least number of physical machines(PMs).The optimal consolidation significantly reduces energy consumption(EC),quality of service(QoS)in applications,and resource utilization.This paper proposes a prediction-basedmulti-objective VMconsolidation approach to search for the best mapping between VMs and PMs with good timeliness and practical value.We use a hybrid model based on Auto-Regressive Integrated Moving Average(ARIMA)and Support Vector Regression(SVR)(HPAS)as a prediction model and consolidate VMs to PMs based on prediction results by HPAS,aiming at minimizing the total EC,performance degradation(PD),migration cost(MC)and resource wastage(RW)simultaneously.Experimental results usingMicrosoft Azure trace show the proposed approach has better prediction accuracy and overcomes the multi-objective consolidation approach without prediction(i.e.,Non-dominated sorting genetic algorithm 2,Nsga2)and the renowned Overload Host Detection(OHD)approaches without prediction,such as Linear Regression(LR),Median Absolute Deviation(MAD)and Inter-Quartile Range(IQR).

Roles of N-cadherin in cerebral cortical development:cooperation with membrane trafficking and actin cytoskeletal regulation

Cell adhesion plays pivotal roles in the morphogenesis of multicellular organisms.Epithelial cells form several types of cell-to-cell adhesion,including zonula occludens(tight junctions),zonula adhaerens(adherens junctions),and macula adhaerens(desmosomes).Although these adhesion complexes are basically observed only in epithelial cells,cadherins,which are the major cell adhesion molecules of adherens junctions,are expressed in both epithelial and non-epithelial tissues,including neural tissues(Kawauchi,2012).The cadherin superfamily consists of more than 100 members,but classic cadherins.

Multi-Objective Equilibrium Optimizer for Feature Selection in High-Dimensional English Speech Emotion Recognition

Speech emotion recognition(SER)uses acoustic analysis to find features for emotion recognition and examines variations in voice that are caused by emotions.The number of features acquired with acoustic analysis is extremely high,so we introduce a hybrid filter-wrapper feature selection algorithm based on an improved equilibrium optimizer for constructing an emotion recognition system.The proposed algorithm implements multi-objective emotion recognition with the minimum number of selected features and maximum accuracy.First,we use the information gain and Fisher Score to sort the features extracted from signals.Then,we employ a multi-objective ranking method to evaluate these features and assign different importance to them.Features with high rankings have a large probability of being selected.Finally,we propose a repair strategy to address the problem of duplicate solutions in multi-objective feature selection,which can improve the diversity of solutions and avoid falling into local traps.Using random forest and K-nearest neighbor classifiers,four English speech emotion datasets are employed to test the proposed algorithm(MBEO)as well as other multi-objective emotion identification techniques.The results illustrate that it performs well in inverted generational distance,hypervolume,Pareto solutions,and execution time,and MBEO is appropriate for high-dimensional English SER.

Even Search in a Promising Region for Constrained Multi-Objective Optimization

In recent years, a large number of approaches to constrained multi-objective optimization problems(CMOPs) have been proposed, focusing on developing tweaked strategies and techniques for handling constraints. However, an overly finetuned strategy or technique might overfit some problem types,resulting in a lack of versatility. In this article, we propose a generic search strategy that performs an even search in a promising region. The promising region, determined by obtained feasible non-dominated solutions, possesses two general properties.First, the constrained Pareto front(CPF) is included in the promising region. Second, as the number of feasible solutions increases or the convergence performance(i.e., approximation to the CPF) of these solutions improves, the promising region shrinks. Then we develop a new strategy named even search,which utilizes the non-dominated solutions to accelerate convergence and escape from local optima, and the feasible solutions under a constraint relaxation condition to exploit and detect feasible regions. Finally, a diversity measure is adopted to make sure that the individuals in the population evenly cover the valuable areas in the promising region. Experimental results on 45 instances from four benchmark test suites and 14 real-world CMOPs have demonstrated that searching evenly in the promising region can achieve competitive performance and excellent versatility compared to 11 most state-of-the-art methods tailored for CMOPs.

An Immune-Inspired Approach with Interval Allocation in Solving Multimodal Multi-Objective Optimization Problems with Local Pareto Sets

In practical engineering,multi-objective optimization often encounters situations where multiple Pareto sets(PS)in the decision space correspond to the same Pareto front(PF)in the objective space,known as Multi-Modal Multi-Objective Optimization Problems(MMOP).Locating multiple equivalent global PSs poses a significant challenge in real-world applications,especially considering the existence of local PSs.Effectively identifying and locating both global and local PSs is a major challenge.To tackle this issue,we introduce an immune-inspired reproduction strategy designed to produce more offspring in less crowded,promising regions and regulate the number of offspring in areas that have been thoroughly explored.This approach achieves a balanced trade-off between exploration and exploitation.Furthermore,we present an interval allocation strategy that adaptively assigns fitness levels to each antibody.This strategy ensures a broader survival margin for solutions in their initial stages and progressively amplifies the differences in individual fitness values as the population matures,thus fostering better population convergence.Additionally,we incorporate a multi-population mechanism that precisely manages each subpopulation through the interval allocation strategy,ensuring the preservation of both global and local PSs.Experimental results on 21 test problems,encompassing both global and local PSs,are compared with eight state-of-the-art multimodal multi-objective optimization algorithms.The results demonstrate the effectiveness of our proposed algorithm in simultaneously identifying global Pareto sets and locally high-quality PSs.

Multi-Objective Optimization of Aluminum Alloy Electric Bus Frame Connectors for Enhanced Durability

The widespread adoption of aluminumalloy electric buses,known for their energy efficiency and eco-friendliness,faces a challenge due to the aluminum frame’s susceptibility to deformation compared to steel.This issue is further exacerbated by the stringent requirements imposed by the flammability and explosiveness of batteries,necessitating robust frame protection.Our study aims to optimize the connectors of aluminum alloy bus frames,emphasizing durability,energy efficiency,and safety.This research delves into Multi-Objective Coordinated Optimization(MCO)techniques for lightweight design in aluminum alloy bus body connectors.Our goal is to enhance lightweighting,reinforce energy absorption,and improve deformation resistance in connector components.Three typical aluminum alloy connectors were selected and a design optimization platform was built for their MCO using a variety of software and methods.Firstly,through three-point bending experiments and finite element analysis on three types of connector components,we identified optimized design parameters based on deformation patterns.Then,employing Optimal Latin hypercube design(OLHD),parametric modeling,and neural network approximation,we developed high-precision approximate models for the design parameters of each connector component,targeting energy absorption,mass,and logarithmic strain.Lastly,utilizing the Archive-based Micro Genetic Algorithm(AMGA),Multi-Objective Particle Swarm Optimization(MOPSO),and Non-dominated SortingGenetic Algorithm(NSGA2),we explored optimized design solutions for these joint components.Subsequently,we simulated joint assembly buckling during bus rollover crash scenarios to verify and analyze the optimized solutions in three-point bending simulations.Each joint component showcased a remarkable 30%–40%mass reduction while boosting energy absorption.Our design optimization method exhibits high efficiency and costeffectiveness.Leveraging contemporary automation technology,the design optimization platform developed in this study is poised to facilitate intelligent optimization of lightweight metal components in future applications.

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.

Constraints Separation Based Evolutionary Multitasking for Constrained Multi-Objective Optimization Problems

Constrained multi-objective optimization problems(CMOPs)generally contain multiple constraints,which not only form multiple discrete feasible regions but also reduce the size of optimal feasible regions,thus they propose serious challenges for solvers.Among all constraints,some constraints are highly correlated with optimal feasible regions;thus they can provide effective help to find feasible Pareto front.However,most of the existing constrained multi-objective evolutionary algorithms tackle constraints by regarding all constraints as a whole or directly ignoring all constraints,and do not consider judging the relations among constraints and do not utilize the information from promising single constraints.Therefore,this paper attempts to identify promising single constraints and utilize them to help solve CMOPs.To be specific,a CMOP is transformed into a multitasking optimization problem,where multiple auxiliary tasks are created to search for the Pareto fronts that only consider a single constraint respectively.Besides,an auxiliary task priority method is designed to identify and retain some high-related auxiliary tasks according to the information of relative positions and dominance relationships.Moreover,an improved tentative method is designed to find and transfer useful knowledge among tasks.Experimental results on three benchmark test suites and 11 realworld problems with different numbers of constraints show better or competitive performance of the proposed method when compared with eight state-of-the-art peer methods.

Enhancing Evolutionary Algorithms With Pattern Mining for Sparse Large-Scale Multi-Objective Optimization Problems

Sparse large-scale multi-objective optimization problems(SLMOPs)are common in science and engineering.However,the large-scale problem represents the high dimensionality of the decision space,requiring algorithms to traverse vast expanse with limited computational resources.Furthermore,in the context of sparse,most variables in Pareto optimal solutions are zero,making it difficult for algorithms to identify non-zero variables efficiently.This paper is dedicated to addressing the challenges posed by SLMOPs.To start,we introduce innovative objective functions customized to mine maximum and minimum candidate sets.This substantial enhancement dramatically improves the efficacy of frequent pattern mining.In this way,selecting candidate sets is no longer based on the quantity of nonzero variables they contain but on a higher proportion of nonzero variables within specific dimensions.Additionally,we unveil a novel approach to association rule mining,which delves into the intricate relationships between non-zero variables.This novel methodology aids in identifying sparse distributions that can potentially expedite reductions in the objective function value.We extensively tested our algorithm across eight benchmark problems and four real-world SLMOPs.The results demonstrate that our approach achieves competitive solutions across various challenges.

Discreet investors exert greater influence on cooperation in the public goods game

This paper studies the evolutionary process of cooperative behavior in a public goods game model with heterogeneous investment strategies in square lattices.In the proposed model,players are divided into defectors,cooperators and discreet investors.Among these,defectors do not participate in investing,discreet investors make heterogeneous investments based on the investment behavior and cooperation value of their neighbors,and cooperators invest equally in each neighbor.In real life,heterogeneous investment is often accompanied by time or economic costs.The discreet investors in this paper pay a certain price to obtain their neighbors'investment behavior and cooperation value,which quantifies the time and economic costs of the heterogeneous investment process.The results of Monte Carlo simulation experiments in this study show that discreet investors can effectively resist the invasion of the defectors,form a stable cooperative group and expand the cooperative advantage in evolution.However,when discreet investors pay too high a price,they lose their strategic advantage.The results in this paper help us understand the role of heterogeneous investment in promoting and maintaining human social cooperation.

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.