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.展开更多
This paper investigates a distributed heterogeneous hybrid blocking flow-shop scheduling problem(DHHBFSP)designed to minimize the total tardiness and total energy consumption simultaneously,and proposes an improved pr...This paper investigates a distributed heterogeneous hybrid blocking flow-shop scheduling problem(DHHBFSP)designed to minimize the total tardiness and total energy consumption simultaneously,and proposes an improved proximal policy optimization(IPPO)method to make real-time decisions for the DHHBFSP.A multi-objective Markov decision process is modeled for the DHHBFSP,where the reward function is represented by a vector with dynamic weights instead of the common objectiverelated scalar value.A factory agent(FA)is formulated for each factory to select unscheduled jobs and is trained by the proposed IPPO to improve the decision quality.Multiple FAs work asynchronously to allocate jobs that arrive randomly at the shop.A two-stage training strategy is introduced in the IPPO,which learns from both single-and dual-policy data for better data utilization.The proposed IPPO is tested on randomly generated instances and compared with variants of the basic proximal policy optimization(PPO),dispatch rules,multi-objective metaheuristics,and multi-agent reinforcement learning methods.Extensive experimental results suggest that the proposed strategies offer significant improvements to the basic PPO,and the proposed IPPO outperforms the state-of-the-art scheduling methods in both convergence and solution quality.展开更多
Existing control systems for coiling temperature struggle with significant time lags and multi-objective synchronous control during cooling,limiting their temperature control accuracy.To overcome these drawbacks,an on...Existing control systems for coiling temperature struggle with significant time lags and multi-objective synchronous control during cooling,limiting their temperature control accuracy.To overcome these drawbacks,an online cooling system featuring multi-objective collaborative control is proposed.The proposed system achieves the synchronous control of the ultra-fast cooling temperature,middle temperature,and coiling temperature.First,the run-out table cooling zone is divided into multiple logical control zones,and traditional mechanism models are improved by introducing multiple heat flux adaptive coefficients.Then,a dynamic feedforward control method is developed to correct potential deviations in the calculation process.Finally,to enhance the proposed control system’s accuracy and self-learning capability,a multi-objective real-time adaptation strategy is introduced for dynamic heat flux adaptive coefficients adjustment.Analysis and application results show that the proposed multi-objective collaborative control system significantly improves the temperature control accuracy while ensuring the consistency of mechanical properties.Comparison results indicate that,under the proposed control system,the coiling temperature control accuracy within ±20℃ for segments located at 50 m from the strip head is improved by 26%,compared with the original control system.In addition,using the proposed system,the standard deviation of the yield strength is decreased by 38%,compared with the original control system.展开更多
In modern gas turbine engine control,Direct Thrust Control(DTC) is an effective method for achieving the desired thrust.Model Predictive Control(MPC) has the characteristics of handling constraints while accomplishing...In modern gas turbine engine control,Direct Thrust Control(DTC) is an effective method for achieving the desired thrust.Model Predictive Control(MPC) has the characteristics of handling constraints while accomplishing command tracking,making it a promising approach for implementing DTC.However,since the performance of DTC is highly sensitive to MPC's tuning parameters,developing an efficient optimization strategy for these parameters becomes imperative.Therefore,a Model Predictive Direct Thrust Control(MP-DTC) architecture is designed,and its asymptotic stability is proven.Additionally,the influence of the tuning parameters on control performance is analyzed.Then,a tuning strategy for MP-DTC architecture is proposed.This strategy combines the objectives of DTC to design a Multi-Objective Optimization(MOO) index function,and uses Multi-Objective Grey Wolf Optimizer(MOGWO) to solve its Pareto front and obtain the tuning parameters.In the Hardware-in-Loop(HIL) experiments,the proposed MPDTC architecture achieves the shortest settling time and smallest overshoot compared to the latest DTC scheme.Its MOGWO-based tuning strategy provides more Pareto-optimal solutions,ensuring optimal selection based on rapidity and stability,and maintains precise DTC even under component degradation and various operating conditions,thereby providing robustness,optimality,and generalizability.展开更多
The current inertial measurement unit(IMU)and odometry fusion navigation algorithms often incorporate non-holonomic constraints(NHC)to obtain three-dimensional velocity in the navigation frame.However,due to the integ...The current inertial measurement unit(IMU)and odometry fusion navigation algorithms often incorporate non-holonomic constraints(NHC)to obtain three-dimensional velocity in the navigation frame.However,due to the integral nature of the dead reckoning algorithm,the attitude errors of the IMU accumulate over time,causing the velocity transformation results to fail to accurately reflect the threedimensional velocity in the navigation frame.Based on the fact that during a vehicle's horizontal and uniform motion,the vertical acceleration is consistent with gravitational acceleration,this paper proposes an IMU/odometry fusion navigation algorithm based on horizontal attitude constraints(HAC).Building on non-holonomic constraints,this algorithm determines the motion state of the vehicle through accelerometer output and zeroes out the pitch and roll angles during horizontal and uniform motion.Verified through two sets of real-world vehicle test data,this algorithm improves horizontal positioning accuracy by approximately 63%and 70%,and vertical positioning accuracy by 98%and 97%,compared with the traditional NHC IMU/odometer fusion algorithm.展开更多
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.展开更多
Submodular optimization is primarily applied in multi-agent systems for tasks such as resource allocation,task assignment,collaborative decision-making,and optimization problems.Maximization of optimizing submodular s...Submodular optimization is primarily applied in multi-agent systems for tasks such as resource allocation,task assignment,collaborative decision-making,and optimization problems.Maximization of optimizing submodular set functions attracts much attention since the 1970s.A large body of work has been done using approximation algorithms.When the dimension of the independent variable of the set function changes from one tok,it is called ak-submodular set function.Thek-submodular set function,a generalization of the classical submodular set function,arises in diverse fields with varied applications.In many practical scenarios,quantifying the degree of closeness to submodularity becomes essential,leading to concepts such as approximately submodular set functions and the diminishing-return(DR) ratio.This paper investigates ak-dimensional set function under matroid constraints,which may lack full submodularity.Instead,we focus on an approximately non-ksubmodular set function characterized by its DR ratio.Employing a greedy algorithmic approach,we derive an approximation guarantee for this problem.Notably,when the DR ratio is set to one,our results align with existing findings in the literature.Experimental results demonstrate the superiority of our algorithm over the baselines.展开更多
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.展开更多
The stress minimization multi-material topology optimization(MMTO)approach has recently attracted significant attention because of its applications in aerospace and mechanical engineering.Nonetheless,the stress minimi...The stress minimization multi-material topology optimization(MMTO)approach has recently attracted significant attention because of its applications in aerospace and mechanical engineering.Nonetheless,the stress minimization MMTO approach may result in stress surpassing the material's tolerance limit,potentially culminating in failure.This research proposes a novel way for imposing stress constraints on each material to regulate their respective stress levels.The fundamental concept is that each material possesses its own interpolation function for the stress model.The maximum von Mises stress for each material can be established with the definition of an upper limit,ensuring that the materials will perform safely and effectively.This aids topological structures in resisting failure and augmenting strength.A multi-physics system including thermoelastic and self-weight loads is concurrently examined alongside stress limitations.The global stress constraint utilizes the p-norm function,and the adjoint method is used to derive sensitivity.This work employs a three-field strategy utilizing density filtering and Heaviside projection functions to mitigate the artificial stress in low density.The technique is assessed through two-dimensional(2D)and three-dimensional(3D)examples,illustrating the influence of stress limits on the compliance minimization under heat and self-weight loads.The optimized results indicate a substantial decrease in the stress levels accompanied by a minor gain in compliance,while maintaining the stress within the specified range for all materials.展开更多
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.展开更多
With the widespread application of combined heat and power(CHP)units,the economic dispatch of integrated electric and district heating systems(IEHSs)has drawn increasing attention.Because the electric power system(EPS...With the widespread application of combined heat and power(CHP)units,the economic dispatch of integrated electric and district heating systems(IEHSs)has drawn increasing attention.Because the electric power system(EPS)and district heating system(DHS)are generally managed separately,the decentralized dispatch pattern is preferable for the IEHS dispatch problem.However,many common decentralized methods suffer from the drawbacks of slow and local convergence.Moreover,the uncertainties of renewable generation cannot be ignored in a decentralized pattern.Additionally,the most commonly used individual chance constraints in distributionally robust optimization cannot consider safety constraints simultaneously,so the safe operation of an IEHS cannot be guaranteed.Thus,distributionally robust joint chance constraints and robust constraints are jointly introduced into the IEHS dispatch problem in this paper to obtain a stronger safety guarantee,and a method combined with Bonferroni and conditional value at risk(CVaR)approximation is presented to transform the original model into a quadratic program.Additionally,a dynamic boundary response(DBR)-based distributed algorithm based on multiparametric programming is proposed for a fast solution.Case studies showcase the necessity of using mixed distributionally robust joint chance constraints and robust constraints,as well as the effectiveness of the DBR algorithm.展开更多
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.展开更多
Constrained multi-objective optimization problems(CMOPs)generally contain multiple constraints,which not only form multiple discrete feasible regions but also reduce the size of optimal feasible regions,thus they prop...Constrained multi-objective optimization problems(CMOPs)generally contain multiple constraints,which not only form multiple discrete feasible regions but also reduce the size of optimal feasible regions,thus they propose serious challenges for solvers.Among all constraints,some constraints are highly correlated with optimal feasible regions;thus they can provide effective help to find feasible Pareto front.However,most of the existing constrained multi-objective evolutionary algorithms tackle constraints by regarding all constraints as a whole or directly ignoring all constraints,and do not consider judging the relations among constraints and do not utilize the information from promising single constraints.Therefore,this paper attempts to identify promising single constraints and utilize them to help solve CMOPs.To be specific,a CMOP is transformed into a multitasking optimization problem,where multiple auxiliary tasks are created to search for the Pareto fronts that only consider a single constraint respectively.Besides,an auxiliary task priority method is designed to identify and retain some high-related auxiliary tasks according to the information of relative positions and dominance relationships.Moreover,an improved tentative method is designed to find and transfer useful knowledge among tasks.Experimental results on three benchmark test suites and 11 realworld problems with different numbers of constraints show better or competitive performance of the proposed method when compared with eight state-of-the-art peer methods.展开更多
The distributed flexible job shop scheduling problem(DFJSP)has attracted great attention with the growth of the global manufacturing industry.General DFJSP research only considers machine constraints and ignores worke...The distributed flexible job shop scheduling problem(DFJSP)has attracted great attention with the growth of the global manufacturing industry.General DFJSP research only considers machine constraints and ignores worker constraints.As one critical factor of production,effective utilization of worker resources can increase productivity.Meanwhile,energy consumption is a growing concern due to the increasingly serious environmental issues.Therefore,the distributed flexible job shop scheduling problem with dual resource constraints(DFJSP-DRC)for minimizing makespan and total energy consumption is studied in this paper.To solve the problem,we present a multi-objective mathematical model for DFJSP-DRC and propose a Q-learning-based multi-objective grey wolf optimizer(Q-MOGWO).In Q-MOGWO,high-quality initial solutions are generated by a hybrid initialization strategy,and an improved active decoding strategy is designed to obtain the scheduling schemes.To further enhance the local search capability and expand the solution space,two wolf predation strategies and three critical factory neighborhood structures based on Q-learning are proposed.These strategies and structures enable Q-MOGWO to explore the solution space more efficiently and thus find better Pareto solutions.The effectiveness of Q-MOGWO in addressing DFJSP-DRC is verified through comparison with four algorithms using 45 instances.The results reveal that Q-MOGWO outperforms comparison algorithms in terms of solution quality.展开更多
This study presented a multi-objective linear fractional inventory (LFI) problem with generalised intuitionistic fuzzy numbers. In modelling, the authors have assumed the ambiances where generalised trapezoidal intuit...This study presented a multi-objective linear fractional inventory (LFI) problem with generalised intuitionistic fuzzy numbers. In modelling, the authors have assumed the ambiances where generalised trapezoidal intuitionistic fuzzy numbers (GTIFNs) used to handle the uncertain information in the data. Then, the given multi-objective generalised intuitionistic fuzzy LFI model was transformed into its equivalent deterministic linear fractional programming problem by employing the possibility and necessity measures. Finally, the applicability of the model is demonstrated with a numerical example and the sensitivity analysis under several parameters is investigated to explore the study.展开更多
基金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.
基金partially supported by the National Key Research and Development Program of the Ministry of Science and Technology of China(2022YFE0114200)the National Natural Science Foundation of China(U20A6004).
文摘This paper investigates a distributed heterogeneous hybrid blocking flow-shop scheduling problem(DHHBFSP)designed to minimize the total tardiness and total energy consumption simultaneously,and proposes an improved proximal policy optimization(IPPO)method to make real-time decisions for the DHHBFSP.A multi-objective Markov decision process is modeled for the DHHBFSP,where the reward function is represented by a vector with dynamic weights instead of the common objectiverelated scalar value.A factory agent(FA)is formulated for each factory to select unscheduled jobs and is trained by the proposed IPPO to improve the decision quality.Multiple FAs work asynchronously to allocate jobs that arrive randomly at the shop.A two-stage training strategy is introduced in the IPPO,which learns from both single-and dual-policy data for better data utilization.The proposed IPPO is tested on randomly generated instances and compared with variants of the basic proximal policy optimization(PPO),dispatch rules,multi-objective metaheuristics,and multi-agent reinforcement learning methods.Extensive experimental results suggest that the proposed strategies offer significant improvements to the basic PPO,and the proposed IPPO outperforms the state-of-the-art scheduling methods in both convergence and solution quality.
基金financially supported by the National Key Research and Development Program of China(2022YFB3304800)the National Natural Science Foundation of China(Nos.52074085 and U21A20117).
文摘Existing control systems for coiling temperature struggle with significant time lags and multi-objective synchronous control during cooling,limiting their temperature control accuracy.To overcome these drawbacks,an online cooling system featuring multi-objective collaborative control is proposed.The proposed system achieves the synchronous control of the ultra-fast cooling temperature,middle temperature,and coiling temperature.First,the run-out table cooling zone is divided into multiple logical control zones,and traditional mechanism models are improved by introducing multiple heat flux adaptive coefficients.Then,a dynamic feedforward control method is developed to correct potential deviations in the calculation process.Finally,to enhance the proposed control system’s accuracy and self-learning capability,a multi-objective real-time adaptation strategy is introduced for dynamic heat flux adaptive coefficients adjustment.Analysis and application results show that the proposed multi-objective collaborative control system significantly improves the temperature control accuracy while ensuring the consistency of mechanical properties.Comparison results indicate that,under the proposed control system,the coiling temperature control accuracy within ±20℃ for segments located at 50 m from the strip head is improved by 26%,compared with the original control system.In addition,using the proposed system,the standard deviation of the yield strength is decreased by 38%,compared with the original control system.
基金supported by the National Natural Science Foundation of China(No.52372371)。
文摘In modern gas turbine engine control,Direct Thrust Control(DTC) is an effective method for achieving the desired thrust.Model Predictive Control(MPC) has the characteristics of handling constraints while accomplishing command tracking,making it a promising approach for implementing DTC.However,since the performance of DTC is highly sensitive to MPC's tuning parameters,developing an efficient optimization strategy for these parameters becomes imperative.Therefore,a Model Predictive Direct Thrust Control(MP-DTC) architecture is designed,and its asymptotic stability is proven.Additionally,the influence of the tuning parameters on control performance is analyzed.Then,a tuning strategy for MP-DTC architecture is proposed.This strategy combines the objectives of DTC to design a Multi-Objective Optimization(MOO) index function,and uses Multi-Objective Grey Wolf Optimizer(MOGWO) to solve its Pareto front and obtain the tuning parameters.In the Hardware-in-Loop(HIL) experiments,the proposed MPDTC architecture achieves the shortest settling time and smallest overshoot compared to the latest DTC scheme.Its MOGWO-based tuning strategy provides more Pareto-optimal solutions,ensuring optimal selection based on rapidity and stability,and maintains precise DTC even under component degradation and various operating conditions,thereby providing robustness,optimality,and generalizability.
基金from the National Key Research and Development Program project"Adaptive Navigation Software and Hardware Technology(2018YFB0505200)."。
文摘The current inertial measurement unit(IMU)and odometry fusion navigation algorithms often incorporate non-holonomic constraints(NHC)to obtain three-dimensional velocity in the navigation frame.However,due to the integral nature of the dead reckoning algorithm,the attitude errors of the IMU accumulate over time,causing the velocity transformation results to fail to accurately reflect the threedimensional velocity in the navigation frame.Based on the fact that during a vehicle's horizontal and uniform motion,the vertical acceleration is consistent with gravitational acceleration,this paper proposes an IMU/odometry fusion navigation algorithm based on horizontal attitude constraints(HAC).Building on non-holonomic constraints,this algorithm determines the motion state of the vehicle through accelerometer output and zeroes out the pitch and roll angles during horizontal and uniform motion.Verified through two sets of real-world vehicle test data,this algorithm improves horizontal positioning accuracy by approximately 63%and 70%,and vertical positioning accuracy by 98%and 97%,compared with the traditional NHC IMU/odometer fusion algorithm.
基金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 Natural Science Foundation of Shandong Province (No.ZR2023MA031)the Natural Science Foundation of China (No.12201619)。
文摘Submodular optimization is primarily applied in multi-agent systems for tasks such as resource allocation,task assignment,collaborative decision-making,and optimization problems.Maximization of optimizing submodular set functions attracts much attention since the 1970s.A large body of work has been done using approximation algorithms.When the dimension of the independent variable of the set function changes from one tok,it is called ak-submodular set function.Thek-submodular set function,a generalization of the classical submodular set function,arises in diverse fields with varied applications.In many practical scenarios,quantifying the degree of closeness to submodularity becomes essential,leading to concepts such as approximately submodular set functions and the diminishing-return(DR) ratio.This paper investigates ak-dimensional set function under matroid constraints,which may lack full submodularity.Instead,we focus on an approximately non-ksubmodular set function characterized by its DR ratio.Employing a greedy algorithmic approach,we derive an approximation guarantee for this problem.Notably,when the DR ratio is set to one,our results align with existing findings in the literature.Experimental results demonstrate the superiority of our algorithm over the baselines.
文摘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.
基金Project supported by the National Research Foundation of Korea(NRF)grant funded by the Korea government(MSIT)(No.RS-2025-02303676)。
文摘The stress minimization multi-material topology optimization(MMTO)approach has recently attracted significant attention because of its applications in aerospace and mechanical engineering.Nonetheless,the stress minimization MMTO approach may result in stress surpassing the material's tolerance limit,potentially culminating in failure.This research proposes a novel way for imposing stress constraints on each material to regulate their respective stress levels.The fundamental concept is that each material possesses its own interpolation function for the stress model.The maximum von Mises stress for each material can be established with the definition of an upper limit,ensuring that the materials will perform safely and effectively.This aids topological structures in resisting failure and augmenting strength.A multi-physics system including thermoelastic and self-weight loads is concurrently examined alongside stress limitations.The global stress constraint utilizes the p-norm function,and the adjoint method is used to derive sensitivity.This work employs a three-field strategy utilizing density filtering and Heaviside projection functions to mitigate the artificial stress in low density.The technique is assessed through two-dimensional(2D)and three-dimensional(3D)examples,illustrating the influence of stress limits on the compliance minimization under heat and self-weight loads.The optimized results indicate a substantial decrease in the stress levels accompanied by a minor gain in compliance,while maintaining the stress within the specified range for all materials.
基金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 Foundation of China(52377107,52007105)and the Taishan Scholars Program.
文摘With the widespread application of combined heat and power(CHP)units,the economic dispatch of integrated electric and district heating systems(IEHSs)has drawn increasing attention.Because the electric power system(EPS)and district heating system(DHS)are generally managed separately,the decentralized dispatch pattern is preferable for the IEHS dispatch problem.However,many common decentralized methods suffer from the drawbacks of slow and local convergence.Moreover,the uncertainties of renewable generation cannot be ignored in a decentralized pattern.Additionally,the most commonly used individual chance constraints in distributionally robust optimization cannot consider safety constraints simultaneously,so the safe operation of an IEHS cannot be guaranteed.Thus,distributionally robust joint chance constraints and robust constraints are jointly introduced into the IEHS dispatch problem in this paper to obtain a stronger safety guarantee,and a method combined with Bonferroni and conditional value at risk(CVaR)approximation is presented to transform the original model into a quadratic program.Additionally,a dynamic boundary response(DBR)-based distributed algorithm based on multiparametric programming is proposed for a fast solution.Case studies showcase the necessity of using mixed distributionally robust joint chance constraints and robust constraints,as well as the effectiveness of the DBR algorithm.
基金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.
基金supported in part by the National Key Research and Development Program of China(2022YFD2001200)the National Natural Science Foundation of China(62176238,61976237,62206251,62106230)+3 种基金China Postdoctoral Science Foundation(2021T140616,2021M692920)the Natural Science Foundation of Henan Province(222300420088)the Program for Science&Technology Innovation Talents in Universities of Henan Province(23HASTIT023)the Program for Science&Technology Innovation Teams in Universities of Henan Province(23IRTSTHN010).
文摘Constrained multi-objective optimization problems(CMOPs)generally contain multiple constraints,which not only form multiple discrete feasible regions but also reduce the size of optimal feasible regions,thus they propose serious challenges for solvers.Among all constraints,some constraints are highly correlated with optimal feasible regions;thus they can provide effective help to find feasible Pareto front.However,most of the existing constrained multi-objective evolutionary algorithms tackle constraints by regarding all constraints as a whole or directly ignoring all constraints,and do not consider judging the relations among constraints and do not utilize the information from promising single constraints.Therefore,this paper attempts to identify promising single constraints and utilize them to help solve CMOPs.To be specific,a CMOP is transformed into a multitasking optimization problem,where multiple auxiliary tasks are created to search for the Pareto fronts that only consider a single constraint respectively.Besides,an auxiliary task priority method is designed to identify and retain some high-related auxiliary tasks according to the information of relative positions and dominance relationships.Moreover,an improved tentative method is designed to find and transfer useful knowledge among tasks.Experimental results on three benchmark test suites and 11 realworld problems with different numbers of constraints show better or competitive performance of the proposed method when compared with eight state-of-the-art peer methods.
基金supported by the Natural Science Foundation of Anhui Province(Grant Number 2208085MG181)the Science Research Project of Higher Education Institutions in Anhui Province,Philosophy and Social Sciences(Grant Number 2023AH051063)the Open Fund of Key Laboratory of Anhui Higher Education Institutes(Grant Number CS2021-ZD01).
文摘The distributed flexible job shop scheduling problem(DFJSP)has attracted great attention with the growth of the global manufacturing industry.General DFJSP research only considers machine constraints and ignores worker constraints.As one critical factor of production,effective utilization of worker resources can increase productivity.Meanwhile,energy consumption is a growing concern due to the increasingly serious environmental issues.Therefore,the distributed flexible job shop scheduling problem with dual resource constraints(DFJSP-DRC)for minimizing makespan and total energy consumption is studied in this paper.To solve the problem,we present a multi-objective mathematical model for DFJSP-DRC and propose a Q-learning-based multi-objective grey wolf optimizer(Q-MOGWO).In Q-MOGWO,high-quality initial solutions are generated by a hybrid initialization strategy,and an improved active decoding strategy is designed to obtain the scheduling schemes.To further enhance the local search capability and expand the solution space,two wolf predation strategies and three critical factory neighborhood structures based on Q-learning are proposed.These strategies and structures enable Q-MOGWO to explore the solution space more efficiently and thus find better Pareto solutions.The effectiveness of Q-MOGWO in addressing DFJSP-DRC is verified through comparison with four algorithms using 45 instances.The results reveal that Q-MOGWO outperforms comparison algorithms in terms of solution quality.
文摘This study presented a multi-objective linear fractional inventory (LFI) problem with generalised intuitionistic fuzzy numbers. In modelling, the authors have assumed the ambiances where generalised trapezoidal intuitionistic fuzzy numbers (GTIFNs) used to handle the uncertain information in the data. Then, the given multi-objective generalised intuitionistic fuzzy LFI model was transformed into its equivalent deterministic linear fractional programming problem by employing the possibility and necessity measures. Finally, the applicability of the model is demonstrated with a numerical example and the sensitivity analysis under several parameters is investigated to explore the study.
