Integrated building design is inherently a multi-objective optimization problem where two or more conflicting objectives must be minimized and/or maximized concurrently.Many multi-objective optimization algorithms hav...Integrated building design is inherently a multi-objective optimization problem where two or more conflicting objectives must be minimized and/or maximized concurrently.Many multi-objective optimization algorithms have been developed;however few of them are tested in solving building design problems.This paper compares performance of seven commonly-used multi-objective evolutionary optimization algorithms in solving the design problem of a nearly zero energy building(n ZEB) where more than 1.610 solutions would be possible.The compared algorithms include a controlled non-dominated sorting genetic algorithm witha passive archive(p NSGA-II),a multi-objective particle swarm optimization(MOPSO),a two-phase optimization using the genetic algorithm(PR_GA),an elitist non-dominated sorting evolution strategy(ENSES),a multi-objective evolutionary algorithm based on the concept of epsilon dominance(ev MOGA),a multi-objective differential evolution algorithm(sp MODE-II),and a multi-objective dragonfly algorithm(MODA).Several criteria was used to compare performance of these algorithms.In most cases,the quality of the obtained solutions was improved when the number of generations was increased.The optimization results of running each algorithm20 times with gradually increasing number of evaluations indicated that the PR_GA algorithm had a high repeatability to explore a large area of the solution-space and achieved close-to-optimal solutions with a good diversity,followed by the p NSGA-II,ev MOGA and sp MODE-II.Uncompetitive results were achieved by the ENSES,MOPSO and MODA in most running cases.The study also found that 1400-1800 were minimum required number of evaluations to stabilize optimization results of the building energy model.展开更多
Rapid urbanization in China has led to spatial antagonism between urban development and farmland protection and ecological security maintenance.Multi-objective spatial collaborative optimization is a powerful method f...Rapid urbanization in China has led to spatial antagonism between urban development and farmland protection and ecological security maintenance.Multi-objective spatial collaborative optimization is a powerful method for achieving sustainable regional development.Previous studies on multi-objective spatial optimization do not involve spatial corrections to simulation results based on the natural endowment of space resources.This study proposes an Ecological Security-Food Security-Urban Sustainable Development(ES-FS-USD)spatial optimization framework.This framework combines the non-dominated sorting genetic algorithm II(NSGA-II)and patch-generating land use simulation(PLUS)model with an ecological protection importance evaluation,comprehensive agricultural productivity evaluation,and urban sustainable development potential assessment and optimizes the territorial space in the Yangtze River Delta(YRD)region in 2035.The proposed sustainable development(SD)scenario can effectively reduce the destruction of landscape patterns of various land-use types while considering both ecological and economic benefits.The simulation results were further revised by evaluating the land-use suitability of the YRD region.According to the revised spatial pattern for the YRD in 2035,the farmland area accounts for 43.59%of the total YRD,which is 5.35%less than that in 2010.Forest,grassland,and water area account for 40.46%of the total YRD—an increase of 1.42%compared with the case in 2010.Construction land accounts for 14.72%of the total YRD—an increase of 2.77%compared with the case in 2010.The ES-FS-USD spatial optimization framework ensures that spatial optimization outcomes are aligned with the natural endowments of land resources,thereby promoting the sustainable use of land resources,improving the ability of spatial management,and providing valuable insights for decision makers.展开更多
The multi-objective particle swarm optimization algorithm(MOPSO)is widely used to solve multi-objective optimization problems.In the article,amulti-objective particle swarm optimization algorithmbased on decomposition...The multi-objective particle swarm optimization algorithm(MOPSO)is widely used to solve multi-objective optimization problems.In the article,amulti-objective particle swarm optimization algorithmbased on decomposition and multi-selection strategy is proposed to improve the search efficiency.First,two update strategies based on decomposition are used to update the evolving population and external archive,respectively.Second,a multiselection strategy is designed.The first strategy is for the subspace without a non-dominated solution.Among the neighbor particles,the particle with the smallest penalty-based boundary intersection value is selected as the global optimal solution and the particle far away fromthe search particle and the global optimal solution is selected as the personal optimal solution to enhance global search.The second strategy is for the subspace with a non-dominated solution.In the neighbor particles,two particles are randomly selected,one as the global optimal solution and the other as the personal optimal solution,to enhance local search.The third strategy is for Pareto optimal front(PF)discontinuity,which is identified by the cumulative number of iterations of the subspace without non-dominated solutions.In the subsequent iteration,a new probability distribution is used to select from the remaining subspaces to search.Third,an adaptive inertia weight update strategy based on the dominated degree is designed to further improve the search efficiency.Finally,the proposed algorithmis compared with fivemulti-objective particle swarm optimization algorithms and five multi-objective evolutionary algorithms on 22 test problems.The results show that the proposed algorithm has better performance.展开更多
Accurate determination of rock mass parameters is essential for ensuring the accuracy of numericalsimulations. Displacement back-analysis is the most widely used method;however, the reliability of thecurrent approache...Accurate determination of rock mass parameters is essential for ensuring the accuracy of numericalsimulations. Displacement back-analysis is the most widely used method;however, the reliability of thecurrent approaches remains unsatisfactory. Therefore, in this paper, a multistage rock mass parameterback-analysis method, that considers the construction process and displacement losses is proposed andimplemented through the coupling of numerical simulation, auto-machine learning (AutoML), andmulti-objective optimization algorithms (MOOAs). First, a parametric modeling platform for mechanizedtwin tunnels is developed, generating a dataset through extensive numerical simulations. Next, theAutoML method is utilized to establish a surrogate model linking rock parameters and displacements.The tunnel construction process is divided into multiple stages, transforming the rock mass parameterback-analysis into a multi-objective optimization problem, for which multi-objective optimization algorithmsare introduced to obtain the rock mass parameters. The newly proposed rock mass parameterback-analysis method is validated in a mechanized twin tunnel project, and its accuracy and effectivenessare demonstrated. Compared with traditional single-stage back-analysis methods, the proposedmodel decreases the average absolute percentage error from 12.73% to 4.34%, significantly improving theaccuracy of the back-analysis. Moreover, although the accuracy of back analysis significantly increaseswith the number of construction stages considered, the back analysis time is acceptable. This studyprovides a new method for displacement back analysis that is efficient and accurate, thereby paving theway for precise parameter determination in numerical simulations.展开更多
Cloud computing has become an essential technology for the management and processing of large datasets,offering scalability,high availability,and fault tolerance.However,optimizing data replication across multiple dat...Cloud computing has become an essential technology for the management and processing of large datasets,offering scalability,high availability,and fault tolerance.However,optimizing data replication across multiple data centers poses a significant challenge,especially when balancing opposing goals such as latency,storage costs,energy consumption,and network efficiency.This study introduces a novel Dynamic Optimization Algorithm called Dynamic Multi-Objective Gannet Optimization(DMGO),designed to enhance data replication efficiency in cloud environments.Unlike traditional static replication systems,DMGO adapts dynamically to variations in network conditions,system demand,and resource availability.The approach utilizes multi-objective optimization approaches to efficiently balance data access latency,storage efficiency,and operational costs.DMGO consistently evaluates data center performance and adjusts replication algorithms in real time to guarantee optimal system efficiency.Experimental evaluations conducted in a simulated cloud environment demonstrate that DMGO significantly outperforms conventional static algorithms,achieving faster data access,lower storage overhead,reduced energy consumption,and improved scalability.The proposed methodology offers a robust and adaptable solution for modern cloud systems,ensuring efficient resource consumption while maintaining high performance.展开更多
This paper introduces a hybrid multi-objective optimization algorithm,designated HMODESFO,which amalgamates the exploratory prowess of Differential Evolution(DE)with the rapid convergence attributes of the Sailfish Op...This paper introduces a hybrid multi-objective optimization algorithm,designated HMODESFO,which amalgamates the exploratory prowess of Differential Evolution(DE)with the rapid convergence attributes of the Sailfish Optimization(SFO)algorithm.The primary objective is to address multi-objective optimization challenges within mechanical engineering,with a specific emphasis on planetary gearbox optimization.The algorithm is equipped with the ability to dynamically select the optimal mutation operator,contingent upon an adaptive normalized population spacing parameter.The efficacy of HMODESFO has been substantiated through rigorous validation against estab-lished industry benchmarks,including a suite of Zitzler-Deb-Thiele(ZDT)and Zeb-Thiele-Laumanns-Zitzler(DTLZ)problems,where it exhibited superior performance.The outcomes underscore the algorithm’s markedly enhanced optimization capabilities relative to existing methods,particularly in tackling highly intricate multi-objective planetary gearbox optimization problems.Additionally,the performance of HMODESFO is evaluated against selected well-known mechanical engineering test problems,further accentuating its adeptness in resolving complex optimization challenges within this domain.展开更多
Multi-objective optimization is critical for problem-solving in engineering,economics,and AI.This study introduces the Multi-Objective Chef-Based Optimization Algorithm(MOCBOA),an upgraded version of the Chef-Based Op...Multi-objective optimization is critical for problem-solving in engineering,economics,and AI.This study introduces the Multi-Objective Chef-Based Optimization Algorithm(MOCBOA),an upgraded version of the Chef-Based Optimization Algorithm(CBOA)that addresses distinct objectives.Our approach is unique in systematically examining four dominance relations—Pareto,Epsilon,Cone-epsilon,and Strengthened dominance—to evaluate their influence on sustaining solution variety and driving convergence toward the Pareto front.Our comparison investigation,which was conducted on fifty test problems from the CEC 2021 benchmark and applied to areas such as chemical engineering,mechanical design,and power systems,reveals that the dominance approach used has a considerable impact on the key optimization measures such as the hypervolume metric.This paper provides a solid foundation for determining themost effective dominance approach and significant insights for both theoretical research and practical applications in multi-objective optimization.展开更多
Impinging jet arrays are extensively used in numerous industrial operations,including the cooling of electronics,turbine blades,and other high-heat flux systems because of their superior heat transfer capabilities.Opt...Impinging jet arrays are extensively used in numerous industrial operations,including the cooling of electronics,turbine blades,and other high-heat flux systems because of their superior heat transfer capabilities.Optimizing the design and operating parameters of such systems is essential to enhance cooling efficiency and achieve uniform pressure distribution,which can lead to improved system performance and energy savings.This paper presents two multi-objective optimization methodologies for a turbulent air jet impingement cooling system.The governing equations are resolved employing the commercial computational fluid dynamics(CFD)software ANSYS Fluent v17.The study focuses on four controlling parameters:Reynolds number(Re),swirl number(S),jet-to-jet separation distance(Z/D),and impingement height(H/D).The effects of these parameters on heat transfer and impingement pressure distribution are investigated.Non-dominated Sorting Genetic Algorithm(NSGA-II)and Weighted Sum Method(WSM)are employed to optimize the controlling parameters for maximum cooling performance.The aim is to identify optimal design parameters and system configurations that enhance heat transfer efficiency while achieving a uniform impingement pressure distribution.These findings have practical implications for applications requiring efficient cooling.The optimized design achieved a 12.28%increase in convective heat transfer efficiency with a local Nusselt number of 113.05 compared to 100.69 in the reference design.Enhanced convective cooling and heat flux were observed in the optimized configuration,particularly in areas of direct jet impingement.Additionally,the optimized design maintained lower wall temperatures,demonstrating more effective thermal dissipation.展开更多
This work addresses the cut order planning(COP)problem for multi-color garment production,which is the first step in the clothing industry.First,a multi-objective optimization model of multicolor COP(MCOP)is establish...This work addresses the cut order planning(COP)problem for multi-color garment production,which is the first step in the clothing industry.First,a multi-objective optimization model of multicolor COP(MCOP)is established with production error and production cost as optimization objectives,combined with constraints such as the number of equipment and the number of layers.Second,a decoupled multi-objective optimization algorithm(DMOA)is proposed based on the linear programming decoupling strategy and non-dominated sorting in genetic algorithmsⅡ(NSGAII).The size-combination matrix and the fabric-layer matrix are decoupled to improve the accuracy of the algorithm.Meanwhile,an improved NSGAII algorithm is designed to obtain the optimal Pareto solution to the MCOP problem,thereby constructing a practical intelligent production optimization algorithm.Finally,the effectiveness and superiority of the proposed DMOA are verified through practical cases and comparative experiments,which can effectively optimize the production process for garment enterprises.展开更多
Hydrocracking is one of the most important petroleum refining processes that converts heavy oils into gases,naphtha,diesel,and other products through cracking reactions.Multi-objective optimization algorithms can help...Hydrocracking is one of the most important petroleum refining processes that converts heavy oils into gases,naphtha,diesel,and other products through cracking reactions.Multi-objective optimization algorithms can help refining enterprises determine the optimal operating parameters to maximize product quality while ensuring product yield,or to increase product yield while reducing energy consumption.This paper presents a multi-objective optimization scheme for hydrocracking based on an improved SPEA2-PE algorithm,which combines path evolution operator and adaptive step strategy to accelerate the convergence speed and improve the computational accuracy of the algorithm.The reactor model used in this article is simulated based on a twenty-five lumped kinetic model.Through model and test function verification,the proposed optimization scheme exhibits significant advantages in the multiobjective optimization process of hydrocracking.展开更多
Addressing the complex issue of emergency resource distribution center site selection in uncertain environments, this study was conducted to comprehensively consider factors such as uncertainty parameters and the urge...Addressing the complex issue of emergency resource distribution center site selection in uncertain environments, this study was conducted to comprehensively consider factors such as uncertainty parameters and the urgency of demand at disaster-affected sites. Firstly, urgency cost, economic cost, and transportation distance cost were identified as key objectives. The study applied fuzzy theory integration to construct a triangular fuzzy multi-objective site selection decision model. Next, the defuzzification theory transformed the fuzzy decision model into a precise one. Subsequently, an improved Chaotic Quantum Multi-Objective Harris Hawks Optimization (CQ-MOHHO) algorithm was proposed to solve the model. The CQ-MOHHO algorithm was shown to rapidly produce high-quality Pareto front solutions and identify optimal site selection schemes for emergency resource distribution centers through case studies. This outcome verified the feasibility and efficacy of the site selection decision model and the CQ-MOHHO algorithm. To further assess CQ-MOHHO’s performance, Zitzler-Deb-Thiele (ZDT) test functions, commonly used in multi-objective optimization, were employed. Comparisons with Multi-Objective Harris Hawks Optimization (MOHHO), Non-dominated Sorting Genetic Algorithm II (NSGA-II), and Multi-Objective Grey Wolf Optimizer (MOGWO) using Generational Distance (GD), Hypervolume (HV), and Inverted Generational Distance (IGD) metrics showed that CQ-MOHHO achieved superior global search ability, faster convergence, and higher solution quality. The CQ-MOHHO algorithm efficiently achieved a balance between multiple objectives, providing decision-makers with satisfactory solutions and a valuable reference for researching and applying emergency site selection problems.展开更多
The optimization of turbine blades is crucial in improving the efficiency of wind energy systems and developing clean energy production models.This paper presented a novel approach to the structural design of smallsca...The optimization of turbine blades is crucial in improving the efficiency of wind energy systems and developing clean energy production models.This paper presented a novel approach to the structural design of smallscale turbine blades using the Artificial Bee Colony(ABC)Algorithm based on the stochastic method to optimize both mass and cost(objective functions).The study used computational fluid dynamics(CFD)and structural analysis to consider the fluid-structure interaction.The optimization algorithm defined several variables:structural constraints,the type of composite material,and the number of composite layers to form a mathematical model.The numerical modeling was performed using the Ansys Fluent software and its Fluid-Structure Interaction(FSI)module.The ANSYS Composite PrePost(ACP)advanced composite modeling method was utilized in the structural design of composite materials.This study showed that the structurally optimized small-scale turbine blades provided a sustainable solution with improved efficiency compared to traditional designs.Furthermore,using CFD,structural analysis,and material characterization techniques first considered in this study highlights the importance of considering structural behavior when optimizing turbine blade designs.展开更多
Evolutionary algorithms have been shown to be very successful in solving multi-objective optimization problems(MOPs).However,their performance often deteriorates when solving MOPs with irregular Pareto fronts.To remed...Evolutionary algorithms have been shown to be very successful in solving multi-objective optimization problems(MOPs).However,their performance often deteriorates when solving MOPs with irregular Pareto fronts.To remedy this issue,a large body of research has been performed in recent years and many new algorithms have been proposed.This paper provides a comprehensive survey of the research on MOPs with irregular Pareto fronts.We start with a brief introduction to the basic concepts,followed by a summary of the benchmark test problems with irregular problems,an analysis of the causes of the irregularity,and real-world optimization problems with irregular Pareto fronts.Then,a taxonomy of the existing methodologies for handling irregular problems is given and representative algorithms are reviewed with a discussion of their strengths and weaknesses.Finally,open challenges are pointed out and a few promising future directions are suggested.展开更多
In this paper, a multi-objective particle swarm optimization （MOPSO） algorithm and a nondominated sorting genetic algorithm II （NSGA-II） are used to optimize the operating parameters of a 1.6 L, spark ignition （S...In this paper, a multi-objective particle swarm optimization （MOPSO） algorithm and a nondominated sorting genetic algorithm II （NSGA-II） are used to optimize the operating parameters of a 1.6 L, spark ignition （SI） gasoline engine. The aim of this optimization is to reduce engine emissions in terms of carbon monoxide （CO）, hydrocarbons （HC）, and nitrogen oxides （NOx）, which are the causes of diverse environmental problems such as air pollution and global warming. Stationary engine tests were performed for data generation, covering 60 operating conditions. Artificial neural networks （ANNs） were used to predict exhaust emissions, whose inputs were from six engine operating parameters, and the outputs were three resulting exhaust emissions. The outputs of ANNs were used to evaluate objective functions within the optimization algorithms： NSGA-II and MOPSO. Then a decision-making process was conducted, using a fuzzy method to select a Pareto solution with which the best emission reductions can be achieved. The NSGA-II algorithm achieved reductions of at least 9.84%, 82.44%, and 13.78% for CO, HC, and NOx, respectively. With a MOPSO algorithm the reached reductions were at least 13.68%, 83.80%, and 7.67% for CO, HC, and NOx, respectively.展开更多
Large-scale multi-objective optimization problems(LSMOPs)pose challenges to existing optimizers since a set of well-converged and diverse solutions should be found in huge search spaces.While evolutionary algorithms a...Large-scale multi-objective optimization problems(LSMOPs)pose challenges to existing optimizers since a set of well-converged and diverse solutions should be found in huge search spaces.While evolutionary algorithms are good at solving small-scale multi-objective optimization problems,they are criticized for low efficiency in converging to the optimums of LSMOPs.By contrast,mathematical programming methods offer fast convergence speed on large-scale single-objective optimization problems,but they have difficulties in finding diverse solutions for LSMOPs.Currently,how to integrate evolutionary algorithms with mathematical programming methods to solve LSMOPs remains unexplored.In this paper,a hybrid algorithm is tailored for LSMOPs by coupling differential evolution and a conjugate gradient method.On the one hand,conjugate gradients and differential evolution are used to update different decision variables of a set of solutions,where the former drives the solutions to quickly converge towards the Pareto front and the latter promotes the diversity of the solutions to cover the whole Pareto front.On the other hand,objective decomposition strategy of evolutionary multi-objective optimization is used to differentiate the conjugate gradients of solutions,and the line search strategy of mathematical programming is used to ensure the higher quality of each offspring than its parent.In comparison with state-of-the-art evolutionary algorithms,mathematical programming methods,and hybrid algorithms,the proposed algorithm exhibits better convergence and diversity performance on a variety of benchmark and real-world LSMOPs.展开更多
Aiming to solve the steering instability and hysteresis of agricultural robots in the process of movement,a fusion PID control method of particle swarm optimization(PSO)and genetic algorithm(GA)was proposed.The fusion...Aiming to solve the steering instability and hysteresis of agricultural robots in the process of movement,a fusion PID control method of particle swarm optimization(PSO)and genetic algorithm(GA)was proposed.The fusion algorithm took advantage of the fast optimization ability of PSO to optimize the population screening link of GA.The Simulink simulation results showed that the convergence of the fitness function of the fusion algorithm was accelerated,the system response adjustment time was reduced,and the overshoot was almost zero.Then the algorithm was applied to the steering test of agricultural robot in various scenes.After modeling the steering system of agricultural robot,the steering test results in the unloaded suspended state showed that the PID control based on fusion algorithm reduced the rise time,response adjustment time and overshoot of the system,and improved the response speed and stability of the system,compared with the artificial trial and error PID control and the PID control based on GA.The actual road steering test results showed that the PID control response rise time based on the fusion algorithm was the shortest,about 4.43 s.When the target pulse number was set to 100,the actual mean value in the steady-state regulation stage was about 102.9,which was the closest to the target value among the three control methods,and the overshoot was reduced at the same time.The steering test results under various scene states showed that the PID control based on the proposed fusion algorithm had good anti-interference ability,it can adapt to the changes of environment and load and improve the performance of the control system.It was effective in the steering control of agricultural robot.This method can provide a reference for the precise steering control of other robots.展开更多
A scheduling model of closely spaced parallel runways for arrival aircraft was proposed,with multi-objections of the minimum flight delay cost,the maximum airport capacity,the minimum workload of air traffic controlle...A scheduling model of closely spaced parallel runways for arrival aircraft was proposed,with multi-objections of the minimum flight delay cost,the maximum airport capacity,the minimum workload of air traffic controller and the maximum fairness of airlines′scheduling.The time interval between two runways and changes of aircraft landing order were taken as the constraints.Genetic algorithm was used to solve the model,and the model constrained unit delay cost of the aircraft with multiple flight tasks to reduce its delay influence range.Each objective function value or the fitness of particle unsatisfied the constrain condition would be punished.Finally,one domestic airport hub was introduced to verify the algorithm and the model.The results showed that the genetic algorithm presented strong convergence and timeliness for solving constraint multi-objective aircraft landing problem on closely spaced parallel runways,and the optimization results were better than that of actual scheduling.展开更多
For dealing with the multi-objective optimization problems of parametric design for aircraft, a novel hybrid parallel multi-objective tabu search （HPMOTS） algorithm is used. First, a new multi-objective tabu search ...For dealing with the multi-objective optimization problems of parametric design for aircraft, a novel hybrid parallel multi-objective tabu search （HPMOTS） algorithm is used. First, a new multi-objective tabu search （MOTS） algorithm is proposed. Comparing with the traditional MOTS algorithm, this proposed algorithm adds some new methods such as the combination of MOTS algorithm and ＂Pareto solution＂, the strategy of ＂searching from many directions＂ and the reservation of good solutions. Second, this article also proposes the improved parallel multi-objective tabu search （PMOTS） algorithm. Finally, a new hybrid algorithm--HPMOTS algorithm which combines the PMOTS algorithm with the non-dominated sorting-based multi-objective genetic algorithm （NSGA） is presented. The computing results of these algorithms are compared with each other and it is shown that the optimal result can be obtained by the HPMOTS algorithm and the computing result of the PMOTS algorithm is better than that of MOTS algorithm.展开更多
This study delineates the development of the optimization framework for the preliminary design phase of Floating Offshore Wind Turbines(FOWTs),and the central challenge addressed is the optimization of the FOWT platfo...This study delineates the development of the optimization framework for the preliminary design phase of Floating Offshore Wind Turbines(FOWTs),and the central challenge addressed is the optimization of the FOWT platform dimensional parameters in relation to motion responses.Although the three-dimensional potential flow(TDPF)panel method is recognized for its precision in calculating FOWT motion responses,its computational intensity necessitates an alternative approach for efficiency.Herein,a novel application of varying fidelity frequency-domain computational strategies is introduced,which synthesizes the strip theory with the TDPF panel method to strike a balance between computational speed and accuracy.The Co-Kriging algorithm is employed to forge a surrogate model that amalgamates these computational strategies.Optimization objectives are centered on the platform’s motion response in heave and pitch directions under general sea conditions.The steel usage,the range of design variables,and geometric considerations are optimization constraints.The angle of the pontoons,the number of columns,the radius of the central column and the parameters of the mooring lines are optimization constants.This informed the structuring of a multi-objective optimization model utilizing the Non-dominated Sorting Genetic Algorithm Ⅱ(NSGA-Ⅱ)algorithm.For the case of the IEA UMaine VolturnUS-S Reference Platform,Pareto fronts are discerned based on the above framework and delineate the relationship between competing motion response objectives.The efficacy of final designs is substantiated through the time-domain calculation model,which ensures that the motion responses in extreme sea conditions are superior to those of the initial design.展开更多
Vehicle Edge Computing(VEC)and Cloud Computing(CC)significantly enhance the processing efficiency of delay-sensitive and computation-intensive applications by offloading compute-intensive tasks from resource-constrain...Vehicle Edge Computing(VEC)and Cloud Computing(CC)significantly enhance the processing efficiency of delay-sensitive and computation-intensive applications by offloading compute-intensive tasks from resource-constrained onboard devices to nearby Roadside Unit(RSU),thereby achieving lower delay and energy consumption.However,due to the limited storage capacity and energy budget of RSUs,it is challenging to meet the demands of the highly dynamic Internet of Vehicles(IoV)environment.Therefore,determining reasonable service caching and computation offloading strategies is crucial.To address this,this paper proposes a joint service caching scheme for cloud-edge collaborative IoV computation offloading.By modeling the dynamic optimization problem using Markov Decision Processes(MDP),the scheme jointly optimizes task delay,energy consumption,load balancing,and privacy entropy to achieve better quality of service.Additionally,a dynamic adaptive multi-objective deep reinforcement learning algorithm is proposed.Each Double Deep Q-Network(DDQN)agent obtains rewards for different objectives based on distinct reward functions and dynamically updates the objective weights by learning the value changes between objectives using Radial Basis Function Networks(RBFN),thereby efficiently approximating the Pareto-optimal decisions for multiple objectives.Extensive experiments demonstrate that the proposed algorithm can better coordinate the three-tier computing resources of cloud,edge,and vehicles.Compared to existing algorithms,the proposed method reduces task delay and energy consumption by 10.64%and 5.1%,respectively.展开更多
文摘Integrated building design is inherently a multi-objective optimization problem where two or more conflicting objectives must be minimized and/or maximized concurrently.Many multi-objective optimization algorithms have been developed;however few of them are tested in solving building design problems.This paper compares performance of seven commonly-used multi-objective evolutionary optimization algorithms in solving the design problem of a nearly zero energy building(n ZEB) where more than 1.610 solutions would be possible.The compared algorithms include a controlled non-dominated sorting genetic algorithm witha passive archive(p NSGA-II),a multi-objective particle swarm optimization(MOPSO),a two-phase optimization using the genetic algorithm(PR_GA),an elitist non-dominated sorting evolution strategy(ENSES),a multi-objective evolutionary algorithm based on the concept of epsilon dominance(ev MOGA),a multi-objective differential evolution algorithm(sp MODE-II),and a multi-objective dragonfly algorithm(MODA).Several criteria was used to compare performance of these algorithms.In most cases,the quality of the obtained solutions was improved when the number of generations was increased.The optimization results of running each algorithm20 times with gradually increasing number of evaluations indicated that the PR_GA algorithm had a high repeatability to explore a large area of the solution-space and achieved close-to-optimal solutions with a good diversity,followed by the p NSGA-II,ev MOGA and sp MODE-II.Uncompetitive results were achieved by the ENSES,MOPSO and MODA in most running cases.The study also found that 1400-1800 were minimum required number of evaluations to stabilize optimization results of the building energy model.
基金National Natural Science Foundation of China,No.42301470,No.52270185,No.42171389Capacity Building Program of Local Colleges and Universities in Shanghai,No.21010503300。
文摘Rapid urbanization in China has led to spatial antagonism between urban development and farmland protection and ecological security maintenance.Multi-objective spatial collaborative optimization is a powerful method for achieving sustainable regional development.Previous studies on multi-objective spatial optimization do not involve spatial corrections to simulation results based on the natural endowment of space resources.This study proposes an Ecological Security-Food Security-Urban Sustainable Development(ES-FS-USD)spatial optimization framework.This framework combines the non-dominated sorting genetic algorithm II(NSGA-II)and patch-generating land use simulation(PLUS)model with an ecological protection importance evaluation,comprehensive agricultural productivity evaluation,and urban sustainable development potential assessment and optimizes the territorial space in the Yangtze River Delta(YRD)region in 2035.The proposed sustainable development(SD)scenario can effectively reduce the destruction of landscape patterns of various land-use types while considering both ecological and economic benefits.The simulation results were further revised by evaluating the land-use suitability of the YRD region.According to the revised spatial pattern for the YRD in 2035,the farmland area accounts for 43.59%of the total YRD,which is 5.35%less than that in 2010.Forest,grassland,and water area account for 40.46%of the total YRD—an increase of 1.42%compared with the case in 2010.Construction land accounts for 14.72%of the total YRD—an increase of 2.77%compared with the case in 2010.The ES-FS-USD spatial optimization framework ensures that spatial optimization outcomes are aligned with the natural endowments of land resources,thereby promoting the sustainable use of land resources,improving the ability of spatial management,and providing valuable insights for decision makers.
基金supported by National Natural Science Foundations of China(nos.12271326,62102304,61806120,61502290,61672334,61673251)China Postdoctoral Science Foundation(no.2015M582606)+2 种基金Industrial Research Project of Science and Technology in Shaanxi Province(nos.2015GY016,2017JQ6063)Fundamental Research Fund for the Central Universities(no.GK202003071)Natural Science Basic Research Plan in Shaanxi Province of China(no.2022JM-354).
文摘The multi-objective particle swarm optimization algorithm(MOPSO)is widely used to solve multi-objective optimization problems.In the article,amulti-objective particle swarm optimization algorithmbased on decomposition and multi-selection strategy is proposed to improve the search efficiency.First,two update strategies based on decomposition are used to update the evolving population and external archive,respectively.Second,a multiselection strategy is designed.The first strategy is for the subspace without a non-dominated solution.Among the neighbor particles,the particle with the smallest penalty-based boundary intersection value is selected as the global optimal solution and the particle far away fromthe search particle and the global optimal solution is selected as the personal optimal solution to enhance global search.The second strategy is for the subspace with a non-dominated solution.In the neighbor particles,two particles are randomly selected,one as the global optimal solution and the other as the personal optimal solution,to enhance local search.The third strategy is for Pareto optimal front(PF)discontinuity,which is identified by the cumulative number of iterations of the subspace without non-dominated solutions.In the subsequent iteration,a new probability distribution is used to select from the remaining subspaces to search.Third,an adaptive inertia weight update strategy based on the dominated degree is designed to further improve the search efficiency.Finally,the proposed algorithmis compared with fivemulti-objective particle swarm optimization algorithms and five multi-objective evolutionary algorithms on 22 test problems.The results show that the proposed algorithm has better performance.
基金supported by the National Natural Science Foundation of China(Grant Nos.52090081,52079068)the State Key Laboratory of Hydroscience and Hydraulic Engineering(Grant No.2021-KY-04).
文摘Accurate determination of rock mass parameters is essential for ensuring the accuracy of numericalsimulations. Displacement back-analysis is the most widely used method;however, the reliability of thecurrent approaches remains unsatisfactory. Therefore, in this paper, a multistage rock mass parameterback-analysis method, that considers the construction process and displacement losses is proposed andimplemented through the coupling of numerical simulation, auto-machine learning (AutoML), andmulti-objective optimization algorithms (MOOAs). First, a parametric modeling platform for mechanizedtwin tunnels is developed, generating a dataset through extensive numerical simulations. Next, theAutoML method is utilized to establish a surrogate model linking rock parameters and displacements.The tunnel construction process is divided into multiple stages, transforming the rock mass parameterback-analysis into a multi-objective optimization problem, for which multi-objective optimization algorithmsare introduced to obtain the rock mass parameters. The newly proposed rock mass parameterback-analysis method is validated in a mechanized twin tunnel project, and its accuracy and effectivenessare demonstrated. Compared with traditional single-stage back-analysis methods, the proposedmodel decreases the average absolute percentage error from 12.73% to 4.34%, significantly improving theaccuracy of the back-analysis. Moreover, although the accuracy of back analysis significantly increaseswith the number of construction stages considered, the back analysis time is acceptable. This studyprovides a new method for displacement back analysis that is efficient and accurate, thereby paving theway for precise parameter determination in numerical simulations.
文摘Cloud computing has become an essential technology for the management and processing of large datasets,offering scalability,high availability,and fault tolerance.However,optimizing data replication across multiple data centers poses a significant challenge,especially when balancing opposing goals such as latency,storage costs,energy consumption,and network efficiency.This study introduces a novel Dynamic Optimization Algorithm called Dynamic Multi-Objective Gannet Optimization(DMGO),designed to enhance data replication efficiency in cloud environments.Unlike traditional static replication systems,DMGO adapts dynamically to variations in network conditions,system demand,and resource availability.The approach utilizes multi-objective optimization approaches to efficiently balance data access latency,storage efficiency,and operational costs.DMGO consistently evaluates data center performance and adjusts replication algorithms in real time to guarantee optimal system efficiency.Experimental evaluations conducted in a simulated cloud environment demonstrate that DMGO significantly outperforms conventional static algorithms,achieving faster data access,lower storage overhead,reduced energy consumption,and improved scalability.The proposed methodology offers a robust and adaptable solution for modern cloud systems,ensuring efficient resource consumption while maintaining high performance.
基金supported by the Serbian Ministry of Education and Science under Grant No.TR35006 and COST Action:CA23155—A Pan-European Network of Ocean Tribology(OTC)The research of B.Rosic and M.Rosic was supported by the Serbian Ministry of Education and Science under Grant TR35029.
文摘This paper introduces a hybrid multi-objective optimization algorithm,designated HMODESFO,which amalgamates the exploratory prowess of Differential Evolution(DE)with the rapid convergence attributes of the Sailfish Optimization(SFO)algorithm.The primary objective is to address multi-objective optimization challenges within mechanical engineering,with a specific emphasis on planetary gearbox optimization.The algorithm is equipped with the ability to dynamically select the optimal mutation operator,contingent upon an adaptive normalized population spacing parameter.The efficacy of HMODESFO has been substantiated through rigorous validation against estab-lished industry benchmarks,including a suite of Zitzler-Deb-Thiele(ZDT)and Zeb-Thiele-Laumanns-Zitzler(DTLZ)problems,where it exhibited superior performance.The outcomes underscore the algorithm’s markedly enhanced optimization capabilities relative to existing methods,particularly in tackling highly intricate multi-objective planetary gearbox optimization problems.Additionally,the performance of HMODESFO is evaluated against selected well-known mechanical engineering test problems,further accentuating its adeptness in resolving complex optimization challenges within this domain.
基金funded by Researchers Supporting Programnumber(RSPD2024R809),King Saud University,Riyadh,Saudi Arabia.
文摘Multi-objective optimization is critical for problem-solving in engineering,economics,and AI.This study introduces the Multi-Objective Chef-Based Optimization Algorithm(MOCBOA),an upgraded version of the Chef-Based Optimization Algorithm(CBOA)that addresses distinct objectives.Our approach is unique in systematically examining four dominance relations—Pareto,Epsilon,Cone-epsilon,and Strengthened dominance—to evaluate their influence on sustaining solution variety and driving convergence toward the Pareto front.Our comparison investigation,which was conducted on fifty test problems from the CEC 2021 benchmark and applied to areas such as chemical engineering,mechanical design,and power systems,reveals that the dominance approach used has a considerable impact on the key optimization measures such as the hypervolume metric.This paper provides a solid foundation for determining themost effective dominance approach and significant insights for both theoretical research and practical applications in multi-objective optimization.
文摘Impinging jet arrays are extensively used in numerous industrial operations,including the cooling of electronics,turbine blades,and other high-heat flux systems because of their superior heat transfer capabilities.Optimizing the design and operating parameters of such systems is essential to enhance cooling efficiency and achieve uniform pressure distribution,which can lead to improved system performance and energy savings.This paper presents two multi-objective optimization methodologies for a turbulent air jet impingement cooling system.The governing equations are resolved employing the commercial computational fluid dynamics(CFD)software ANSYS Fluent v17.The study focuses on four controlling parameters:Reynolds number(Re),swirl number(S),jet-to-jet separation distance(Z/D),and impingement height(H/D).The effects of these parameters on heat transfer and impingement pressure distribution are investigated.Non-dominated Sorting Genetic Algorithm(NSGA-II)and Weighted Sum Method(WSM)are employed to optimize the controlling parameters for maximum cooling performance.The aim is to identify optimal design parameters and system configurations that enhance heat transfer efficiency while achieving a uniform impingement pressure distribution.These findings have practical implications for applications requiring efficient cooling.The optimized design achieved a 12.28%increase in convective heat transfer efficiency with a local Nusselt number of 113.05 compared to 100.69 in the reference design.Enhanced convective cooling and heat flux were observed in the optimized configuration,particularly in areas of direct jet impingement.Additionally,the optimized design maintained lower wall temperatures,demonstrating more effective thermal dissipation.
基金Supported by the Natural Science Foundation of Zhejiang Province(No.LQ22F030015).
文摘This work addresses the cut order planning(COP)problem for multi-color garment production,which is the first step in the clothing industry.First,a multi-objective optimization model of multicolor COP(MCOP)is established with production error and production cost as optimization objectives,combined with constraints such as the number of equipment and the number of layers.Second,a decoupled multi-objective optimization algorithm(DMOA)is proposed based on the linear programming decoupling strategy and non-dominated sorting in genetic algorithmsⅡ(NSGAII).The size-combination matrix and the fabric-layer matrix are decoupled to improve the accuracy of the algorithm.Meanwhile,an improved NSGAII algorithm is designed to obtain the optimal Pareto solution to the MCOP problem,thereby constructing a practical intelligent production optimization algorithm.Finally,the effectiveness and superiority of the proposed DMOA are verified through practical cases and comparative experiments,which can effectively optimize the production process for garment enterprises.
基金supported by National Key Research and Development Program of China (2023YFB3307800)National Natural Science Foundation of China (Key Program: 62136003, 62373155)+1 种基金Major Science and Technology Project of Xinjiang (No. 2022A01006-4)the Fundamental Research Funds for the Central Universities。
文摘Hydrocracking is one of the most important petroleum refining processes that converts heavy oils into gases,naphtha,diesel,and other products through cracking reactions.Multi-objective optimization algorithms can help refining enterprises determine the optimal operating parameters to maximize product quality while ensuring product yield,or to increase product yield while reducing energy consumption.This paper presents a multi-objective optimization scheme for hydrocracking based on an improved SPEA2-PE algorithm,which combines path evolution operator and adaptive step strategy to accelerate the convergence speed and improve the computational accuracy of the algorithm.The reactor model used in this article is simulated based on a twenty-five lumped kinetic model.Through model and test function verification,the proposed optimization scheme exhibits significant advantages in the multiobjective optimization process of hydrocracking.
文摘Addressing the complex issue of emergency resource distribution center site selection in uncertain environments, this study was conducted to comprehensively consider factors such as uncertainty parameters and the urgency of demand at disaster-affected sites. Firstly, urgency cost, economic cost, and transportation distance cost were identified as key objectives. The study applied fuzzy theory integration to construct a triangular fuzzy multi-objective site selection decision model. Next, the defuzzification theory transformed the fuzzy decision model into a precise one. Subsequently, an improved Chaotic Quantum Multi-Objective Harris Hawks Optimization (CQ-MOHHO) algorithm was proposed to solve the model. The CQ-MOHHO algorithm was shown to rapidly produce high-quality Pareto front solutions and identify optimal site selection schemes for emergency resource distribution centers through case studies. This outcome verified the feasibility and efficacy of the site selection decision model and the CQ-MOHHO algorithm. To further assess CQ-MOHHO’s performance, Zitzler-Deb-Thiele (ZDT) test functions, commonly used in multi-objective optimization, were employed. Comparisons with Multi-Objective Harris Hawks Optimization (MOHHO), Non-dominated Sorting Genetic Algorithm II (NSGA-II), and Multi-Objective Grey Wolf Optimizer (MOGWO) using Generational Distance (GD), Hypervolume (HV), and Inverted Generational Distance (IGD) metrics showed that CQ-MOHHO achieved superior global search ability, faster convergence, and higher solution quality. The CQ-MOHHO algorithm efficiently achieved a balance between multiple objectives, providing decision-makers with satisfactory solutions and a valuable reference for researching and applying emergency site selection problems.
基金Scientific Research Projects Unit of Erciyes University under the contract numbers:FDK-2019-8616 and FDK-2025-14774(https://bap.erciyes.edu.tr/,accessed on 12 October 2025)The Scientific and Technological Research Council of Turkey(TUB˙ITAK)for the Doctoral Scholarship for Priority Areas 2211/C for Ramazan OZKAN(https://tubitak.gov.tr,accessed on 12 October 2025).
文摘The optimization of turbine blades is crucial in improving the efficiency of wind energy systems and developing clean energy production models.This paper presented a novel approach to the structural design of smallscale turbine blades using the Artificial Bee Colony(ABC)Algorithm based on the stochastic method to optimize both mass and cost(objective functions).The study used computational fluid dynamics(CFD)and structural analysis to consider the fluid-structure interaction.The optimization algorithm defined several variables:structural constraints,the type of composite material,and the number of composite layers to form a mathematical model.The numerical modeling was performed using the Ansys Fluent software and its Fluid-Structure Interaction(FSI)module.The ANSYS Composite PrePost(ACP)advanced composite modeling method was utilized in the structural design of composite materials.This study showed that the structurally optimized small-scale turbine blades provided a sustainable solution with improved efficiency compared to traditional designs.Furthermore,using CFD,structural analysis,and material characterization techniques first considered in this study highlights the importance of considering structural behavior when optimizing turbine blade designs.
基金supported in part by the National Natural Science Foundation of China(61806051,61903078)Natural Science Foundation of Shanghai(20ZR1400400)+2 种基金Agricultural Project of the Shanghai Committee of Science and Technology(16391902800)the Fundamental Research Funds for the Central Universities(2232020D-48)the Project of the Humanities and Social Sciences on Young Fund of the Ministry of Education in China(Research on swarm intelligence collaborative robust optimization scheduling for high-dimensional dynamic decisionmaking system(20YJCZH052))。
文摘Evolutionary algorithms have been shown to be very successful in solving multi-objective optimization problems(MOPs).However,their performance often deteriorates when solving MOPs with irregular Pareto fronts.To remedy this issue,a large body of research has been performed in recent years and many new algorithms have been proposed.This paper provides a comprehensive survey of the research on MOPs with irregular Pareto fronts.We start with a brief introduction to the basic concepts,followed by a summary of the benchmark test problems with irregular problems,an analysis of the causes of the irregularity,and real-world optimization problems with irregular Pareto fronts.Then,a taxonomy of the existing methodologies for handling irregular problems is given and representative algorithms are reviewed with a discussion of their strengths and weaknesses.Finally,open challenges are pointed out and a few promising future directions are suggested.
文摘In this paper, a multi-objective particle swarm optimization （MOPSO） algorithm and a nondominated sorting genetic algorithm II （NSGA-II） are used to optimize the operating parameters of a 1.6 L, spark ignition （SI） gasoline engine. The aim of this optimization is to reduce engine emissions in terms of carbon monoxide （CO）, hydrocarbons （HC）, and nitrogen oxides （NOx）, which are the causes of diverse environmental problems such as air pollution and global warming. Stationary engine tests were performed for data generation, covering 60 operating conditions. Artificial neural networks （ANNs） were used to predict exhaust emissions, whose inputs were from six engine operating parameters, and the outputs were three resulting exhaust emissions. The outputs of ANNs were used to evaluate objective functions within the optimization algorithms： NSGA-II and MOPSO. Then a decision-making process was conducted, using a fuzzy method to select a Pareto solution with which the best emission reductions can be achieved. The NSGA-II algorithm achieved reductions of at least 9.84%, 82.44%, and 13.78% for CO, HC, and NOx, respectively. With a MOPSO algorithm the reached reductions were at least 13.68%, 83.80%, and 7.67% for CO, HC, and NOx, respectively.
基金supported in part by the National Key Research and Development Program of China(2018AAA0100100)the National Natural Science Foundation of China(61906001,62136008,U21A20512)+1 种基金the Key Program of Natural Science Project of Educational Commission of Anhui Province(KJ2020A0036)Alexander von Humboldt Professorship for Artificial Intelligence Funded by the Federal Ministry of Education and Research,Germany。
文摘Large-scale multi-objective optimization problems(LSMOPs)pose challenges to existing optimizers since a set of well-converged and diverse solutions should be found in huge search spaces.While evolutionary algorithms are good at solving small-scale multi-objective optimization problems,they are criticized for low efficiency in converging to the optimums of LSMOPs.By contrast,mathematical programming methods offer fast convergence speed on large-scale single-objective optimization problems,but they have difficulties in finding diverse solutions for LSMOPs.Currently,how to integrate evolutionary algorithms with mathematical programming methods to solve LSMOPs remains unexplored.In this paper,a hybrid algorithm is tailored for LSMOPs by coupling differential evolution and a conjugate gradient method.On the one hand,conjugate gradients and differential evolution are used to update different decision variables of a set of solutions,where the former drives the solutions to quickly converge towards the Pareto front and the latter promotes the diversity of the solutions to cover the whole Pareto front.On the other hand,objective decomposition strategy of evolutionary multi-objective optimization is used to differentiate the conjugate gradients of solutions,and the line search strategy of mathematical programming is used to ensure the higher quality of each offspring than its parent.In comparison with state-of-the-art evolutionary algorithms,mathematical programming methods,and hybrid algorithms,the proposed algorithm exhibits better convergence and diversity performance on a variety of benchmark and real-world LSMOPs.
文摘Aiming to solve the steering instability and hysteresis of agricultural robots in the process of movement,a fusion PID control method of particle swarm optimization(PSO)and genetic algorithm(GA)was proposed.The fusion algorithm took advantage of the fast optimization ability of PSO to optimize the population screening link of GA.The Simulink simulation results showed that the convergence of the fitness function of the fusion algorithm was accelerated,the system response adjustment time was reduced,and the overshoot was almost zero.Then the algorithm was applied to the steering test of agricultural robot in various scenes.After modeling the steering system of agricultural robot,the steering test results in the unloaded suspended state showed that the PID control based on fusion algorithm reduced the rise time,response adjustment time and overshoot of the system,and improved the response speed and stability of the system,compared with the artificial trial and error PID control and the PID control based on GA.The actual road steering test results showed that the PID control response rise time based on the fusion algorithm was the shortest,about 4.43 s.When the target pulse number was set to 100,the actual mean value in the steady-state regulation stage was about 102.9,which was the closest to the target value among the three control methods,and the overshoot was reduced at the same time.The steering test results under various scene states showed that the PID control based on the proposed fusion algorithm had good anti-interference ability,it can adapt to the changes of environment and load and improve the performance of the control system.It was effective in the steering control of agricultural robot.This method can provide a reference for the precise steering control of other robots.
文摘A scheduling model of closely spaced parallel runways for arrival aircraft was proposed,with multi-objections of the minimum flight delay cost,the maximum airport capacity,the minimum workload of air traffic controller and the maximum fairness of airlines′scheduling.The time interval between two runways and changes of aircraft landing order were taken as the constraints.Genetic algorithm was used to solve the model,and the model constrained unit delay cost of the aircraft with multiple flight tasks to reduce its delay influence range.Each objective function value or the fitness of particle unsatisfied the constrain condition would be punished.Finally,one domestic airport hub was introduced to verify the algorithm and the model.The results showed that the genetic algorithm presented strong convergence and timeliness for solving constraint multi-objective aircraft landing problem on closely spaced parallel runways,and the optimization results were better than that of actual scheduling.
基金National Science Fund for Distinguished Young Scholars (10425208)Programme of Introducing Talents of Discipline to Universities (B07009)
文摘For dealing with the multi-objective optimization problems of parametric design for aircraft, a novel hybrid parallel multi-objective tabu search （HPMOTS） algorithm is used. First, a new multi-objective tabu search （MOTS） algorithm is proposed. Comparing with the traditional MOTS algorithm, this proposed algorithm adds some new methods such as the combination of MOTS algorithm and ＂Pareto solution＂, the strategy of ＂searching from many directions＂ and the reservation of good solutions. Second, this article also proposes the improved parallel multi-objective tabu search （PMOTS） algorithm. Finally, a new hybrid algorithm--HPMOTS algorithm which combines the PMOTS algorithm with the non-dominated sorting-based multi-objective genetic algorithm （NSGA） is presented. The computing results of these algorithms are compared with each other and it is shown that the optimal result can be obtained by the HPMOTS algorithm and the computing result of the PMOTS algorithm is better than that of MOTS algorithm.
基金financially supported by the National Natural Science Foundation of China(Grant No.52371261)the Science and Technology Projects of Liaoning Province(Grant No.2023011352-JH1/110).
文摘This study delineates the development of the optimization framework for the preliminary design phase of Floating Offshore Wind Turbines(FOWTs),and the central challenge addressed is the optimization of the FOWT platform dimensional parameters in relation to motion responses.Although the three-dimensional potential flow(TDPF)panel method is recognized for its precision in calculating FOWT motion responses,its computational intensity necessitates an alternative approach for efficiency.Herein,a novel application of varying fidelity frequency-domain computational strategies is introduced,which synthesizes the strip theory with the TDPF panel method to strike a balance between computational speed and accuracy.The Co-Kriging algorithm is employed to forge a surrogate model that amalgamates these computational strategies.Optimization objectives are centered on the platform’s motion response in heave and pitch directions under general sea conditions.The steel usage,the range of design variables,and geometric considerations are optimization constraints.The angle of the pontoons,the number of columns,the radius of the central column and the parameters of the mooring lines are optimization constants.This informed the structuring of a multi-objective optimization model utilizing the Non-dominated Sorting Genetic Algorithm Ⅱ(NSGA-Ⅱ)algorithm.For the case of the IEA UMaine VolturnUS-S Reference Platform,Pareto fronts are discerned based on the above framework and delineate the relationship between competing motion response objectives.The efficacy of final designs is substantiated through the time-domain calculation model,which ensures that the motion responses in extreme sea conditions are superior to those of the initial design.
基金supported by Key Science and Technology Program of Henan Province,China(Grant Nos.242102210147,242102210027)Fujian Province Young and Middle aged Teacher Education Research Project(Science and Technology Category)(No.JZ240101)(Corresponding author:Dong Yuan).
文摘Vehicle Edge Computing(VEC)and Cloud Computing(CC)significantly enhance the processing efficiency of delay-sensitive and computation-intensive applications by offloading compute-intensive tasks from resource-constrained onboard devices to nearby Roadside Unit(RSU),thereby achieving lower delay and energy consumption.However,due to the limited storage capacity and energy budget of RSUs,it is challenging to meet the demands of the highly dynamic Internet of Vehicles(IoV)environment.Therefore,determining reasonable service caching and computation offloading strategies is crucial.To address this,this paper proposes a joint service caching scheme for cloud-edge collaborative IoV computation offloading.By modeling the dynamic optimization problem using Markov Decision Processes(MDP),the scheme jointly optimizes task delay,energy consumption,load balancing,and privacy entropy to achieve better quality of service.Additionally,a dynamic adaptive multi-objective deep reinforcement learning algorithm is proposed.Each Double Deep Q-Network(DDQN)agent obtains rewards for different objectives based on distinct reward functions and dynamically updates the objective weights by learning the value changes between objectives using Radial Basis Function Networks(RBFN),thereby efficiently approximating the Pareto-optimal decisions for multiple objectives.Extensive experiments demonstrate that the proposed algorithm can better coordinate the three-tier computing resources of cloud,edge,and vehicles.Compared to existing algorithms,the proposed method reduces task delay and energy consumption by 10.64%and 5.1%,respectively.
