Path planning is a fundamental component in robotics and game artificial intelligence that considerably influences the motion efficiency of robots and unmanned aerial vehicles,as well as the realism and immersion of v...Path planning is a fundamental component in robotics and game artificial intelligence that considerably influences the motion efficiency of robots and unmanned aerial vehicles,as well as the realism and immersion of virtual environments.However,traditional algorithms are often limited to single-objective optimization and lack real-time adaptability to dynamic environments.This study addresses these limitations through a proposed realtime dynamic multiobjective(RDMO)path-planning algorithm based on an enhanced A^(*) framework.The proposed algorithm employs a queue-based structure and composite multiheuristic functions to dynamically manage game tasks and compute optimal paths under changing-map-connectivity conditions in real time.Simulation experiments are conducted using real-world road network data and benchmarked against mainstream hybrid approaches based on genetic algorithms(GAs)and simulated annealing(SA).The results show that the computational speed of the RDMO algorithm is 88 and 73 times faster than that of the GA-and SA-based solutions,respectively,while the total planned path length is reduced by 58%and 33%,respectively.In addition,the RDMO algorithm also shows excellent responsiveness to dynamic changes in map connectivity and can achieve real-time replanning with a minimal computational overhead.The research results prove that the RDMO algorithm provides a robust and efficient solution for multiobjective path planning in games and robotics applications and has a great application potential in improving system performance and user experience in related fields in the future.展开更多
Conventional pit excavation engineering methods often struggle to manage the complex deformation patterns associated with asymmetric excavations,resulting in significant safety risks and increased project costs.These ...Conventional pit excavation engineering methods often struggle to manage the complex deformation patterns associated with asymmetric excavations,resulting in significant safety risks and increased project costs.These challenges highlight the need for more precise and efficient design methodologies to ensure structural stability and economic feasibility.This research proposes an innovative automatic optimization inverse design method(AOIDM)that integrates an enhanced genetic algorithm(EGA)with a multiobjective optimization model.By combining advanced computational techniques with engineering principles,this approach improves search efficiency by 30%and enhances deformation control accuracy by 25%.Additionally,the approach exhibits potential for reducing carbon emissions to align with sustainable engineering goals.The effectiveness of this approach was validated through comprehensive data analysis and practical case studies,demonstrating its ability to optimize retaining structure designs under complex asymmetric loading conditions.This research establishes a new standard for precision and efficiency in automated excavation design,with accompanying improvements in safety and cost-effectiveness.Furthermore,it lays the foundation for future geotechnical engineering advancements,offering a robust solution to one of the most challenging aspects of modern excavation projects.展开更多
This paper deals with extensions of higher-order optimality conditions for scalar optimization to multiobjective optimization.A type of directional derivatives for a multiobjective function is proposed,and with this n...This paper deals with extensions of higher-order optimality conditions for scalar optimization to multiobjective optimization.A type of directional derivatives for a multiobjective function is proposed,and with this notion characterizations of strict local minima of order k for a multiobjective optimization problem with a nonempty set constraint are established,generalizing the corresponding scalar case obtained by Studniarski[3].Also necessary not sufficient and sufficient not necessary optimality conditions for this minima are derived based on our directional derivatives,which are generalizations of some existing scalar results and equivalent to some existing multiobjective ones.Many examples are given to illustrate them there.展开更多
To optimize the operating efficiency and extend the lifespan of the multistack fuel cell hybrid system(MFCHS),this paper proposes a two-layer multiobjective optimal energy management strategy that considers the degrad...To optimize the operating efficiency and extend the lifespan of the multistack fuel cell hybrid system(MFCHS),this paper proposes a two-layer multiobjective optimal energy management strategy that considers the degradation of the fuel cell and the battery.Regarding the issues that power fluctuations damage the fuel cells'lifespan and high-current charging and discharging lead to battery capacity decay,the first layer of the strategy adopts locally weighted scatterplot smoothing(LOWESS)to smooth the output power of the fuel cells and prevent the battery from operating under high-current conditions.The second layer considers the uneven degree of degradation among the fuel cells and employs the dandelion optimizer(DO)algorithm to solve the objective function with an aging adaptive factor,optimizing the efficiency and lifespan.Meanwhile,the DO algorithm is enhanced by tent chaotic mapping and differential variation to improve the convergence speed and accuracy.Compared with the equivalent hydrogen consumption minimization strategy(ECMS)and the equal distribution strategy,the proposed strategy improves the average operating efficiency of the fuel cells,effectively reduces the degradation of the fuel cells and the capacity degradation of the battery,and maintains the performance consistency among the fuel cells.展开更多
Regularization inversion uses constraints and a regularization factor to solve ill- posed inversion problems in geophysics. The choice of the regularization factor and of the initial model is critical in regularizatio...Regularization inversion uses constraints and a regularization factor to solve ill- posed inversion problems in geophysics. The choice of the regularization factor and of the initial model is critical in regularization inversion. To deal with these problems, we propose a multiobjective particle swarm inversion （MOPSOI） algorithm to simultaneously minimize the data misfit and model constraints, and obtain a multiobjective inversion solution set without the gradient information of the objective function and the regularization factor. We then choose the optimum solution from the solution set based on the trade-off between data misfit and constraints that substitute for the regularization factor. The inversion of synthetic two-dimensional magnetic data suggests that the MOPSOI algorithm can obtain as many feasible solutions as possible; thus, deeper insights of the inversion process can be gained and more reasonable solutions can be obtained by balancing the data misfit and constraints. The proposed MOPSOI algorithm can deal with the problems of choosing the right regularization factor and the initial model.展开更多
In order to meet the requirements of combustion optimization for saving energy and reducing pollutant emission simultaneously,an immune cell subsets based multiobjective optimization algorithm（ICSMOA）is proposed.In ...In order to meet the requirements of combustion optimization for saving energy and reducing pollutant emission simultaneously,an immune cell subsets based multiobjective optimization algorithm（ICSMOA）is proposed.In the ICSMOA,the subset division operator and the immunological tolerance operation are defined.Preference can be easily addressed by using the subset division operator,and the distribution of the solutions can be guaranteed by the immunological tolerance operation.Using the ICSMOA,a group of Pareto optimal solutions can be obtained.However,by the traditional weighting method（WM）,only one solution can be obtained and it cannot be judged as Pareto optimal or not.In contrast to the solutions obtained by the repeatedly performed WM,the simulation results show that most solutions obtained by the ICSMOA are better than the solutions obtained by the WM.In addition,the Pareto front obtained by the ICSMOA is not as uniform as most classical multiobjective optimization algorithms.More optimal solutions which meet the preference set by the decision-maker can be obtained and they are very useful for industrial application.展开更多
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, pit...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%.展开更多
In order to incorporate the decision maker＇s preference into multiobjective optimization a preference-based multiobjective artificial bee colony algorithm PMABCA is proposed.In the proposed algorithm a novel referenc...In order to incorporate the decision maker＇s preference into multiobjective optimization a preference-based multiobjective artificial bee colony algorithm PMABCA is proposed.In the proposed algorithm a novel reference point based preference expression method is addressed.The fitness assignment function is defined based on the nondominated rank and the newly defined preference distance.An archive set is introduced for saving the nondominated solutions and an improved crowding-distance operator is addressed to remove the extra solutions in the archive.The experimental results of two benchmark test functions show that a preferred set of solutions and some other non-preference solutions are achieved simultaneously.The simulation results of the proportional-integral-derivative PID parameter optimization for superheated steam temperature verify that the PMABCA is efficient in aiding to making a reasonable decision.展开更多
This paper developed a new method that adaptively adjusts a design space by considering the actual solution distribution of a problem to overcome the conventional design-space adaptation method that assumes the soluti...This paper developed a new method that adaptively adjusts a design space by considering the actual solution distribution of a problem to overcome the conventional design-space adaptation method that assumes the solutions distribution to be a normal distribution because the distributions of solutions are rarely normal distributions for real-world problems.The developed method was applied to nineteen multiobjective test functions that are widely used to evaluate the characteristics and performance of optimization approaches.The results showed that this method adapted the design space to an appropriate design space where the solution existence probability was high.The optimization performance achieved using the developed method was higher than that of the conventional methods.Furthermore,the developed method was applied to the conceptual design of an unmanned spacecraft to confirm its validity in real-world design and multidisciplinaryoptimization problems.The results showed that the Pareto solutions of the developed method were superior to those of conventional methods.Additionally,the optimization efficiency with the developed method was improved by more than 1.4 times over that of the conventional methods.In this regard,the developed method has the potential to be applied to complicated real-world optimization problems to achieve better performance and efficiency.展开更多
In this paper, a new approach for generating all or partly efficient solutions called the Combined Approach is developed. The property of efficient solutions generated by the combined approach and its relationships wi...In this paper, a new approach for generating all or partly efficient solutions called the Combined Approach is developed. The property of efficient solutions generated by the combined approach and its relationships with other four approaches: weighting approach, sequential approach, ε-constraint approach and hybrid approach, are discussed. Based on this combined approach, a decision-making support method called the Combined Decision-Making Method (CDMM) for multiobjective problems is developed, which is an interactive process with the decision maker. Only the aspiration levels, which reflect the decision maker's satisfying degrees for corresponding objectives, are needed to be supplied by the decision maker step by step as he will. This interactive way for objectives can easily be accepted. Finally, the application of the proposed decision making method in the resource allocation problem is discussed, and an example for the production decision analysis of the solar energy cells given.展开更多
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)....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.展开更多
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 obj...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.展开更多
In this papert the theory of major efficiency for multiobjective programmingis established.The major-efficient solutions and weakly major-efficient solutions of multiobjective programming given here are Pareto efficie...In this papert the theory of major efficiency for multiobjective programmingis established.The major-efficient solutions and weakly major-efficient solutions of multiobjective programming given here are Pareto efficient solutions of the same multiobjectiveprogramming problem, but the converse is not true. In a ceratin sense , these solutionsare in fact better than any other Pareto efficient solutions. Some basic theorems whichcharacterize major-efficient solutions and weakly major-efficient solutions of multiobjective programming are stated and proved. Furthermore,the existence and some geometricproperties of these solutions are studied.展开更多
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 ki...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.展开更多
The multitrip pickup and delivery problem with time windows and manpower planning(MTPDPTW-MP)determines a set of ambulance routes and finds staff assignment for a hospital. It involves different stakeholders with dive...The multitrip pickup and delivery problem with time windows and manpower planning(MTPDPTW-MP)determines a set of ambulance routes and finds staff assignment for a hospital. It involves different stakeholders with diverse interests and objectives. This study firstly introduces a multiobjective MTPDPTW-MP(MO-MTPDPTWMP) with three objectives to better describe the real-world scenario. A multiobjective iterated local search algorithm with adaptive neighborhood selection(MOILS-ANS) is proposed to solve the problem. MOILS-ANS can generate a diverse set of alternative solutions for decision makers to meet their requirements. To better explore the search space, problem-specific neighborhood structures and an adaptive neighborhood selection strategy are carefully designed in MOILS-ANS. Experimental results show that the proposed MOILS-ANS significantly outperforms the other two multiobjective algorithms. Besides, the nature of objective functions and the properties of the problem are analyzed. Finally, the proposed MOILS-ANS is compared with the previous single-objective algorithm and the benefits of multiobjective optimization are discussed.展开更多
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 mathe...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.展开更多
A class of quasi-equilibrium problems and a class of constrained multiobjective games were introduced and studied in generalized convex spaces without linear structure. First, two existence theorems of solutions for q...A class of quasi-equilibrium problems and a class of constrained multiobjective games were introduced and studied in generalized convex spaces without linear structure. First, two existence theorems of solutions for quasi-equilibrium problems are proved in noncompact generalized convex spaces. Then, ar applications of the quasi-equilibrium existence theorem, several existence theorems of weighted Nash-equilibria and Pareto equilibria for the constrained multiobjective games are established in noncompact generalized convex spaces. These theorems improve, unify, and generalize the corresponding results of the multiobjective games in recent literatures.展开更多
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...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.展开更多
Recently,multimodal multiobjective optimization problems(MMOPs)have received increasing attention.Their goal is to find a Pareto front and as many equivalent Pareto optimal solutions as possible.Although some evolutio...Recently,multimodal multiobjective optimization problems(MMOPs)have received increasing attention.Their goal is to find a Pareto front and as many equivalent Pareto optimal solutions as possible.Although some evolutionary algorithms for them have been proposed,they mainly focus on the convergence rate in the decision space while ignoring solutions diversity.In this paper,we propose a new multiobjective fireworks algorithm for them,which is able to balance exploitation and exploration in the decision space.We first extend a latest single-objective fireworks algorithm to handle MMOPs.Then we make improvements by incorporating an adaptive strategy and special archive guidance into it,where special archives are established for each firework,and two strategies(i.e.,explosion and random strategies)are adaptively selected to update the positions of sparks generated by fireworks with the guidance of special archives.Finally,we compare the proposed algorithm with eight state-of-the-art multimodal multiobjective algorithms on all 22 MMOPs from CEC2019 and several imbalanced distance minimization problems.Experimental results show that the proposed algorithm is superior to compared algorithms in solving them.Also,its runtime is less than its peers'.展开更多
Owing to the rapid development of microgrids(MGs)and growing applications of renewable energy resources,multiobjective optimal dispatch of MGs need to be studied in detail.In this study,a multiobjective optimal dispat...Owing to the rapid development of microgrids(MGs)and growing applications of renewable energy resources,multiobjective optimal dispatch of MGs need to be studied in detail.In this study,a multiobjective optimal dispatch model is developed for a standalone MG composed of wind turbines,photovoltaics,diesel engine unit,load,and battery energy storage system.The economic cost,environmental concerns,and power supply consistency are expressed via subobjectives with varying priorities.Then,the analytic hierarchy process algorithm is employed to reasonably specify the weight coefficients of the subobjectives.The quantum particle swarm optimization algorithm is thereafter employed as a solution to achieve optimal dispatch of the MG.Finally,the validity of the proposed model and solution methodology are con firmed by case studies.This study provides refere nee for mathematical model of multiojective optimizati on of MG and can be widely used in current research field.展开更多
基金supported by the National Research Foundation of Korea(NRF)grant funded by the Korea government(MSIT)(NRF-2023R1A2C1005950).
文摘Path planning is a fundamental component in robotics and game artificial intelligence that considerably influences the motion efficiency of robots and unmanned aerial vehicles,as well as the realism and immersion of virtual environments.However,traditional algorithms are often limited to single-objective optimization and lack real-time adaptability to dynamic environments.This study addresses these limitations through a proposed realtime dynamic multiobjective(RDMO)path-planning algorithm based on an enhanced A^(*) framework.The proposed algorithm employs a queue-based structure and composite multiheuristic functions to dynamically manage game tasks and compute optimal paths under changing-map-connectivity conditions in real time.Simulation experiments are conducted using real-world road network data and benchmarked against mainstream hybrid approaches based on genetic algorithms(GAs)and simulated annealing(SA).The results show that the computational speed of the RDMO algorithm is 88 and 73 times faster than that of the GA-and SA-based solutions,respectively,while the total planned path length is reduced by 58%and 33%,respectively.In addition,the RDMO algorithm also shows excellent responsiveness to dynamic changes in map connectivity and can achieve real-time replanning with a minimal computational overhead.The research results prove that the RDMO algorithm provides a robust and efficient solution for multiobjective path planning in games and robotics applications and has a great application potential in improving system performance and user experience in related fields in the future.
基金supported by the National Key R&D Program of China(Grant No.2023YFC3009400)the National Natural Science Foundation of China(Grant Nos.52238009 and 52208344).
文摘Conventional pit excavation engineering methods often struggle to manage the complex deformation patterns associated with asymmetric excavations,resulting in significant safety risks and increased project costs.These challenges highlight the need for more precise and efficient design methodologies to ensure structural stability and economic feasibility.This research proposes an innovative automatic optimization inverse design method(AOIDM)that integrates an enhanced genetic algorithm(EGA)with a multiobjective optimization model.By combining advanced computational techniques with engineering principles,this approach improves search efficiency by 30%and enhances deformation control accuracy by 25%.Additionally,the approach exhibits potential for reducing carbon emissions to align with sustainable engineering goals.The effectiveness of this approach was validated through comprehensive data analysis and practical case studies,demonstrating its ability to optimize retaining structure designs under complex asymmetric loading conditions.This research establishes a new standard for precision and efficiency in automated excavation design,with accompanying improvements in safety and cost-effectiveness.Furthermore,it lays the foundation for future geotechnical engineering advancements,offering a robust solution to one of the most challenging aspects of modern excavation projects.
文摘This paper deals with extensions of higher-order optimality conditions for scalar optimization to multiobjective optimization.A type of directional derivatives for a multiobjective function is proposed,and with this notion characterizations of strict local minima of order k for a multiobjective optimization problem with a nonempty set constraint are established,generalizing the corresponding scalar case obtained by Studniarski[3].Also necessary not sufficient and sufficient not necessary optimality conditions for this minima are derived based on our directional derivatives,which are generalizations of some existing scalar results and equivalent to some existing multiobjective ones.Many examples are given to illustrate them there.
基金supported by the Postgraduate Research and Practice Innovation Program of Jiangsu Province(Grant No.SJCX24_0161)the National Natural Science Foundation of China(Grant Nos.61374153 and 61403199).
文摘To optimize the operating efficiency and extend the lifespan of the multistack fuel cell hybrid system(MFCHS),this paper proposes a two-layer multiobjective optimal energy management strategy that considers the degradation of the fuel cell and the battery.Regarding the issues that power fluctuations damage the fuel cells'lifespan and high-current charging and discharging lead to battery capacity decay,the first layer of the strategy adopts locally weighted scatterplot smoothing(LOWESS)to smooth the output power of the fuel cells and prevent the battery from operating under high-current conditions.The second layer considers the uneven degree of degradation among the fuel cells and employs the dandelion optimizer(DO)algorithm to solve the objective function with an aging adaptive factor,optimizing the efficiency and lifespan.Meanwhile,the DO algorithm is enhanced by tent chaotic mapping and differential variation to improve the convergence speed and accuracy.Compared with the equivalent hydrogen consumption minimization strategy(ECMS)and the equal distribution strategy,the proposed strategy improves the average operating efficiency of the fuel cells,effectively reduces the degradation of the fuel cells and the capacity degradation of the battery,and maintains the performance consistency among the fuel cells.
基金supported by the Natural Science Foundation of China(No.61273179)Department of Education,Science and Technology Research Project of Hubei Province of China(No.D20131206,No.20141304)
文摘Regularization inversion uses constraints and a regularization factor to solve ill- posed inversion problems in geophysics. The choice of the regularization factor and of the initial model is critical in regularization inversion. To deal with these problems, we propose a multiobjective particle swarm inversion （MOPSOI） algorithm to simultaneously minimize the data misfit and model constraints, and obtain a multiobjective inversion solution set without the gradient information of the objective function and the regularization factor. We then choose the optimum solution from the solution set based on the trade-off between data misfit and constraints that substitute for the regularization factor. The inversion of synthetic two-dimensional magnetic data suggests that the MOPSOI algorithm can obtain as many feasible solutions as possible; thus, deeper insights of the inversion process can be gained and more reasonable solutions can be obtained by balancing the data misfit and constraints. The proposed MOPSOI algorithm can deal with the problems of choosing the right regularization factor and the initial model.
基金The National Natural Science Foundation of China(No.51036002,51076027)the Key Project of Ministry of Education of China(No.108060)
文摘In order to meet the requirements of combustion optimization for saving energy and reducing pollutant emission simultaneously,an immune cell subsets based multiobjective optimization algorithm（ICSMOA）is proposed.In the ICSMOA,the subset division operator and the immunological tolerance operation are defined.Preference can be easily addressed by using the subset division operator,and the distribution of the solutions can be guaranteed by the immunological tolerance operation.Using the ICSMOA,a group of Pareto optimal solutions can be obtained.However,by the traditional weighting method（WM）,only one solution can be obtained and it cannot be judged as Pareto optimal or not.In contrast to the solutions obtained by the repeatedly performed WM,the simulation results show that most solutions obtained by the ICSMOA are better than the solutions obtained by the WM.In addition,the Pareto front obtained by the ICSMOA is not as uniform as most classical multiobjective optimization algorithms.More optimal solutions which meet the preference set by the decision-maker can be obtained and they are very useful for industrial application.
基金Supported by Program for New Century Excellent Talents in University (070003)the Natural Science Foundation of Anhui Province (070414154)~~
文摘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%.
基金The National Natural Science Foundation of China(No.51306082,51476027)
文摘In order to incorporate the decision maker＇s preference into multiobjective optimization a preference-based multiobjective artificial bee colony algorithm PMABCA is proposed.In the proposed algorithm a novel reference point based preference expression method is addressed.The fitness assignment function is defined based on the nondominated rank and the newly defined preference distance.An archive set is introduced for saving the nondominated solutions and an improved crowding-distance operator is addressed to remove the extra solutions in the archive.The experimental results of two benchmark test functions show that a preferred set of solutions and some other non-preference solutions are achieved simultaneously.The simulation results of the proportional-integral-derivative PID parameter optimization for superheated steam temperature verify that the PMABCA is efficient in aiding to making a reasonable decision.
基金co-supported by the National Research Foundation of Korea(No.NRF-2021R1A2C2013363)grant funded by the Korea government(Ministry of Science and ICT,MSIT)the Convergence Security Core Talent Training Business Support Program(No.IITP-2023-RS-2023-00266615)supervised by the IITP(Institute for Information&Communications Technology Planning&Evaluation)funded by the MSIT(Ministry of Science and ICT),Korea.
文摘This paper developed a new method that adaptively adjusts a design space by considering the actual solution distribution of a problem to overcome the conventional design-space adaptation method that assumes the solutions distribution to be a normal distribution because the distributions of solutions are rarely normal distributions for real-world problems.The developed method was applied to nineteen multiobjective test functions that are widely used to evaluate the characteristics and performance of optimization approaches.The results showed that this method adapted the design space to an appropriate design space where the solution existence probability was high.The optimization performance achieved using the developed method was higher than that of the conventional methods.Furthermore,the developed method was applied to the conceptual design of an unmanned spacecraft to confirm its validity in real-world design and multidisciplinaryoptimization problems.The results showed that the Pareto solutions of the developed method were superior to those of conventional methods.Additionally,the optimization efficiency with the developed method was improved by more than 1.4 times over that of the conventional methods.In this regard,the developed method has the potential to be applied to complicated real-world optimization problems to achieve better performance and efficiency.
文摘In this paper, a new approach for generating all or partly efficient solutions called the Combined Approach is developed. The property of efficient solutions generated by the combined approach and its relationships with other four approaches: weighting approach, sequential approach, ε-constraint approach and hybrid approach, are discussed. Based on this combined approach, a decision-making support method called the Combined Decision-Making Method (CDMM) for multiobjective problems is developed, which is an interactive process with the decision maker. Only the aspiration levels, which reflect the decision maker's satisfying degrees for corresponding objectives, are needed to be supplied by the decision maker step by step as he will. This interactive way for objectives can easily be accepted. Finally, the application of the proposed decision making method in the resource allocation problem is discussed, and an example for the production decision analysis of the solar energy cells given.
文摘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.
基金Supported by the National Natural Science Foundation of China （No.60421002）
文摘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.
文摘In this papert the theory of major efficiency for multiobjective programmingis established.The major-efficient solutions and weakly major-efficient solutions of multiobjective programming given here are Pareto efficient solutions of the same multiobjectiveprogramming problem, but the converse is not true. In a ceratin sense , these solutionsare in fact better than any other Pareto efficient solutions. Some basic theorems whichcharacterize major-efficient solutions and weakly major-efficient solutions of multiobjective programming are stated and proved. Furthermore,the existence and some geometricproperties of these solutions are studied.
基金Supported by the National Natural Science Foundation of China (No.60421002).
文摘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.
基金supported by the National Key R&D Program of China(2018AAA0101203)the National Natural Science Foundation of China(61673403,71601191)the JSPS KAKENHI(JP17K12751)。
文摘The multitrip pickup and delivery problem with time windows and manpower planning(MTPDPTW-MP)determines a set of ambulance routes and finds staff assignment for a hospital. It involves different stakeholders with diverse interests and objectives. This study firstly introduces a multiobjective MTPDPTW-MP(MO-MTPDPTWMP) with three objectives to better describe the real-world scenario. A multiobjective iterated local search algorithm with adaptive neighborhood selection(MOILS-ANS) is proposed to solve the problem. MOILS-ANS can generate a diverse set of alternative solutions for decision makers to meet their requirements. To better explore the search space, problem-specific neighborhood structures and an adaptive neighborhood selection strategy are carefully designed in MOILS-ANS. Experimental results show that the proposed MOILS-ANS significantly outperforms the other two multiobjective algorithms. Besides, the nature of objective functions and the properties of the problem are analyzed. Finally, the proposed MOILS-ANS is compared with the previous single-objective algorithm and the benefits of multiobjective optimization are discussed.
文摘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.
文摘A class of quasi-equilibrium problems and a class of constrained multiobjective games were introduced and studied in generalized convex spaces without linear structure. First, two existence theorems of solutions for quasi-equilibrium problems are proved in noncompact generalized convex spaces. Then, ar applications of the quasi-equilibrium existence theorem, several existence theorems of weighted Nash-equilibria and Pareto equilibria for the constrained multiobjective games are established in noncompact generalized convex spaces. These theorems improve, unify, and generalize the corresponding results of the multiobjective games in recent literatures.
文摘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.
基金supported in part by the National Natural Science Foundation of China(62071230,62061146002)the Natural Science Foundation of Jiangsu Province(BK20211567)the Deanship of Scientific Research(DSR)at King Abdulaziz University(KAU),Jeddah,Saudi Arabia(FP-147-43)。
文摘Recently,multimodal multiobjective optimization problems(MMOPs)have received increasing attention.Their goal is to find a Pareto front and as many equivalent Pareto optimal solutions as possible.Although some evolutionary algorithms for them have been proposed,they mainly focus on the convergence rate in the decision space while ignoring solutions diversity.In this paper,we propose a new multiobjective fireworks algorithm for them,which is able to balance exploitation and exploration in the decision space.We first extend a latest single-objective fireworks algorithm to handle MMOPs.Then we make improvements by incorporating an adaptive strategy and special archive guidance into it,where special archives are established for each firework,and two strategies(i.e.,explosion and random strategies)are adaptively selected to update the positions of sparks generated by fireworks with the guidance of special archives.Finally,we compare the proposed algorithm with eight state-of-the-art multimodal multiobjective algorithms on all 22 MMOPs from CEC2019 and several imbalanced distance minimization problems.Experimental results show that the proposed algorithm is superior to compared algorithms in solving them.Also,its runtime is less than its peers'.
基金State Grid Corporation Science and Technology Project(520605190010).
文摘Owing to the rapid development of microgrids(MGs)and growing applications of renewable energy resources,multiobjective optimal dispatch of MGs need to be studied in detail.In this study,a multiobjective optimal dispatch model is developed for a standalone MG composed of wind turbines,photovoltaics,diesel engine unit,load,and battery energy storage system.The economic cost,environmental concerns,and power supply consistency are expressed via subobjectives with varying priorities.Then,the analytic hierarchy process algorithm is employed to reasonably specify the weight coefficients of the subobjectives.The quantum particle swarm optimization algorithm is thereafter employed as a solution to achieve optimal dispatch of the MG.Finally,the validity of the proposed model and solution methodology are con firmed by case studies.This study provides refere nee for mathematical model of multiojective optimizati on of MG and can be widely used in current research field.
