The rapid growth of mobile and Internet of Things(IoT)applications in dense urban environments places stringent demands on future Beyond 5G(B5G)or Beyond 6G(B6G)networks,which must ensure high Quality of Service(QoS)w...The rapid growth of mobile and Internet of Things(IoT)applications in dense urban environments places stringent demands on future Beyond 5G(B5G)or Beyond 6G(B6G)networks,which must ensure high Quality of Service(QoS)while maintaining cost-efficiency and sustainable deployment.Traditional strategies struggle with complex 3D propagation,building penetration loss,and the balance between coverage and infrastructure cost.To address this challenge,this study presents the first application of a Global-best Guided Quantum-inspired Tabu Search with Quantum-Not Gate(GQTS-QNG)framework for 3D base-station deployment optimization.The problem is formulated as a multi-objective model that simultaneously maximizes coverage and minimizes deployment cost.A binary-to-decimal encodingmechanism is designed to represent discrete placement coordinates and base station types,leveraging a quantum-inspired method to efficiently search and refine solutions within challenging combinatorial environments.Global-best guidance and tabu memory are integrated to strengthen convergence stability and avoid revisiting previously explored solutions.Simulation results across user densities ranging from 1000 to 10,000 show that GQTS-QNG consistently finds deployment configurations achieving full coverage while reducing deployment cost compared with the state-of-the-art algorithms under equal iteration times.Additionally,our method generates welldistributed and structured Pareto fronts,offering diverse planning options that allow operators to flexibly balance cost and performance requirements.These findings demonstrate that GQTS-QNG is a scalable and efficient algorithm for sustainable 3D cellular network deployment in B5G/6G urban scenarios.展开更多
Autonomous connected vehicles(ACV)involve advanced control strategies to effectively balance safety,efficiency,energy consumption,and passenger comfort.This research introduces a deep reinforcement learning(DRL)-based...Autonomous connected vehicles(ACV)involve advanced control strategies to effectively balance safety,efficiency,energy consumption,and passenger comfort.This research introduces a deep reinforcement learning(DRL)-based car-following(CF)framework employing the Deep Deterministic Policy Gradient(DDPG)algorithm,which integrates a multi-objective reward function that balances the four goals while maintaining safe policy learning.Utilizing real-world driving data from the highD dataset,the proposed model learns adaptive speed control policies suitable for dynamic traffic scenarios.The performance of the DRL-based model is evaluated against a traditional model predictive control-adaptive cruise control(MPC-ACC)controller.Results show that theDRLmodel significantly enhances safety,achieving zero collisions and a higher average time-to-collision(TTC)of 8.45 s,compared to 5.67 s for MPC and 6.12 s for human drivers.For efficiency,the model demonstrates 89.2% headway compliance and maintains speed tracking errors below 1.2 m/s in 90% of cases.In terms of energy optimization,the proposed approach reduces fuel consumption by 5.4% relative to MPC.Additionally,it enhances passenger comfort by lowering jerk values by 65%,achieving 0.12 m/s3 vs.0.34 m/s3 for human drivers.A multi-objective reward function is integrated to ensure stable policy convergence while simultaneously balancing the four key performance metrics.Moreover,the findings underscore the potential of DRL in advancing autonomous vehicle control,offering a robust and sustainable solution for safer,more efficient,and more comfortable transportation systems.展开更多
Task scheduling in cloud computing is a multi-objective optimization problem,often involving conflicting objectives such as minimizing execution time,reducing operational cost,and maximizing resource utilization.Howev...Task scheduling in cloud computing is a multi-objective optimization problem,often involving conflicting objectives such as minimizing execution time,reducing operational cost,and maximizing resource utilization.However,traditional approaches frequently rely on single-objective optimization methods which are insufficient for capturing the complexity of such problems.To address this limitation,we introduce MDMOSA(Multi-objective Dwarf Mongoose Optimization with Simulated Annealing),a hybrid that integrates multi-objective optimization for efficient task scheduling in Infrastructure-as-a-Service(IaaS)cloud environments.MDMOSA harmonizes the exploration capabilities of the biologically inspired Dwarf Mongoose Optimization(DMO)with the exploitation strengths of Simulated Annealing(SA),achieving a balanced search process.The algorithm aims to optimize task allocation by reducing makespan and financial cost while improving system resource utilization.We evaluate MDMOSA through extensive simulations using the real-world Google Cloud Jobs(GoCJ)dataset within the CloudSim environment.Comparative analysis against benchmarked algorithms such as SMOACO,MOTSGWO,and MFPAGWO reveals that MDMOSA consistently achieves superior performance in terms of scheduling efficiency,cost-effectiveness,and scalability.These results confirm the potential of MDMOSA as a robust and adaptable solution for resource scheduling in dynamic and heterogeneous cloud computing infrastructures.展开更多
Deployable Composite Thin-Walled Structures(DCTWS)are widely used in space applications due to their ability to compactly fold and self-deploy in orbit,enabled by cutouts.Cutout design is crucial for balancing structu...Deployable Composite Thin-Walled Structures(DCTWS)are widely used in space applications due to their ability to compactly fold and self-deploy in orbit,enabled by cutouts.Cutout design is crucial for balancing structural rigidity and flexibility,ensuring material integrity during large deformations,and providing adequate load-bearing capacity and stability once deployed.Most research has focused on optimizing cutout size and shape,while topology optimization offers a broader design space.However,the anisotropic properties of woven composite laminates,complex failure criteria,and multi-performance optimization needs have limited the exploration of topology optimization in this field.This work derives the sensitivities of bending stiffness,critical buckling load,and the failure index of woven composite materials with respect to element density,and formulates both single-objective and multi-objective topology optimization models using a linear weighted aggregation approach.The developed method was integrated with the commercial finite element software ABAQUS via a Python script,allowing efficient application to cutout design in various DCTWS configurations to maximize bending stiffness and critical buckling load under material failure constraints.Optimization of a classical tubular hinge resulted in improvements of 107.7%in bending stiffness and 420.5%in critical buckling load compared to level-set topology optimization results reported in the literature,validating the effectiveness of the approach.To facilitate future research and encourage the broader adoption of topology optimization techniques in DCTWS design,the source code for this work is made publicly available via a Git Hub link:https://github.com/jinhao-ok1/Topo-for-DCTWS.git.展开更多
In a wide range of engineering applications,complex constrained multi-objective optimization problems(CMOPs)present significant challenges,as the complexity of constraints often hampers algorithmic convergence and red...In a wide range of engineering applications,complex constrained multi-objective optimization problems(CMOPs)present significant challenges,as the complexity of constraints often hampers algorithmic convergence and reduces population diversity.To address these challenges,we propose a novel algorithm named Constraint IntensityDriven Evolutionary Multitasking(CIDEMT),which employs a two-stage,tri-task framework to dynamically integrates problem structure and knowledge transfer.In the first stage,three cooperative tasks are designed to explore the Constrained Pareto Front(CPF),the Unconstrained Pareto Front(UPF),and theε-relaxed constraint boundary,respectively.A CPF-UPF relationship classifier is employed to construct a problem-type-aware evolutionary strategy pool.At the end of the first stage,each task selects strategies from this strategy pool based on the specific type of problem,thereby guiding the subsequent evolutionary process.In the second stage,while each task continues to evolve,aτ-driven knowledge transfer mechanism is introduced to selectively incorporate effective solutions across tasks.enhancing the convergence and feasibility of the main task.Extensive experiments conducted on 32 benchmark problems from three test suites(LIRCMOP,DASCMOP,and DOC)demonstrate that CIDEMT achieves the best Inverted Generational Distance(IGD)values on 24 problems and the best Hypervolume values(HV)on 22 problems.Furthermore,CIDEMT significantly outperforms six state-of-the-art constrained multi-objective evolutionary algorithms(CMOEAs).These results confirm CIDEMT’s superiority in promoting convergence,diversity,and robustness in solving complex CMOPs.展开更多
Community detection is one of the most fundamental applications in understanding the structure of complicated networks.Furthermore,it is an important approach to identifying closely linked clusters of nodes that may r...Community detection is one of the most fundamental applications in understanding the structure of complicated networks.Furthermore,it is an important approach to identifying closely linked clusters of nodes that may represent underlying patterns and relationships.Networking structures are highly sensitive in social networks,requiring advanced techniques to accurately identify the structure of these communities.Most conventional algorithms for detecting communities perform inadequately with complicated networks.In addition,they miss out on accurately identifying clusters.Since single-objective optimization cannot always generate accurate and comprehensive results,as multi-objective optimization can.Therefore,we utilized two objective functions that enable strong connections between communities and weak connections between them.In this study,we utilized the intra function,which has proven effective in state-of-the-art research studies.We proposed a new inter-function that has demonstrated its effectiveness by making the objective of detecting external connections between communities is to make them more distinct and sparse.Furthermore,we proposed a Multi-Objective community strength enhancement algorithm(MOCSE).The proposed algorithm is based on the framework of the Multi-Objective Evolutionary Algorithm with Decomposition(MOEA/D),integrated with a new heuristic mutation strategy,community strength enhancement(CSE).The results demonstrate that the model is effective in accurately identifying community structures while also being computationally efficient.The performance measures used to evaluate the MOEA/D algorithm in our work are normalized mutual information(NMI)and modularity(Q).It was tested using five state-of-the-art algorithms on social networks,comprising real datasets(Zachary,Dolphin,Football,Krebs,SFI,Jazz,and Netscience),as well as twenty synthetic datasets.These results provide the robustness and practical value of the proposed algorithm in multi-objective community identification.展开更多
Federated learning is a distributed framework that trains a centralised model using data from multiple clients without transferring that data to a central server.Despite rapid progress,federated learning still faces s...Federated learning is a distributed framework that trains a centralised model using data from multiple clients without transferring that data to a central server.Despite rapid progress,federated learning still faces several unsolved challenges.Specifically,communication costs and system heterogeneity,such as nonidentical data distribution,hinder federated learning's progress.Several approaches have recently emerged for federated learning involving heterogeneous clients with varying computational capabilities(namely,heterogeneous federated learning).However,heterogeneous federated learning faces two key challenges:optimising model size and determining client selection ratios.Moreover,efficiently aggregating local models from clients with diverse capabilities is crucial for addressing system heterogeneity and communication efficiency.This paper proposes an evolutionary multiobjective optimisation framework for heterogeneous federated learning(MOHFL)to address these issues.Our approach elegantly formulates and solves a biobjective optimisation problem that minimises communication cost and model error rate.The decision variables in this framework comprise model sizes and client selection ratios for each Q client cluster,yielding a total of 2×Q optimisation parameters to be tuned.We develop a partition-based strategy for MOHFL that segregates clients into clusters based on their communication and computation capabilities.Additionally,we implement an adaptive model sizing mechanism that dynamically assigns appropriate subnetwork architectures to clients based on their computational constraints.We also propose a unified aggregation framework to combine models of varying sizes from heterogeneous clients effectively.Extensive experiments on multiple datasets demonstrate the effectiveness and superiority of our proposed method compared to existing approaches.展开更多
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.展开更多
Spaceborne antennas are essential for remote sensing,deep-space communication,and Earth observation,yet their trajectory planning is complicated by nonlinear base-manipulator coupling and antenna flexibility.To addres...Spaceborne antennas are essential for remote sensing,deep-space communication,and Earth observation,yet their trajectory planning is complicated by nonlinear base-manipulator coupling and antenna flexibility.To address these challenges,this paper proposes a multi-objective trajectory optimization framework.The system dynamics capture both nonlinear rigid-flexible coupling and antenna deformation through a reduced-order formulation.To enhance discretization efficiency,a predictive-terminal hp-adaptive pseudospectral method is employed,assigning collocation density based on task-phase characteristics:finer resolution is applied to dynamic segments requiring higher accuracy,especially near the terminal phase.This enables efficient transcription of the continuous-time problem into a Nonlinear Programming Problem(NLP).The resulting NLP is then solved using a multi-objective optimization strategy based on the nondominated sorting genetic algorithm II,which explores trade-offs among antenna pointing accuracy,energy consumption,and structural vibration.Numerical results demonstrate that the proposed method achieves a reduction of approximately 14.0% in control energy and 41.8%in peak actuation compared to a GPOPS-II baseline,while significantly enhancing vibration suppression.The resulting Pareto front reveals structured trade-offs and clustered solutions,offering robust and diverse options for precision,low-disturbance mission planning.展开更多
In order to address the issue of overly conservative offline reinforcement learning(RL) methods that limit the generalization of policy in the out-of-distribution(OOD) region,this article designs a surrogate target fo...In order to address the issue of overly conservative offline reinforcement learning(RL) methods that limit the generalization of policy in the out-of-distribution(OOD) region,this article designs a surrogate target for OOD value function based on dataset distance and proposes a novel generalized Q-learning mechanism with distance regularization(GQDR).In theory,we not only prove the convergence of GQDR,but also ensure that the difference between the Q-value learned by GQDR and its true value is bounded.Furthermore,an offline generalized actor-critic method with distance regularization(OGACDR) is proposed by combining GQDR with actor-critic learning framework.Two implementations of OGACDR,OGACDR-EXP and OGACDRSQR,are introduced according to exponential(EXP) and opensquare(SQR) distance weight functions,and it has been theoretically proved that OGACDR provides a safe policy improvement.Experimental results on Gym-MuJoCo continuous control tasks show that OGACDR can not only alleviate the overestimation and overconservatism of Q-value function,but also outperform conservative offline RL baselines.展开更多
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.展开更多
AIM:To build a functional generalized estimating equation(GEE)model to detect glaucomatous visual field progression and compare the performance of the proposed method with that of commonly employed algorithms.METHODS:...AIM:To build a functional generalized estimating equation(GEE)model to detect glaucomatous visual field progression and compare the performance of the proposed method with that of commonly employed algorithms.METHODS:Totally 716 eyes of 716 patients with primary open angle glaucoma(POAG)with at least 5 reliable 24-2 test results and 2y of follow-up were selected.The functional GEE model was used to detect perimetric progression in the training dataset(501 eyes).In the testing dataset(215 eyes),progression was evaluated the functional GEE model,mean deviation(MD)and visual field index(VFI)rates of change,Advanced Glaucoma Intervention Study(AGIS)and Collaborative Initial Glaucoma Treatment Study(CIGTS)scores,and pointwise linear regression(PLR).RESULTS:The proposed method showed the highest proportion of eyes detected as progression(54.4%),followed by the VFI rate(34.4%),PLR(23.3%),and MD rate(21.4%).The CIGTS and AGIS scores had a lower proportion of eyes detected as progression(7.9%and 5.1%,respectively).The time to detection of progression was significantly shorter for the proposed method than that of other algorithms(adjusted P≤0.019).The VFI rate displayed moderate pairwise agreement with the proposed method(k=0.47).CONCLUSION:The functional GEE model shows the highest proportion of eyes detected as perimetric progression and the shortest time to detect perimetric progression in patients with POAG.展开更多
With the increasing integration of emerging source-load types such as distributed photovoltaics,electric vehicles,and energy storage into distribution networks,the operational characteristics of these networks have ev...With the increasing integration of emerging source-load types such as distributed photovoltaics,electric vehicles,and energy storage into distribution networks,the operational characteristics of these networks have evolved from traditional single-load centers to complex multi-source,multi-load systems.This transition not only increases the difficulty of effectively classifying distribution networks due to their heightened complexity but also renders traditional energy management approaches-primarily focused on economic objectives-insufficient to meet the growing demands for flexible scheduling and dynamic response.To address these challenges,this paper proposes an adaptive multi-objective energy management strategy that accounts for the distinct operational requirements of distribution networks with a high penetration of new-type source-loads.The goal is to establish a comprehensive energy management framework that optimally balances energy efficiency,carbon reduction,and economic performance in modern distribution networks.To enhance classification accuracy,the strategy constructs amulti-dimensional scenario classification model that integrates environmental and climatic factors by analyzing the operational characteristics of new-type distribution networks and incorporating expert knowledge.An improved split-coupling K-means preclustering algorithm is employed to classify distribution networks effectively.Based on the classification results,fuzzy logic control is then utilized to dynamically optimize the weighting of each objective,allowing for an adaptive adjustment of priorities to achieve a flexible and responsivemulti-objective energy management strategy.The effectiveness of the proposed approach is validated through practical case studies.Simulation results indicate that the proposed method improves classification accuracy by 18.18%compared to traditional classification methods and enhances energy savings and carbon reduction by 4.34%and 20.94%,respectively,compared to the fixed-weight strategy.展开更多
This article proposes a generalized strongly coupled resonator quartet(GSCRQ)filter along with its synthesis approach.By introducing out-of-band reflection zeros(RZs),the proposed GSCRQ can generate a transmission zer...This article proposes a generalized strongly coupled resonator quartet(GSCRQ)filter along with its synthesis approach.By introducing out-of-band reflection zeros(RZs),the proposed GSCRQ can generate a transmission zero on each side of the passband without negative couplings.The coupling coefficients in this coupling structure change with the positions of the out-of-band RZs.Thus,the GSCRQ configuration admits flexible design solutions.For GSCRQ coaxial combline filters,all couplings can be implemented as inductive couplings,simplifying the design and manufacturing process.In this article,a 6-2 filter in the GSCRQ configuration is synthesized and designed.The simulated results of the designed filter agree very well with the theoretical characteristics.展开更多
Most multimodal multi-objective evolutionary algorithms(MMEAs)aim to find all global Pareto optimal sets(PSs)for a multimodal multi-objective optimization problem(MMOP).However,in real-world problems,decision makers(D...Most multimodal multi-objective evolutionary algorithms(MMEAs)aim to find all global Pareto optimal sets(PSs)for a multimodal multi-objective optimization problem(MMOP).However,in real-world problems,decision makers(DMs)may be also interested in local PSs.Also,searching for both global and local PSs is more general in view of dealing with MMOPs,which can be seen as generalized MMOPs.Moreover,most state-of-theart MMEAs exhibit poor convergence on high-dimension MMOPs and are unable to deal with constrained MMOPs.To address the above issues,we present a novel multimodal multiobjective coevolutionary algorithm(Co MMEA)to better produce both global and local PSs,and simultaneously,to improve the convergence performance in dealing with high-dimension MMOPs.Specifically,the Co MMEA introduces two archives to the search process,and coevolves them simultaneously through effective knowledge transfer.The convergence archive assists the Co MMEA to quickly approach the Pareto optimal front.The knowledge of the converged solutions is then transferred to the diversity archive which utilizes the local convergence indicator and the-dominance-based method to obtain global and local PSs effectively.Experimental results show that Co MMEA is competitive compared to seven state-of-the-art MMEAs on fifty-four complex MMOPs.展开更多
Based on the generalized reduced R-matrix theory,the R-matrix analysis code(RAC program)was used to analyze the experimental data of all the nuclear reaction channels related to the 5 He system.The current calculation...Based on the generalized reduced R-matrix theory,the R-matrix analysis code(RAC program)was used to analyze the experimental data of all the nuclear reaction channels related to the 5 He system.The current calculations provide accurate and reliable evaluation data and are in good agreement with the experimental data.In this study,self-consistent evaluation data for each reaction were obtained using multi-channel and multi-energy fitting.In particular,the error propagation theory of generalized least squares was used to determine the error of the evaluation data and the covariance matrix of the integral cross section.This R-matrix analysis for the 5 He system has three features.First,for the first time,the error in the evaluation data of the T(d,n)^(4)He reaction cross section and the covariance matrix of the integral cross section are provided.Second,we used only one set of R-matrix parameters to depict the reaction cross section of each reaction channel of the 5 He system for the entire energy region in our work.Third,in this evaluation,we considered some of the latest measured experimental data,especially after 2000.The T(d,n)^(4)He reaction cross section at 0.1 MeV and below was carefully studied.The effect of different energy levels in T(d,n)^(4)He was analyzed,with the energy levels 3/2^(+)making a major contribution to the cross section,and the role of the S-wave and P-wave from 3/2~-determines the lean forward trend of the angular distributions at 0.01–0.1 MeV.展开更多
This paper presents a numerical algorithm tuning aircraft landing gear control system with three objectives,including reducing relative vibration, reducing hydraulic strut force and controlling energy consumption. Sli...This paper presents a numerical algorithm tuning aircraft landing gear control system with three objectives,including reducing relative vibration, reducing hydraulic strut force and controlling energy consumption. Sliding mode control is applied to the vibration control of a simplified landing gear model with uncertainty. A two-stage generalized cell mapping algorithm is applied to search the Pareto set with gradient-free scheme. Drop test simulations over uneven runway show that the vibration and force interaction can be considerably reduced, and the Pareto optimum form a tight range in time domain.展开更多
The authors of this article are interested in characterization of efficient solutions for special classes of problems. These classes consider semi-strong E-convexity of involved functions. Sufficient and necessary con...The authors of this article are interested in characterization of efficient solutions for special classes of problems. These classes consider semi-strong E-convexity of involved functions. Sufficient and necessary conditions for a feasible solution to be an efficient or properly efficient solution are obtained.展开更多
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.展开更多
Due to the intermittency and instability of Wind-Solar energy and easy compensation of hydropower, this study proposes a Wind-Solar-Hydro power optimal scheduling model. This model is aimed at maximizing the total sys...Due to the intermittency and instability of Wind-Solar energy and easy compensation of hydropower, this study proposes a Wind-Solar-Hydro power optimal scheduling model. This model is aimed at maximizing the total system power generation and the minimum ten-day joint output. To effectively optimize the multi-objective model, a new algorithm named non-dominated sorting culture differential evolution algorithm(NSCDE) is proposed. The feasibility of NSCDE was verified through several well-known benchmark problems. It was then applied to the Jinping Wind-Solar-Hydro complementary power generation system. The results demonstrate that NSCDE can provide decision makers a series of optimized scheduling schemes.展开更多
基金supported by the National Science and Technology Council,Taiwan,under Grants 113-2221-E-260-014-MY2 and 114-2119-M-033-001.
文摘The rapid growth of mobile and Internet of Things(IoT)applications in dense urban environments places stringent demands on future Beyond 5G(B5G)or Beyond 6G(B6G)networks,which must ensure high Quality of Service(QoS)while maintaining cost-efficiency and sustainable deployment.Traditional strategies struggle with complex 3D propagation,building penetration loss,and the balance between coverage and infrastructure cost.To address this challenge,this study presents the first application of a Global-best Guided Quantum-inspired Tabu Search with Quantum-Not Gate(GQTS-QNG)framework for 3D base-station deployment optimization.The problem is formulated as a multi-objective model that simultaneously maximizes coverage and minimizes deployment cost.A binary-to-decimal encodingmechanism is designed to represent discrete placement coordinates and base station types,leveraging a quantum-inspired method to efficiently search and refine solutions within challenging combinatorial environments.Global-best guidance and tabu memory are integrated to strengthen convergence stability and avoid revisiting previously explored solutions.Simulation results across user densities ranging from 1000 to 10,000 show that GQTS-QNG consistently finds deployment configurations achieving full coverage while reducing deployment cost compared with the state-of-the-art algorithms under equal iteration times.Additionally,our method generates welldistributed and structured Pareto fronts,offering diverse planning options that allow operators to flexibly balance cost and performance requirements.These findings demonstrate that GQTS-QNG is a scalable and efficient algorithm for sustainable 3D cellular network deployment in B5G/6G urban scenarios.
基金the Hebei Province Science and Technology Plan Project(19221909D)rincess Nourah bint Abdulrahman University Researchers Supporting Project number(PNURSP2025R308),Princess Nourah bint Abdulrahman University,Riyadh,Saudi Arabia.
文摘Autonomous connected vehicles(ACV)involve advanced control strategies to effectively balance safety,efficiency,energy consumption,and passenger comfort.This research introduces a deep reinforcement learning(DRL)-based car-following(CF)framework employing the Deep Deterministic Policy Gradient(DDPG)algorithm,which integrates a multi-objective reward function that balances the four goals while maintaining safe policy learning.Utilizing real-world driving data from the highD dataset,the proposed model learns adaptive speed control policies suitable for dynamic traffic scenarios.The performance of the DRL-based model is evaluated against a traditional model predictive control-adaptive cruise control(MPC-ACC)controller.Results show that theDRLmodel significantly enhances safety,achieving zero collisions and a higher average time-to-collision(TTC)of 8.45 s,compared to 5.67 s for MPC and 6.12 s for human drivers.For efficiency,the model demonstrates 89.2% headway compliance and maintains speed tracking errors below 1.2 m/s in 90% of cases.In terms of energy optimization,the proposed approach reduces fuel consumption by 5.4% relative to MPC.Additionally,it enhances passenger comfort by lowering jerk values by 65%,achieving 0.12 m/s3 vs.0.34 m/s3 for human drivers.A multi-objective reward function is integrated to ensure stable policy convergence while simultaneously balancing the four key performance metrics.Moreover,the findings underscore the potential of DRL in advancing autonomous vehicle control,offering a robust and sustainable solution for safer,more efficient,and more comfortable transportation systems.
文摘Task scheduling in cloud computing is a multi-objective optimization problem,often involving conflicting objectives such as minimizing execution time,reducing operational cost,and maximizing resource utilization.However,traditional approaches frequently rely on single-objective optimization methods which are insufficient for capturing the complexity of such problems.To address this limitation,we introduce MDMOSA(Multi-objective Dwarf Mongoose Optimization with Simulated Annealing),a hybrid that integrates multi-objective optimization for efficient task scheduling in Infrastructure-as-a-Service(IaaS)cloud environments.MDMOSA harmonizes the exploration capabilities of the biologically inspired Dwarf Mongoose Optimization(DMO)with the exploitation strengths of Simulated Annealing(SA),achieving a balanced search process.The algorithm aims to optimize task allocation by reducing makespan and financial cost while improving system resource utilization.We evaluate MDMOSA through extensive simulations using the real-world Google Cloud Jobs(GoCJ)dataset within the CloudSim environment.Comparative analysis against benchmarked algorithms such as SMOACO,MOTSGWO,and MFPAGWO reveals that MDMOSA consistently achieves superior performance in terms of scheduling efficiency,cost-effectiveness,and scalability.These results confirm the potential of MDMOSA as a robust and adaptable solution for resource scheduling in dynamic and heterogeneous cloud computing infrastructures.
基金supported by the National Natural Science Foundation of China(No.12202295)the International(Regional)Cooperation and Exchange Projects of the National Natural Science Foundation of China(No.W2421002)+2 种基金the Sichuan Science and Technology Program(No.2025ZNSFSC0845)Zhejiang Provincial Natural Science Foundation of China(No.ZCLZ24A0201)the Fundamental Research Funds for the Provincial Universities of Zhejiang(No.GK249909299001-004)。
文摘Deployable Composite Thin-Walled Structures(DCTWS)are widely used in space applications due to their ability to compactly fold and self-deploy in orbit,enabled by cutouts.Cutout design is crucial for balancing structural rigidity and flexibility,ensuring material integrity during large deformations,and providing adequate load-bearing capacity and stability once deployed.Most research has focused on optimizing cutout size and shape,while topology optimization offers a broader design space.However,the anisotropic properties of woven composite laminates,complex failure criteria,and multi-performance optimization needs have limited the exploration of topology optimization in this field.This work derives the sensitivities of bending stiffness,critical buckling load,and the failure index of woven composite materials with respect to element density,and formulates both single-objective and multi-objective topology optimization models using a linear weighted aggregation approach.The developed method was integrated with the commercial finite element software ABAQUS via a Python script,allowing efficient application to cutout design in various DCTWS configurations to maximize bending stiffness and critical buckling load under material failure constraints.Optimization of a classical tubular hinge resulted in improvements of 107.7%in bending stiffness and 420.5%in critical buckling load compared to level-set topology optimization results reported in the literature,validating the effectiveness of the approach.To facilitate future research and encourage the broader adoption of topology optimization techniques in DCTWS design,the source code for this work is made publicly available via a Git Hub link:https://github.com/jinhao-ok1/Topo-for-DCTWS.git.
基金supported by the National Natural Science Foundation of China under Grant No.61972040the Science and Technology Research and Development Project funded by China Railway Material Trade Group Luban Company.
文摘In a wide range of engineering applications,complex constrained multi-objective optimization problems(CMOPs)present significant challenges,as the complexity of constraints often hampers algorithmic convergence and reduces population diversity.To address these challenges,we propose a novel algorithm named Constraint IntensityDriven Evolutionary Multitasking(CIDEMT),which employs a two-stage,tri-task framework to dynamically integrates problem structure and knowledge transfer.In the first stage,three cooperative tasks are designed to explore the Constrained Pareto Front(CPF),the Unconstrained Pareto Front(UPF),and theε-relaxed constraint boundary,respectively.A CPF-UPF relationship classifier is employed to construct a problem-type-aware evolutionary strategy pool.At the end of the first stage,each task selects strategies from this strategy pool based on the specific type of problem,thereby guiding the subsequent evolutionary process.In the second stage,while each task continues to evolve,aτ-driven knowledge transfer mechanism is introduced to selectively incorporate effective solutions across tasks.enhancing the convergence and feasibility of the main task.Extensive experiments conducted on 32 benchmark problems from three test suites(LIRCMOP,DASCMOP,and DOC)demonstrate that CIDEMT achieves the best Inverted Generational Distance(IGD)values on 24 problems and the best Hypervolume values(HV)on 22 problems.Furthermore,CIDEMT significantly outperforms six state-of-the-art constrained multi-objective evolutionary algorithms(CMOEAs).These results confirm CIDEMT’s superiority in promoting convergence,diversity,and robustness in solving complex CMOPs.
文摘Community detection is one of the most fundamental applications in understanding the structure of complicated networks.Furthermore,it is an important approach to identifying closely linked clusters of nodes that may represent underlying patterns and relationships.Networking structures are highly sensitive in social networks,requiring advanced techniques to accurately identify the structure of these communities.Most conventional algorithms for detecting communities perform inadequately with complicated networks.In addition,they miss out on accurately identifying clusters.Since single-objective optimization cannot always generate accurate and comprehensive results,as multi-objective optimization can.Therefore,we utilized two objective functions that enable strong connections between communities and weak connections between them.In this study,we utilized the intra function,which has proven effective in state-of-the-art research studies.We proposed a new inter-function that has demonstrated its effectiveness by making the objective of detecting external connections between communities is to make them more distinct and sparse.Furthermore,we proposed a Multi-Objective community strength enhancement algorithm(MOCSE).The proposed algorithm is based on the framework of the Multi-Objective Evolutionary Algorithm with Decomposition(MOEA/D),integrated with a new heuristic mutation strategy,community strength enhancement(CSE).The results demonstrate that the model is effective in accurately identifying community structures while also being computationally efficient.The performance measures used to evaluate the MOEA/D algorithm in our work are normalized mutual information(NMI)and modularity(Q).It was tested using five state-of-the-art algorithms on social networks,comprising real datasets(Zachary,Dolphin,Football,Krebs,SFI,Jazz,and Netscience),as well as twenty synthetic datasets.These results provide the robustness and practical value of the proposed algorithm in multi-objective community identification.
基金supported by the National Research Foundation of Korea grant funded by the Korea government(RS-2023-00217116)。
文摘Federated learning is a distributed framework that trains a centralised model using data from multiple clients without transferring that data to a central server.Despite rapid progress,federated learning still faces several unsolved challenges.Specifically,communication costs and system heterogeneity,such as nonidentical data distribution,hinder federated learning's progress.Several approaches have recently emerged for federated learning involving heterogeneous clients with varying computational capabilities(namely,heterogeneous federated learning).However,heterogeneous federated learning faces two key challenges:optimising model size and determining client selection ratios.Moreover,efficiently aggregating local models from clients with diverse capabilities is crucial for addressing system heterogeneity and communication efficiency.This paper proposes an evolutionary multiobjective optimisation framework for heterogeneous federated learning(MOHFL)to address these issues.Our approach elegantly formulates and solves a biobjective optimisation problem that minimises communication cost and model error rate.The decision variables in this framework comprise model sizes and client selection ratios for each Q client cluster,yielding a total of 2×Q optimisation parameters to be tuned.We develop a partition-based strategy for MOHFL that segregates clients into clusters based on their communication and computation capabilities.Additionally,we implement an adaptive model sizing mechanism that dynamically assigns appropriate subnetwork architectures to clients based on their computational constraints.We also propose a unified aggregation framework to combine models of varying sizes from heterogeneous clients effectively.Extensive experiments on multiple datasets demonstrate the effectiveness and superiority of our proposed method compared to existing approaches.
基金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.
基金supported by the National Natural Science Foundation of China(No.62173107).
文摘Spaceborne antennas are essential for remote sensing,deep-space communication,and Earth observation,yet their trajectory planning is complicated by nonlinear base-manipulator coupling and antenna flexibility.To address these challenges,this paper proposes a multi-objective trajectory optimization framework.The system dynamics capture both nonlinear rigid-flexible coupling and antenna deformation through a reduced-order formulation.To enhance discretization efficiency,a predictive-terminal hp-adaptive pseudospectral method is employed,assigning collocation density based on task-phase characteristics:finer resolution is applied to dynamic segments requiring higher accuracy,especially near the terminal phase.This enables efficient transcription of the continuous-time problem into a Nonlinear Programming Problem(NLP).The resulting NLP is then solved using a multi-objective optimization strategy based on the nondominated sorting genetic algorithm II,which explores trade-offs among antenna pointing accuracy,energy consumption,and structural vibration.Numerical results demonstrate that the proposed method achieves a reduction of approximately 14.0% in control energy and 41.8%in peak actuation compared to a GPOPS-II baseline,while significantly enhancing vibration suppression.The resulting Pareto front reveals structured trade-offs and clustered solutions,offering robust and diverse options for precision,low-disturbance mission planning.
基金supported by the National Natural Science Foundation of China(62373364,62176259)the Key Research and Development Program of Jiangsu Province(BE2022095)。
文摘In order to address the issue of overly conservative offline reinforcement learning(RL) methods that limit the generalization of policy in the out-of-distribution(OOD) region,this article designs a surrogate target for OOD value function based on dataset distance and proposes a novel generalized Q-learning mechanism with distance regularization(GQDR).In theory,we not only prove the convergence of GQDR,but also ensure that the difference between the Q-value learned by GQDR and its true value is bounded.Furthermore,an offline generalized actor-critic method with distance regularization(OGACDR) is proposed by combining GQDR with actor-critic learning framework.Two implementations of OGACDR,OGACDR-EXP and OGACDRSQR,are introduced according to exponential(EXP) and opensquare(SQR) distance weight functions,and it has been theoretically proved that OGACDR provides a safe policy improvement.Experimental results on Gym-MuJoCo continuous control tasks show that OGACDR can not only alleviate the overestimation and overconservatism of Q-value function,but also outperform conservative offline RL baselines.
基金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 the Korea Health Technology R&D Project through the Korea Health Industry Development Institute(KHIDI),funded by the Ministry of Health&Welfare,Republic of Korea(No.HR20C0026)the National Research Foundation of Korea(NRF)(No.RS-2023-00247504)the Patient-Centered Clinical Research Coordinating Center,funded by the Ministry of Health&Welfare,Republic of Korea(No.HC19C0276).
文摘AIM:To build a functional generalized estimating equation(GEE)model to detect glaucomatous visual field progression and compare the performance of the proposed method with that of commonly employed algorithms.METHODS:Totally 716 eyes of 716 patients with primary open angle glaucoma(POAG)with at least 5 reliable 24-2 test results and 2y of follow-up were selected.The functional GEE model was used to detect perimetric progression in the training dataset(501 eyes).In the testing dataset(215 eyes),progression was evaluated the functional GEE model,mean deviation(MD)and visual field index(VFI)rates of change,Advanced Glaucoma Intervention Study(AGIS)and Collaborative Initial Glaucoma Treatment Study(CIGTS)scores,and pointwise linear regression(PLR).RESULTS:The proposed method showed the highest proportion of eyes detected as progression(54.4%),followed by the VFI rate(34.4%),PLR(23.3%),and MD rate(21.4%).The CIGTS and AGIS scores had a lower proportion of eyes detected as progression(7.9%and 5.1%,respectively).The time to detection of progression was significantly shorter for the proposed method than that of other algorithms(adjusted P≤0.019).The VFI rate displayed moderate pairwise agreement with the proposed method(k=0.47).CONCLUSION:The functional GEE model shows the highest proportion of eyes detected as perimetric progression and the shortest time to detect perimetric progression in patients with POAG.
基金supported by the Science and Technology Project of the Headquarters of the State Grid Corporation(project code:5400-202323233A-1-1-ZN).
文摘With the increasing integration of emerging source-load types such as distributed photovoltaics,electric vehicles,and energy storage into distribution networks,the operational characteristics of these networks have evolved from traditional single-load centers to complex multi-source,multi-load systems.This transition not only increases the difficulty of effectively classifying distribution networks due to their heightened complexity but also renders traditional energy management approaches-primarily focused on economic objectives-insufficient to meet the growing demands for flexible scheduling and dynamic response.To address these challenges,this paper proposes an adaptive multi-objective energy management strategy that accounts for the distinct operational requirements of distribution networks with a high penetration of new-type source-loads.The goal is to establish a comprehensive energy management framework that optimally balances energy efficiency,carbon reduction,and economic performance in modern distribution networks.To enhance classification accuracy,the strategy constructs amulti-dimensional scenario classification model that integrates environmental and climatic factors by analyzing the operational characteristics of new-type distribution networks and incorporating expert knowledge.An improved split-coupling K-means preclustering algorithm is employed to classify distribution networks effectively.Based on the classification results,fuzzy logic control is then utilized to dynamically optimize the weighting of each objective,allowing for an adaptive adjustment of priorities to achieve a flexible and responsivemulti-objective energy management strategy.The effectiveness of the proposed approach is validated through practical case studies.Simulation results indicate that the proposed method improves classification accuracy by 18.18%compared to traditional classification methods and enhances energy savings and carbon reduction by 4.34%and 20.94%,respectively,compared to the fixed-weight strategy.
基金supported by the National Natural Science Foundation of China under Grant No.62471366。
文摘This article proposes a generalized strongly coupled resonator quartet(GSCRQ)filter along with its synthesis approach.By introducing out-of-band reflection zeros(RZs),the proposed GSCRQ can generate a transmission zero on each side of the passband without negative couplings.The coupling coefficients in this coupling structure change with the positions of the out-of-band RZs.Thus,the GSCRQ configuration admits flexible design solutions.For GSCRQ coaxial combline filters,all couplings can be implemented as inductive couplings,simplifying the design and manufacturing process.In this article,a 6-2 filter in the GSCRQ configuration is synthesized and designed.The simulated results of the designed filter agree very well with the theoretical characteristics.
基金supported by the Open Project of Xiangjiang Laboratory(22XJ02003)the National Natural Science Foundation of China(62122093,72071205)。
文摘Most multimodal multi-objective evolutionary algorithms(MMEAs)aim to find all global Pareto optimal sets(PSs)for a multimodal multi-objective optimization problem(MMOP).However,in real-world problems,decision makers(DMs)may be also interested in local PSs.Also,searching for both global and local PSs is more general in view of dealing with MMOPs,which can be seen as generalized MMOPs.Moreover,most state-of-theart MMEAs exhibit poor convergence on high-dimension MMOPs and are unable to deal with constrained MMOPs.To address the above issues,we present a novel multimodal multiobjective coevolutionary algorithm(Co MMEA)to better produce both global and local PSs,and simultaneously,to improve the convergence performance in dealing with high-dimension MMOPs.Specifically,the Co MMEA introduces two archives to the search process,and coevolves them simultaneously through effective knowledge transfer.The convergence archive assists the Co MMEA to quickly approach the Pareto optimal front.The knowledge of the converged solutions is then transferred to the diversity archive which utilizes the local convergence indicator and the-dominance-based method to obtain global and local PSs effectively.Experimental results show that Co MMEA is competitive compared to seven state-of-the-art MMEAs on fifty-four complex MMOPs.
基金supported by Science Challenge Project(No.TZ20180001)。
文摘Based on the generalized reduced R-matrix theory,the R-matrix analysis code(RAC program)was used to analyze the experimental data of all the nuclear reaction channels related to the 5 He system.The current calculations provide accurate and reliable evaluation data and are in good agreement with the experimental data.In this study,self-consistent evaluation data for each reaction were obtained using multi-channel and multi-energy fitting.In particular,the error propagation theory of generalized least squares was used to determine the error of the evaluation data and the covariance matrix of the integral cross section.This R-matrix analysis for the 5 He system has three features.First,for the first time,the error in the evaluation data of the T(d,n)^(4)He reaction cross section and the covariance matrix of the integral cross section are provided.Second,we used only one set of R-matrix parameters to depict the reaction cross section of each reaction channel of the 5 He system for the entire energy region in our work.Third,in this evaluation,we considered some of the latest measured experimental data,especially after 2000.The T(d,n)^(4)He reaction cross section at 0.1 MeV and below was carefully studied.The effect of different energy levels in T(d,n)^(4)He was analyzed,with the energy levels 3/2^(+)making a major contribution to the cross section,and the role of the S-wave and P-wave from 3/2~-determines the lean forward trend of the angular distributions at 0.01–0.1 MeV.
基金Supported by the National Natural Science Foundation of China(No.11172197 and No.11332008)a key-project grant from the Natural Science Foundation of Tianjin(No.010413595)
文摘This paper presents a numerical algorithm tuning aircraft landing gear control system with three objectives,including reducing relative vibration, reducing hydraulic strut force and controlling energy consumption. Sliding mode control is applied to the vibration control of a simplified landing gear model with uncertainty. A two-stage generalized cell mapping algorithm is applied to search the Pareto set with gradient-free scheme. Drop test simulations over uneven runway show that the vibration and force interaction can be considerably reduced, and the Pareto optimum form a tight range in time domain.
文摘The authors of this article are interested in characterization of efficient solutions for special classes of problems. These classes consider semi-strong E-convexity of involved functions. Sufficient and necessary conditions for a feasible solution to be an efficient or properly efficient solution are obtained.
基金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 Key R&D Program of China (2016YFC0402209)the Major Research Plan of the National Natural Science Foundation of China (No. 91647114)
文摘Due to the intermittency and instability of Wind-Solar energy and easy compensation of hydropower, this study proposes a Wind-Solar-Hydro power optimal scheduling model. This model is aimed at maximizing the total system power generation and the minimum ten-day joint output. To effectively optimize the multi-objective model, a new algorithm named non-dominated sorting culture differential evolution algorithm(NSCDE) is proposed. The feasibility of NSCDE was verified through several well-known benchmark problems. It was then applied to the Jinping Wind-Solar-Hydro complementary power generation system. The results demonstrate that NSCDE can provide decision makers a series of optimized scheduling schemes.
