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.展开更多
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.展开更多
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.展开更多
Visible lighting and energy-saving are dual needs of energy efficiency and occupant comfort in modern buildings.In this study,a smart window based on phase-change material VO_(2) is designed and optimized to address t...Visible lighting and energy-saving are dual needs of energy efficiency and occupant comfort in modern buildings.In this study,a smart window based on phase-change material VO_(2) is designed and optimized to address the critical challenges in building energy management.The proposed phase-adaptive radiative(PAR)coating is a multilayer nanostructure consisting of TiO/VO_(2)2/TiO/Ag_(2) and polydimethylsiloxane(PDMS).For different VO_(2) phases,visible transmittance T_(vis)>0.6 and emissivity difference in the atmospheric window Δε_(AW)=0.422 can be achieved,which means the PAR window can transfer interior heat to the outside through thermal radiation for cooling or minimize thermal emission for insulation,while ensuring the transmission of visible light for natural daylighting.Compared to normal glass,the PAR window has an average temperature drop of 14.8℃.The year-round energy-saving calculation for four different cities in China indicates that the PAR window can save 22%-32% of the annual cooling and heating energy consumption by seamlessly transitioning between two phases of VO_(2)modes.The multi-objective optimization of the phase-adaptive radiative smart window provides a potential strategy for energy saving.展开更多
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.展开更多
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.展开更多
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.展开更多
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.展开更多
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.展开更多
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.展开更多
With the development of renewable energy technologies such as photovoltaics and wind power,it has become a research hotspot to improve the consumption rate of new energy and reduce energy costs through algorithm impro...With the development of renewable energy technologies such as photovoltaics and wind power,it has become a research hotspot to improve the consumption rate of new energy and reduce energy costs through algorithm improvement.To reduce the operational costs of micro-grid systems and the energy abandonment rate of renewable energy,while simultaneously enhancing user satisfaction on the demand side,this paper introduces an improvedmultiobjective Grey Wolf Optimizer based on Cauchy variation.The proposed approach incorporates a Cauchy variation strategy during the optimizer’s search phase to expand its exploration range and minimize the likelihood of becoming trapped in local optima.At the same time,adoptingmultiple energy storage methods to improve the consumption rate of renewable energy.Subsequently,under different energy balance orders,themulti-objective particle swarmalgorithm,multi-objective grey wolf optimizer,and Cauchy’s variant of the improvedmulti-objective grey wolf optimizer are used for example simulation,solving the Pareto solution set of the model and comparing.The analysis of the results reveals that,compared to the original optimizer,the improved optimizer decreases the daily cost by approximately 100 yuan,and reduces the energy abandonment rate to zero.Meanwhile,it enhances user satisfaction and ensures the stable operation of the micro-grid.展开更多
This paper introduces a hybrid multi-objective optimization algorithm,designated HMODESFO,which amalgamates the exploratory prowess of Differential Evolution(DE)with the rapid convergence attributes of the Sailfish Op...This paper introduces a hybrid multi-objective optimization algorithm,designated HMODESFO,which amalgamates the exploratory prowess of Differential Evolution(DE)with the rapid convergence attributes of the Sailfish Optimization(SFO)algorithm.The primary objective is to address multi-objective optimization challenges within mechanical engineering,with a specific emphasis on planetary gearbox optimization.The algorithm is equipped with the ability to dynamically select the optimal mutation operator,contingent upon an adaptive normalized population spacing parameter.The efficacy of HMODESFO has been substantiated through rigorous validation against estab-lished industry benchmarks,including a suite of Zitzler-Deb-Thiele(ZDT)and Zeb-Thiele-Laumanns-Zitzler(DTLZ)problems,where it exhibited superior performance.The outcomes underscore the algorithm’s markedly enhanced optimization capabilities relative to existing methods,particularly in tackling highly intricate multi-objective planetary gearbox optimization problems.Additionally,the performance of HMODESFO is evaluated against selected well-known mechanical engineering test problems,further accentuating its adeptness in resolving complex optimization challenges within this domain.展开更多
This paper introduces the Surrogate-assisted Multi-objective Grey Wolf Optimizer(SMOGWO)as a novel methodology for addressing the complex problem of empty-heavy train allocation,with a focus on line utilization balanc...This paper introduces the Surrogate-assisted Multi-objective Grey Wolf Optimizer(SMOGWO)as a novel methodology for addressing the complex problem of empty-heavy train allocation,with a focus on line utilization balance.By integrating surrogate models to approximate the objective functions,SMOGWO significantly improves the efficiency and accuracy of the optimization process.The effectiveness of this approach is evaluated using the CEC2009 multi-objective test function suite,where SMOGWO achieves a superiority rate of 76.67%compared to other leading multi-objective algorithms.Furthermore,the practical applicability of SMOGWO is demonstrated through a case study on empty and heavy train allocation,which validates its ability to balance line capacity,minimize transportation costs,and optimize the technical combination of heavy trains.The research highlights SMOGWO's potential as a robust solution for optimization challenges in railway transportation,offering valuable contributions toward enhancing operational efficiency and promoting sustainable development in the sector.展开更多
In the independent electro-hydrogen system(IEHS)with hybrid energy storage(HESS),achieving optimal scheduling is crucial.Still,it presents a challenge due to the significant deviations in values ofmultiple optimizatio...In the independent electro-hydrogen system(IEHS)with hybrid energy storage(HESS),achieving optimal scheduling is crucial.Still,it presents a challenge due to the significant deviations in values ofmultiple optimization objective functions caused by their physical dimensions.These deviations seriously affect the scheduling process.A novel standardization fusion method has been established to address this issue by analyzing the variation process of each objective function’s values.The optimal scheduling results of IEHS with HESS indicate that the economy and overall energy loss can be improved 2–3 times under different optimization methods.The proposed method better balances all optimization objective functions and reduces the impact of their dimensionality.When the cost of BESS decreases by approximately 30%,its participation deepens by about 1 time.Moreover,if the price of the electrolyzer is less than 15¥/kWh or if the cost of the fuel cell drops below 4¥/kWh,their participation will increase substantially.This study aims to provide a more reasonable approach to solving multi-objective optimization problems.展开更多
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.展开更多
The vehicle routing and scheduling (VRS) problem with multi-objective and multi-constraint is analyzed, considering the complexity of the modern logistics in city economy and daily life based on the system engineering...The vehicle routing and scheduling (VRS) problem with multi-objective and multi-constraint is analyzed, considering the complexity of the modern logistics in city economy and daily life based on the system engineering. The objective and constraint includes loading, the dispatch and arrival time, transportation conditions,total cost,etc. An information model and a mathematical model are built,and a method based on knowledge and biologic immunity is put forward for optimizing and evaluating the programs dimensions in vehicle routing and scheduling with multi-objective and multi-constraints. The proposed model and method are illustrated in a case study concerning a transport network, and the result shows that more optimization solutions can be easily obtained and the method is efficient and feasible. Comparing with the standard GA and the standard GA without time constraint,the computational time of the algorithm is less in this paper. And the probability of gaining optimal solution is bigger and the result is better under the condition of multi-constraint.展开更多
Energy saving and emission reduction for railway systems should not only be studied from a technical perspective but should also be focused on management and economics. On the basis of relevant trainscheduling models ...Energy saving and emission reduction for railway systems should not only be studied from a technical perspective but should also be focused on management and economics. On the basis of relevant trainscheduling models for train operation management, in this paper we introduce an extended multi-objective trainscheduling optimization model considering locomotive assignment and segment emission constraints for energy saving. The objective of setting up this model is to reduce the energy and emission cost as well as total passenger- time. The decision variables include continuous variables such as train arrival and departure time, and binary vari- ables such as locomotive assignment and segment occu- pancy. The constraints are concerned with train movement, trip time, headway, and segment emission, etc. To obtain a non-dominated satisfactory solution on these objectives, a fuzzy multi-objective optimization algorithm is employed to solve the model. Finally, a numerical example is performed and used to compare the proposed model with the existing model. The results show that the proposed model can reduce the energy consumption, meet exhausts emission demands effectively by optimal locomotive assignment, and its solution methodology is effective.展开更多
Multi-instance image generation remains a challenging task in the field of computer vision.While existing diffusionmodels demonstrate impressive fidelity in image generation,they often struggle with precisely controll...Multi-instance image generation remains a challenging task in the field of computer vision.While existing diffusionmodels demonstrate impressive fidelity in image generation,they often struggle with precisely controlling each object’s shape,pose,and size.Methods like layout-to-image and mask-to-image provide spatial guidance but frequently suffer from object shape distortion,overlaps,and poor consistency,particularly in complex scenes with multiple objects.To address these issues,we introduce PolyDiffusion,a contour-based diffusion framework that encodes each object’s contour as a boundary-coordinate sequence,decoupling object shapes and positions.This approach allows for better control over object geometry and spatial positioning,which is critical for achieving high-quality multiinstance generation.We formulate the training process as a multi-objective optimization problem,balancing three key objectives:a denoising diffusion loss to maintain overall image fidelity,a cross-attention contour alignment loss to ensure precise shape adherence,and a reward-guided denoising objective that minimizes the Fréchet distance to real images.In addition,the Object Space-Aware Attention module fuses contour tokens with visual features,while a prior-guided fusion mechanism utilizes inter-object spatial relationships and class semantics to enhance consistency across multiple objects.Experimental results on benchmark datasets such as COCO-Stuff and VOC-2012 demonstrate that PolyDiffusion significantly outperforms existing layout-to-image and mask-to-image methods,achieving notable improvements in both image quality and instance-level segmentation accuracy.The implementation of Poly Diffusion is available at https://github.com/YYYYYJS/PolyDiffusion(accessed on 06 August 2025).展开更多
Robot-automated spraying is widely used in various fields,such as the automotive,metalworking,furniture,and aero-space industries.Spraying quality is influenced by multiple factors,including robot speed,acceleration,e...Robot-automated spraying is widely used in various fields,such as the automotive,metalworking,furniture,and aero-space industries.Spraying quality is influenced by multiple factors,including robot speed,acceleration,end-effector trajectory,and spraying process constraints.To achieve high-quality spraying under the influence of multiple factors,this study proposes a multi-objective optimization method for the spraying trajectory that integrates spraying process constraints into the optimization process.First,a 7-degree-of-freedom rigid-flexible coupling serial spray painting robot system is introduced,which includes a motion decoupling mechanism and a tension amplification mechanism.Subsequently,a paint deposition model for the spray gun was established,and the influence of process constraints on spraying quality was analyzed.Trajectory planning for the spray painting robot,based on the septic B-spline interpolation method,was then performed.Based on this foundation,objective functions and constraint equations for spraying trajectory optimization were established.A multi-objective trajectory optimization method for spraying by the robot is proposed based on the NSGA-Ⅱ,which integrates the spraying process constraints.Finally,a prototype system of a 7-degree-of-freedom rigid-flexible coupling serial spray painting robot was constructed.Simulations and spraying experiments were conducted to verify the effectiveness of the proposed multi-objective trajectory optimization method.This paper presents a multi-objective optimization method for the spraying trajectory of a robot.In the proposed method,the optimized spraying trajectory is generated with the spraying process as the constraint and time,energy consumption,and impact during the spraying operation of the robot as the optimization objectives.展开更多
基金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.
文摘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.
文摘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 Fundamental Research Funds for the Provincial Universities (Grant No.2024-KYYWF-0141)the National Natural Science Foundation of China (Grant Nos.52406076,52227813)+1 种基金the National Key Research and Development Program of China (Grant No.2022YFE0133900)the China Postdoctoral Science Foundation (Grant No.2023M740905)。
文摘Visible lighting and energy-saving are dual needs of energy efficiency and occupant comfort in modern buildings.In this study,a smart window based on phase-change material VO_(2) is designed and optimized to address the critical challenges in building energy management.The proposed phase-adaptive radiative(PAR)coating is a multilayer nanostructure consisting of TiO/VO_(2)2/TiO/Ag_(2) and polydimethylsiloxane(PDMS).For different VO_(2) phases,visible transmittance T_(vis)>0.6 and emissivity difference in the atmospheric window Δε_(AW)=0.422 can be achieved,which means the PAR window can transfer interior heat to the outside through thermal radiation for cooling or minimize thermal emission for insulation,while ensuring the transmission of visible light for natural daylighting.Compared to normal glass,the PAR window has an average temperature drop of 14.8℃.The year-round energy-saving calculation for four different cities in China indicates that the PAR window can save 22%-32% of the annual cooling and heating energy consumption by seamlessly transitioning between two phases of VO_(2)modes.The multi-objective optimization of the phase-adaptive radiative smart window provides a potential strategy for energy saving.
基金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.
基金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.
基金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.
基金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.
基金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 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 Open Fund of Guangxi Key Laboratory of Building New Energy and Energy Conservation(Project Number:Guike Energy 17-J-21-3).
文摘With the development of renewable energy technologies such as photovoltaics and wind power,it has become a research hotspot to improve the consumption rate of new energy and reduce energy costs through algorithm improvement.To reduce the operational costs of micro-grid systems and the energy abandonment rate of renewable energy,while simultaneously enhancing user satisfaction on the demand side,this paper introduces an improvedmultiobjective Grey Wolf Optimizer based on Cauchy variation.The proposed approach incorporates a Cauchy variation strategy during the optimizer’s search phase to expand its exploration range and minimize the likelihood of becoming trapped in local optima.At the same time,adoptingmultiple energy storage methods to improve the consumption rate of renewable energy.Subsequently,under different energy balance orders,themulti-objective particle swarmalgorithm,multi-objective grey wolf optimizer,and Cauchy’s variant of the improvedmulti-objective grey wolf optimizer are used for example simulation,solving the Pareto solution set of the model and comparing.The analysis of the results reveals that,compared to the original optimizer,the improved optimizer decreases the daily cost by approximately 100 yuan,and reduces the energy abandonment rate to zero.Meanwhile,it enhances user satisfaction and ensures the stable operation of the micro-grid.
基金supported by the Serbian Ministry of Education and Science under Grant No.TR35006 and COST Action:CA23155—A Pan-European Network of Ocean Tribology(OTC)The research of B.Rosic and M.Rosic was supported by the Serbian Ministry of Education and Science under Grant TR35029.
文摘This paper introduces a hybrid multi-objective optimization algorithm,designated HMODESFO,which amalgamates the exploratory prowess of Differential Evolution(DE)with the rapid convergence attributes of the Sailfish Optimization(SFO)algorithm.The primary objective is to address multi-objective optimization challenges within mechanical engineering,with a specific emphasis on planetary gearbox optimization.The algorithm is equipped with the ability to dynamically select the optimal mutation operator,contingent upon an adaptive normalized population spacing parameter.The efficacy of HMODESFO has been substantiated through rigorous validation against estab-lished industry benchmarks,including a suite of Zitzler-Deb-Thiele(ZDT)and Zeb-Thiele-Laumanns-Zitzler(DTLZ)problems,where it exhibited superior performance.The outcomes underscore the algorithm’s markedly enhanced optimization capabilities relative to existing methods,particularly in tackling highly intricate multi-objective planetary gearbox optimization problems.Additionally,the performance of HMODESFO is evaluated against selected well-known mechanical engineering test problems,further accentuating its adeptness in resolving complex optimization challenges within this domain.
基金supported by the National Natural Science Foundation of China(Project No.5217232152102391)+2 种基金Sichuan Province Science and Technology Innovation Talent Project(2024JDRC0020)China Shenhua Energy Company Limited Technology Project(GJNY-22-7/2300-K1220053)Key science and technology projects in the transportation industry of the Ministry of Transport(2022-ZD7-132).
文摘This paper introduces the Surrogate-assisted Multi-objective Grey Wolf Optimizer(SMOGWO)as a novel methodology for addressing the complex problem of empty-heavy train allocation,with a focus on line utilization balance.By integrating surrogate models to approximate the objective functions,SMOGWO significantly improves the efficiency and accuracy of the optimization process.The effectiveness of this approach is evaluated using the CEC2009 multi-objective test function suite,where SMOGWO achieves a superiority rate of 76.67%compared to other leading multi-objective algorithms.Furthermore,the practical applicability of SMOGWO is demonstrated through a case study on empty and heavy train allocation,which validates its ability to balance line capacity,minimize transportation costs,and optimize the technical combination of heavy trains.The research highlights SMOGWO's potential as a robust solution for optimization challenges in railway transportation,offering valuable contributions toward enhancing operational efficiency and promoting sustainable development in the sector.
基金sponsored by R&D Program of Beijing Municipal Education Commission(KM202410009013).
文摘In the independent electro-hydrogen system(IEHS)with hybrid energy storage(HESS),achieving optimal scheduling is crucial.Still,it presents a challenge due to the significant deviations in values ofmultiple optimization objective functions caused by their physical dimensions.These deviations seriously affect the scheduling process.A novel standardization fusion method has been established to address this issue by analyzing the variation process of each objective function’s values.The optimal scheduling results of IEHS with HESS indicate that the economy and overall energy loss can be improved 2–3 times under different optimization methods.The proposed method better balances all optimization objective functions and reduces the impact of their dimensionality.When the cost of BESS decreases by approximately 30%,its participation deepens by about 1 time.Moreover,if the price of the electrolyzer is less than 15¥/kWh or if the cost of the fuel cell drops below 4¥/kWh,their participation will increase substantially.This study aims to provide a more reasonable approach to solving multi-objective optimization problems.
文摘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.
基金National natural science foundation (No:70371040)
文摘The vehicle routing and scheduling (VRS) problem with multi-objective and multi-constraint is analyzed, considering the complexity of the modern logistics in city economy and daily life based on the system engineering. The objective and constraint includes loading, the dispatch and arrival time, transportation conditions,total cost,etc. An information model and a mathematical model are built,and a method based on knowledge and biologic immunity is put forward for optimizing and evaluating the programs dimensions in vehicle routing and scheduling with multi-objective and multi-constraints. The proposed model and method are illustrated in a case study concerning a transport network, and the result shows that more optimization solutions can be easily obtained and the method is efficient and feasible. Comparing with the standard GA and the standard GA without time constraint,the computational time of the algorithm is less in this paper. And the probability of gaining optimal solution is bigger and the result is better under the condition of multi-constraint.
基金supported by the National Natural Science Foundation of China (No. 71101007)the National High Technology Research and Development Program of China (No. 2011AA110502)State Key Laboratory of Rail Traffic Control and Safety of Beijing Jiaotong University Program (RCS2010ZZ001)
文摘Energy saving and emission reduction for railway systems should not only be studied from a technical perspective but should also be focused on management and economics. On the basis of relevant trainscheduling models for train operation management, in this paper we introduce an extended multi-objective trainscheduling optimization model considering locomotive assignment and segment emission constraints for energy saving. The objective of setting up this model is to reduce the energy and emission cost as well as total passenger- time. The decision variables include continuous variables such as train arrival and departure time, and binary vari- ables such as locomotive assignment and segment occu- pancy. The constraints are concerned with train movement, trip time, headway, and segment emission, etc. To obtain a non-dominated satisfactory solution on these objectives, a fuzzy multi-objective optimization algorithm is employed to solve the model. Finally, a numerical example is performed and used to compare the proposed model with the existing model. The results show that the proposed model can reduce the energy consumption, meet exhausts emission demands effectively by optimal locomotive assignment, and its solution methodology is effective.
基金supported in part by the Scientific Research Fund of National Natural Science Foundation of China(Grant No.62372168)the Hunan Provincial Natural Science Foundation of China(Grant No.2023JJ30266)+2 种基金the Research Project on teaching reform in Hunan province(No.HNJG-2022-0791)the Hunan University of Science and Technology(No.2022-44-8)the National Social Science Funds of China(19BZX044).
文摘Multi-instance image generation remains a challenging task in the field of computer vision.While existing diffusionmodels demonstrate impressive fidelity in image generation,they often struggle with precisely controlling each object’s shape,pose,and size.Methods like layout-to-image and mask-to-image provide spatial guidance but frequently suffer from object shape distortion,overlaps,and poor consistency,particularly in complex scenes with multiple objects.To address these issues,we introduce PolyDiffusion,a contour-based diffusion framework that encodes each object’s contour as a boundary-coordinate sequence,decoupling object shapes and positions.This approach allows for better control over object geometry and spatial positioning,which is critical for achieving high-quality multiinstance generation.We formulate the training process as a multi-objective optimization problem,balancing three key objectives:a denoising diffusion loss to maintain overall image fidelity,a cross-attention contour alignment loss to ensure precise shape adherence,and a reward-guided denoising objective that minimizes the Fréchet distance to real images.In addition,the Object Space-Aware Attention module fuses contour tokens with visual features,while a prior-guided fusion mechanism utilizes inter-object spatial relationships and class semantics to enhance consistency across multiple objects.Experimental results on benchmark datasets such as COCO-Stuff and VOC-2012 demonstrate that PolyDiffusion significantly outperforms existing layout-to-image and mask-to-image methods,achieving notable improvements in both image quality and instance-level segmentation accuracy.The implementation of Poly Diffusion is available at https://github.com/YYYYYJS/PolyDiffusion(accessed on 06 August 2025).
基金Supported by National Natural Science Foundation of China(Grant Nos.52335002,51925502)。
文摘Robot-automated spraying is widely used in various fields,such as the automotive,metalworking,furniture,and aero-space industries.Spraying quality is influenced by multiple factors,including robot speed,acceleration,end-effector trajectory,and spraying process constraints.To achieve high-quality spraying under the influence of multiple factors,this study proposes a multi-objective optimization method for the spraying trajectory that integrates spraying process constraints into the optimization process.First,a 7-degree-of-freedom rigid-flexible coupling serial spray painting robot system is introduced,which includes a motion decoupling mechanism and a tension amplification mechanism.Subsequently,a paint deposition model for the spray gun was established,and the influence of process constraints on spraying quality was analyzed.Trajectory planning for the spray painting robot,based on the septic B-spline interpolation method,was then performed.Based on this foundation,objective functions and constraint equations for spraying trajectory optimization were established.A multi-objective trajectory optimization method for spraying by the robot is proposed based on the NSGA-Ⅱ,which integrates the spraying process constraints.Finally,a prototype system of a 7-degree-of-freedom rigid-flexible coupling serial spray painting robot was constructed.Simulations and spraying experiments were conducted to verify the effectiveness of the proposed multi-objective trajectory optimization method.This paper presents a multi-objective optimization method for the spraying trajectory of a robot.In the proposed method,the optimized spraying trajectory is generated with the spraying process as the constraint and time,energy consumption,and impact during the spraying operation of the robot as the optimization objectives.
