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.展开更多
This research provides academic and practical contributions. From a theoretical standpoint, a hybrid harmony search(HS)algorithm, namely the oppositional global-based HS(OGHS), is proposed for solving the multi-object...This research provides academic and practical contributions. From a theoretical standpoint, a hybrid harmony search(HS)algorithm, namely the oppositional global-based HS(OGHS), is proposed for solving the multi-objective flexible job-shop scheduling problems(MOFJSPs) to minimize makespan, total machine workload and critical machine workload. An initialization program embedded in opposition-based learning(OBL) is developed for enabling the individuals to scatter in a well-distributed manner in the initial harmony memory(HM). In addition, the recursive halving technique based on opposite number is employed for shrinking the neighbourhood space in the searching phase of the OGHS. From a practice-related standpoint, a type of dual vector code technique is introduced for allowing the OGHS algorithm to adapt the discrete nature of the MOFJSP. Two practical techniques, namely Pareto optimality and technique for order preference by similarity to an ideal solution(TOPSIS), are implemented for solving the MOFJSP.Furthermore, the algorithm performance is tested by using different strategies, including OBL and recursive halving, and the OGHS is compared with existing algorithms in the latest studies.Experimental results on representative examples validate the performance of the proposed algorithm for solving the MOFJSP.展开更多
Production scheduling is one of the most important problems to be considered in the effective performance of the automatic manufacturing system.It is the typical kind of NP-complete problem. The methods commonly used ...Production scheduling is one of the most important problems to be considered in the effective performance of the automatic manufacturing system.It is the typical kind of NP-complete problem. The methods commonly used are not suitable to solve complicated problems because the calculating time rises exponentially with the increase of the problem size. In this paper, a new algorithm - immune based scheduling algorithm (IBSA) is proposed. After the description of the mathematics model and the calculating procedure of immune based scheduling,some examples are tested in the software system called HM IM& C that is developed usingVC+ +6.0. The testing results show that IBSA has high efficiency to solve scheduling problem.展开更多
One of the fundamental problems associated with scheduling workflows on virtual machines in a multi-cloud environment is how to find a near-optimum permutation.The workflow scheduling involves assigning independent co...One of the fundamental problems associated with scheduling workflows on virtual machines in a multi-cloud environment is how to find a near-optimum permutation.The workflow scheduling involves assigning independent computational jobs with conflicting objectives to a set of virtual machines.Most optimization methods for solving non-deterministic polynomial-time hardness(NP-hard)problems deploy multi-objective algorithms.As such,Pareto dominance is one of the most efficient criteria for determining the best solutions within the Pareto front.However,the main drawback of this method is that it requires a reasonably long time to provide an optimum solution.In this paper,a new multi-objective minimum weight algorithm is used to derive the Pareto front.The conflicting objectives considered are reliability,cost,resource utilization,risk probability and makespan.Because multi-objective algorithms select a number of permutations with an optimal trade-off between conflicting objectives,we propose a new decisionmaking approach named the minimum weight optimization(MWO).MWO produces alternative weight to determine the inertia weight by using an adaptive strategy to provide an appropriate alternative for all optimal solutions.This way,consumers’needs and service providers’interests are taken into account.Using standard scientific workflows with conflicting objectives,we compare our proposed multi-objective scheduling algorithm using minimum weigh optimization(MOS-MWO)with multi-objective scheduling algorithm(MOS).Results show that MOS-MWO outperforms MOS in term of QoS satisfaction rate.展开更多
The intermittency and volatility of wind and photovoltaic power generation exacerbate issues such as wind and solar curtailment,hindering the efficient utilization of renewable energy and the low-carbon development of...The intermittency and volatility of wind and photovoltaic power generation exacerbate issues such as wind and solar curtailment,hindering the efficient utilization of renewable energy and the low-carbon development of energy systems.To enhance the consumption capacity of green power,the green power system consumption optimization scheduling model(GPS-COSM)is proposed,which comprehensively integrates green power system,electric boiler,combined heat and power unit,thermal energy storage,and electrical energy storage.The optimization objectives are to minimize operating cost,minimize carbon emission,and maximize the consumption of wind and solar curtailment.The multi-objective particle swarm optimization algorithm is employed to solve the model,and a fuzzy membership function is introduced to evaluate the satisfaction level of the Pareto optimal solution set,thereby selecting the optimal compromise solution to achieve a dynamic balance among economic efficiency,environmental friendliness,and energy utilization efficiency.Three typical operating modes are designed for comparative analysis.The results demonstrate that the mode involving the coordinated operation of electric boiler,thermal energy storage,and electrical energy storage performs the best in terms of economic efficiency,environmental friendliness,and renewable energy utilization efficiency,achieving the wind and solar curtailment consumption rate of 99.58%.The application of electric boiler significantly enhances the direct accommodation capacity of the green power system.Thermal energy storage optimizes intertemporal regulation,while electrical energy storage strengthens the system’s dynamic regulation capability.The coordinated optimization of multiple devices significantly reduces reliance on fossil fuels.展开更多
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.展开更多
Intelligent production is an important development direction in intelligent manufacturing,with intelligent factories playing a crucial role in promoting intelligent production.Flexible job shops,as the main form of in...Intelligent production is an important development direction in intelligent manufacturing,with intelligent factories playing a crucial role in promoting intelligent production.Flexible job shops,as the main form of intelligent factories,constantly face dynamic disturbances during the production process,including machine failures and urgent orders.This paper discusses the basic models and research methods of job shop scheduling,emphasizing the important role of dynamic job shop scheduling and its response schemes in future research.A multi-objective flexible job shop dynamic scheduling mathematical model is established,highlighting its complex and multi-constraint characteristics under different interferences.A classification discussion is conducted on the dynamic response methods and optimization objectives under machine failures,emergency orders,fuzzy completion times,and mixed dynamic events.The development process of traditional scheduling rules and intelligent methods in dynamic scheduling are also analyzed.Finally,based on the current development status of job shop scheduling and the requirements of intelligent manufacturing,the future development trends of dynamic scheduling in flexible job shops are proposed.展开更多
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.展开更多
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 ease of accessing a virtually unlimited pool of resources makes Infrastructure as a Service (IaaS) clouds an ideal platform for running data-intensive workflow applications comprising hundreds of computational tas...The ease of accessing a virtually unlimited pool of resources makes Infrastructure as a Service (IaaS) clouds an ideal platform for running data-intensive workflow applications comprising hundreds of computational tasks. However, executing scientific workflows in IaaS cloud environments poses significant challenges due to conflicting objectives, such as minimizing execution time (makespan) and reducing resource utilization costs. This study responds to the increasing need for efficient and adaptable optimization solutions in dynamic and complex environments, which are critical for meeting the evolving demands of modern users and applications. This study presents an innovative multi-objective approach for scheduling scientific workflows in IaaS cloud environments. The proposed algorithm, MOS-MWMC, aims to minimize total execution time (makespan) and resource utilization costs by leveraging key features of virtual machine instances, such as a high number of cores and fast local SSD storage. By integrating realistic simulations based on the WRENCH framework, the method effectively dimensions the cloud infrastructure and optimizes resource usage. Experimental results highlight the superiority of MOS-MWMC compared to benchmark algorithms HEFT and Max-Min. The Pareto fronts obtained for the CyberShake, Epigenomics, and Montage workflows demonstrate closer proximity to the optimal front, confirming the algorithm’s ability to balance conflicting objectives. This study contributes to optimizing scientific workflows in complex environments by providing solutions tailored to specific user needs while minimizing costs and execution times.展开更多
In the flexible job-shop scheduling problem （FJSP）, each operation has to be assigned to a machine from a set of capable machines before alocating the assigned operations on all machines. To solve the multi-objectiv...In the flexible job-shop scheduling problem （FJSP）, each operation has to be assigned to a machine from a set of capable machines before alocating the assigned operations on all machines. To solve the multi-objective FJSP, the Grantt graph oriented string representation （GOSR） and the basic manipulation of the genetic algorithm operator are presented. An integrated operator genetic algorithm （IOGA） and its process are described. Comparison between computational results and the latest research shows that the proposed algorithm is effective in reducing the total workload of all machines, the makespan and the critical machine workload.展开更多
Safe and efficient sortie scheduling on the confined flight deck is crucial for maintaining high combat effectiveness of the aircraft carrier.The primary difficulty exactly lies in the spatiotemporal coordination,i.e....Safe and efficient sortie scheduling on the confined flight deck is crucial for maintaining high combat effectiveness of the aircraft carrier.The primary difficulty exactly lies in the spatiotemporal coordination,i.e.,allocation of limited supporting resources and collision-avoidance between heterogeneous dispatch entities.In this paper,the problem is investigated in the perspective of hybrid flow-shop scheduling problem by synthesizing the precedence,space and resource constraints.Specifically,eight processing procedures are abstracted,where tractors,preparing spots,catapults,and launching are virtualized as machines.By analyzing the constraints in sortie scheduling,a mixed-integer planning model is constructed.In particular,the constraint on preparing spot occupancy is improved to further enhance the sortie efficiency.The basic trajectory library for each dispatch entity is generated and a delayed strategy is integrated to address the collision-avoidance issue.To efficiently solve the formulated HFSP,which is essentially a combinatorial problem with tightly coupled constraints,a chaos-initialized genetic algorithm is developed.The solution framework is validated by the simulation environment referring to the Fort-class carrier,exhibiting higher sortie efficiency when compared to existing strategies.And animation of the simulation results is available at www.bilibili.com/video/BV14t421A7Tt/.The study presents a promising supporting technique for autonomous flight deck operation in the foreseeable future,and can be easily extended to other supporting scenarios,e.g.,ammunition delivery and aircraft maintenance.展开更多
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.展开更多
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.展开更多
Ship outfitting is a key process in shipbuilding.Efficient and high-quality ship outfitting is a top priority for modern shipyards.These activities are conducted at different stations of shipyards.The outfitting plan ...Ship outfitting is a key process in shipbuilding.Efficient and high-quality ship outfitting is a top priority for modern shipyards.These activities are conducted at different stations of shipyards.The outfitting plan is one of the crucial issues in shipbuilding.In this paper,production scheduling and material ordering with endogenous uncertainty of the outfitting process are investigated.The uncertain factors in outfitting equipment production are usually decision-related,which leads to difficulties in addressing uncertainties in the outfitting production workshops before production is conducted according to plan.This uncertainty is regarded as endogenous uncertainty and can be treated as non-anticipativity constraints in the model.To address this problem,a stochastic two-stage programming model with endogenous uncertainty is established to optimize the outfitting job scheduling and raw material ordering process.A practical case of the shipyard of China Merchants Heavy Industry Co.,Ltd.is used to evaluate the performance of the proposed method.Satisfactory results are achieved at the lowest expected total cost as the complete kit rate of outfitting equipment is improved and emergency replenishment is reduced.展开更多
Recently,one of the main challenges facing the smart grid is insufficient computing resources and intermittent energy supply for various distributed components(such as monitoring systems for renewable energy power sta...Recently,one of the main challenges facing the smart grid is insufficient computing resources and intermittent energy supply for various distributed components(such as monitoring systems for renewable energy power stations).To solve the problem,we propose an energy harvesting based task scheduling and resource management framework to provide robust and low-cost edge computing services for smart grid.First,we formulate an energy consumption minimization problem with regard to task offloading,time switching,and resource allocation for mobile devices,which can be decoupled and transformed into a typical knapsack problem.Then,solutions are derived by two different algorithms.Furthermore,we deploy renewable energy and energy storage units at edge servers to tackle intermittency and instability problems.Finally,we design an energy management algorithm based on sampling average approximation for edge computing servers to derive the optimal charging/discharging strategies,number of energy storage units,and renewable energy utilization.The simulation results show the efficiency and superiority of our proposed framework.展开更多
Thedeployment of the Internet of Things(IoT)with smart sensors has facilitated the emergence of fog computing as an important technology for delivering services to smart environments such as campuses,smart cities,and ...Thedeployment of the Internet of Things(IoT)with smart sensors has facilitated the emergence of fog computing as an important technology for delivering services to smart environments such as campuses,smart cities,and smart transportation systems.Fog computing tackles a range of challenges,including processing,storage,bandwidth,latency,and reliability,by locally distributing secure information through end nodes.Consisting of endpoints,fog nodes,and back-end cloud infrastructure,it provides advanced capabilities beyond traditional cloud computing.In smart environments,particularly within smart city transportation systems,the abundance of devices and nodes poses significant challenges related to power consumption and system reliability.To address the challenges of latency,energy consumption,and fault tolerance in these environments,this paper proposes a latency-aware,faulttolerant framework for resource scheduling and data management,referred to as the FORD framework,for smart cities in fog environments.This framework is designed to meet the demands of time-sensitive applications,such as those in smart transportation systems.The FORD framework incorporates latency-aware resource scheduling to optimize task execution in smart city environments,leveraging resources from both fog and cloud environments.Through simulation-based executions,tasks are allocated to the nearest available nodes with minimum latency.In the event of execution failure,a fault-tolerantmechanism is employed to ensure the successful completion of tasks.Upon successful execution,data is efficiently stored in the cloud data center,ensuring data integrity and reliability within the smart city ecosystem.展开更多
The distributed permutation flow shop scheduling problem(DPFSP)has received increasing attention in recent years.The iterated greedy algorithm(IGA)serves as a powerful optimizer for addressing such a problem because o...The distributed permutation flow shop scheduling problem(DPFSP)has received increasing attention in recent years.The iterated greedy algorithm(IGA)serves as a powerful optimizer for addressing such a problem because of its straightforward,single-solution evolution framework.However,a potential draw-back of IGA is the lack of utilization of historical information,which could lead to an imbalance between exploration and exploitation,especially in large-scale DPFSPs.As a consequence,this paper develops an IGA with memory and learning mechanisms(MLIGA)to efficiently solve the DPFSP targeted at the mini-malmakespan.InMLIGA,we incorporate a memory mechanism to make a more informed selection of the initial solution at each stage of the search,by extending,reconstructing,and reinforcing the information from previous solutions.In addition,we design a twolayer cooperative reinforcement learning approach to intelligently determine the key parameters of IGA and the operations of the memory mechanism.Meanwhile,to ensure that the experience generated by each perturbation operator is fully learned and to reduce the prior parameters of MLIGA,a probability curve-based acceptance criterion is proposed by combining a cube root function with custom rules.At last,a discrete adaptive learning rate is employed to enhance the stability of the memory and learningmechanisms.Complete ablation experiments are utilized to verify the effectiveness of the memory mechanism,and the results show that this mechanism is capable of improving the performance of IGA to a large extent.Furthermore,through comparative experiments involving MLIGA and five state-of-the-art algorithms on 720 benchmarks,we have discovered that MLI-GA demonstrates significant potential for solving large-scale DPFSPs.This indicates that MLIGA is well-suited for real-world distributed flow shop scheduling.展开更多
In this paper,a bilevel optimization model of an integrated energy operator(IEO)–load aggregator(LA)is constructed to address the coordinate optimization challenge of multiple stakeholder island integrated energy sys...In this paper,a bilevel optimization model of an integrated energy operator(IEO)–load aggregator(LA)is constructed to address the coordinate optimization challenge of multiple stakeholder island integrated energy system(IIES).The upper level represents the integrated energy operator,and the lower level is the electricity-heatgas load aggregator.Owing to the benefit conflict between the upper and lower levels of the IIES,a dynamic pricing mechanism for coordinating the interests of the upper and lower levels is proposed,combined with factors such as the carbon emissions of the IIES,as well as the lower load interruption power.The price of selling energy can be dynamically adjusted to the lower LA in the mechanism,according to the information on carbon emissions and load interruption power.Mutual benefits and win-win situations are achieved between the upper and lower multistakeholders.Finally,CPLEX is used to iteratively solve the bilevel optimization model.The optimal solution is selected according to the joint optimal discrimination mechanism.Thesimulation results indicate that the sourceload coordinate operation can reduce the upper and lower operation costs.Using the proposed pricingmechanism,the carbon emissions and load interruption power of IEO-LA are reduced by 9.78%and 70.19%,respectively,and the capture power of the carbon capture equipment is improved by 36.24%.The validity of the proposed model and method is verified.展开更多
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).展开更多
基金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 National Key Research and Development Program of China(2016YFD0700605)the Fundamental Research Funds for the Central Universities(JZ2016HGBZ1035)the Anhui University Natural Science Research Project(KJ2017A891)
文摘This research provides academic and practical contributions. From a theoretical standpoint, a hybrid harmony search(HS)algorithm, namely the oppositional global-based HS(OGHS), is proposed for solving the multi-objective flexible job-shop scheduling problems(MOFJSPs) to minimize makespan, total machine workload and critical machine workload. An initialization program embedded in opposition-based learning(OBL) is developed for enabling the individuals to scatter in a well-distributed manner in the initial harmony memory(HM). In addition, the recursive halving technique based on opposite number is employed for shrinking the neighbourhood space in the searching phase of the OGHS. From a practice-related standpoint, a type of dual vector code technique is introduced for allowing the OGHS algorithm to adapt the discrete nature of the MOFJSP. Two practical techniques, namely Pareto optimality and technique for order preference by similarity to an ideal solution(TOPSIS), are implemented for solving the MOFJSP.Furthermore, the algorithm performance is tested by using different strategies, including OBL and recursive halving, and the OGHS is compared with existing algorithms in the latest studies.Experimental results on representative examples validate the performance of the proposed algorithm for solving the MOFJSP.
基金Shanghai Natural Science Foundation (01ZF14004) National Technology Innovation Project (02CJ-14 -05 -01)
文摘Production scheduling is one of the most important problems to be considered in the effective performance of the automatic manufacturing system.It is the typical kind of NP-complete problem. The methods commonly used are not suitable to solve complicated problems because the calculating time rises exponentially with the increase of the problem size. In this paper, a new algorithm - immune based scheduling algorithm (IBSA) is proposed. After the description of the mathematics model and the calculating procedure of immune based scheduling,some examples are tested in the software system called HM IM& C that is developed usingVC+ +6.0. The testing results show that IBSA has high efficiency to solve scheduling problem.
基金supported by Putra Grant,University PutraMalaysia,under Grant 95960000 and in part by the Ministry of Education(MOE)Malaysia.
文摘One of the fundamental problems associated with scheduling workflows on virtual machines in a multi-cloud environment is how to find a near-optimum permutation.The workflow scheduling involves assigning independent computational jobs with conflicting objectives to a set of virtual machines.Most optimization methods for solving non-deterministic polynomial-time hardness(NP-hard)problems deploy multi-objective algorithms.As such,Pareto dominance is one of the most efficient criteria for determining the best solutions within the Pareto front.However,the main drawback of this method is that it requires a reasonably long time to provide an optimum solution.In this paper,a new multi-objective minimum weight algorithm is used to derive the Pareto front.The conflicting objectives considered are reliability,cost,resource utilization,risk probability and makespan.Because multi-objective algorithms select a number of permutations with an optimal trade-off between conflicting objectives,we propose a new decisionmaking approach named the minimum weight optimization(MWO).MWO produces alternative weight to determine the inertia weight by using an adaptive strategy to provide an appropriate alternative for all optimal solutions.This way,consumers’needs and service providers’interests are taken into account.Using standard scientific workflows with conflicting objectives,we compare our proposed multi-objective scheduling algorithm using minimum weigh optimization(MOS-MWO)with multi-objective scheduling algorithm(MOS).Results show that MOS-MWO outperforms MOS in term of QoS satisfaction rate.
基金funded by the National Key Research and Development Program of China(2024YFE0106800)Natural Science Foundation of Shandong Province(ZR2021ME199).
文摘The intermittency and volatility of wind and photovoltaic power generation exacerbate issues such as wind and solar curtailment,hindering the efficient utilization of renewable energy and the low-carbon development of energy systems.To enhance the consumption capacity of green power,the green power system consumption optimization scheduling model(GPS-COSM)is proposed,which comprehensively integrates green power system,electric boiler,combined heat and power unit,thermal energy storage,and electrical energy storage.The optimization objectives are to minimize operating cost,minimize carbon emission,and maximize the consumption of wind and solar curtailment.The multi-objective particle swarm optimization algorithm is employed to solve the model,and a fuzzy membership function is introduced to evaluate the satisfaction level of the Pareto optimal solution set,thereby selecting the optimal compromise solution to achieve a dynamic balance among economic efficiency,environmental friendliness,and energy utilization efficiency.Three typical operating modes are designed for comparative analysis.The results demonstrate that the mode involving the coordinated operation of electric boiler,thermal energy storage,and electrical energy storage performs the best in terms of economic efficiency,environmental friendliness,and renewable energy utilization efficiency,achieving the wind and solar curtailment consumption rate of 99.58%.The application of electric boiler significantly enhances the direct accommodation capacity of the green power system.Thermal energy storage optimizes intertemporal regulation,while electrical energy storage strengthens the system’s dynamic regulation capability.The coordinated optimization of multiple devices significantly reduces reliance on fossil fuels.
基金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.
基金supported by the National Key Research and Development Program Project(No.2021YFB3301300).
文摘Intelligent production is an important development direction in intelligent manufacturing,with intelligent factories playing a crucial role in promoting intelligent production.Flexible job shops,as the main form of intelligent factories,constantly face dynamic disturbances during the production process,including machine failures and urgent orders.This paper discusses the basic models and research methods of job shop scheduling,emphasizing the important role of dynamic job shop scheduling and its response schemes in future research.A multi-objective flexible job shop dynamic scheduling mathematical model is established,highlighting its complex and multi-constraint characteristics under different interferences.A classification discussion is conducted on the dynamic response methods and optimization objectives under machine failures,emergency orders,fuzzy completion times,and mixed dynamic events.The development process of traditional scheduling rules and intelligent methods in dynamic scheduling are also analyzed.Finally,based on the current development status of job shop scheduling and the requirements of intelligent manufacturing,the future development trends of dynamic scheduling in flexible job shops are proposed.
基金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 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.
文摘The ease of accessing a virtually unlimited pool of resources makes Infrastructure as a Service (IaaS) clouds an ideal platform for running data-intensive workflow applications comprising hundreds of computational tasks. However, executing scientific workflows in IaaS cloud environments poses significant challenges due to conflicting objectives, such as minimizing execution time (makespan) and reducing resource utilization costs. This study responds to the increasing need for efficient and adaptable optimization solutions in dynamic and complex environments, which are critical for meeting the evolving demands of modern users and applications. This study presents an innovative multi-objective approach for scheduling scientific workflows in IaaS cloud environments. The proposed algorithm, MOS-MWMC, aims to minimize total execution time (makespan) and resource utilization costs by leveraging key features of virtual machine instances, such as a high number of cores and fast local SSD storage. By integrating realistic simulations based on the WRENCH framework, the method effectively dimensions the cloud infrastructure and optimizes resource usage. Experimental results highlight the superiority of MOS-MWMC compared to benchmark algorithms HEFT and Max-Min. The Pareto fronts obtained for the CyberShake, Epigenomics, and Montage workflows demonstrate closer proximity to the optimal front, confirming the algorithm’s ability to balance conflicting objectives. This study contributes to optimizing scientific workflows in complex environments by providing solutions tailored to specific user needs while minimizing costs and execution times.
文摘In the flexible job-shop scheduling problem （FJSP）, each operation has to be assigned to a machine from a set of capable machines before alocating the assigned operations on all machines. To solve the multi-objective FJSP, the Grantt graph oriented string representation （GOSR） and the basic manipulation of the genetic algorithm operator are presented. An integrated operator genetic algorithm （IOGA） and its process are described. Comparison between computational results and the latest research shows that the proposed algorithm is effective in reducing the total workload of all machines, the makespan and the critical machine workload.
基金the financial support of the National Key Research and Development Plan(2021YFB3302501)the financial support of the National Natural Science Foundation of China(12102077)。
文摘Safe and efficient sortie scheduling on the confined flight deck is crucial for maintaining high combat effectiveness of the aircraft carrier.The primary difficulty exactly lies in the spatiotemporal coordination,i.e.,allocation of limited supporting resources and collision-avoidance between heterogeneous dispatch entities.In this paper,the problem is investigated in the perspective of hybrid flow-shop scheduling problem by synthesizing the precedence,space and resource constraints.Specifically,eight processing procedures are abstracted,where tractors,preparing spots,catapults,and launching are virtualized as machines.By analyzing the constraints in sortie scheduling,a mixed-integer planning model is constructed.In particular,the constraint on preparing spot occupancy is improved to further enhance the sortie efficiency.The basic trajectory library for each dispatch entity is generated and a delayed strategy is integrated to address the collision-avoidance issue.To efficiently solve the formulated HFSP,which is essentially a combinatorial problem with tightly coupled constraints,a chaos-initialized genetic algorithm is developed.The solution framework is validated by the simulation environment referring to the Fort-class carrier,exhibiting higher sortie efficiency when compared to existing strategies.And animation of the simulation results is available at www.bilibili.com/video/BV14t421A7Tt/.The study presents a promising supporting technique for autonomous flight deck operation in the foreseeable future,and can be easily extended to other supporting scenarios,e.g.,ammunition delivery and aircraft maintenance.
基金supported by National Natural Science Foundations of China(nos.12271326,62102304,61806120,61502290,61672334,61673251)China Postdoctoral Science Foundation(no.2015M582606)+2 种基金Industrial Research Project of Science and Technology in Shaanxi Province(nos.2015GY016,2017JQ6063)Fundamental Research Fund for the Central Universities(no.GK202003071)Natural Science Basic Research Plan in Shaanxi Province of China(no.2022JM-354).
文摘The multi-objective particle swarm optimization algorithm(MOPSO)is widely used to solve multi-objective optimization problems.In the article,amulti-objective particle swarm optimization algorithmbased on decomposition and multi-selection strategy is proposed to improve the search efficiency.First,two update strategies based on decomposition are used to update the evolving population and external archive,respectively.Second,a multiselection strategy is designed.The first strategy is for the subspace without a non-dominated solution.Among the neighbor particles,the particle with the smallest penalty-based boundary intersection value is selected as the global optimal solution and the particle far away fromthe search particle and the global optimal solution is selected as the personal optimal solution to enhance global search.The second strategy is for the subspace with a non-dominated solution.In the neighbor particles,two particles are randomly selected,one as the global optimal solution and the other as the personal optimal solution,to enhance local search.The third strategy is for Pareto optimal front(PF)discontinuity,which is identified by the cumulative number of iterations of the subspace without non-dominated solutions.In the subsequent iteration,a new probability distribution is used to select from the remaining subspaces to search.Third,an adaptive inertia weight update strategy based on the dominated degree is designed to further improve the search efficiency.Finally,the proposed algorithmis compared with fivemulti-objective particle swarm optimization algorithms and five multi-objective evolutionary algorithms on 22 test problems.The results show that the proposed algorithm has better performance.
基金supported by the National Natural Science Foundation of China(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.
基金supported in part by the High-tech ship scientific research project of the Ministry of Industry and Information Technology of the People’s Republic of China,and the National Nature Science Foundation of China(Grant No.71671113)the Science and Technology Department of Shaanxi Province(No.2020GY-219)the Ministry of Education Collaborative Project of Production,Learning and Research(No.201901024016).
文摘Ship outfitting is a key process in shipbuilding.Efficient and high-quality ship outfitting is a top priority for modern shipyards.These activities are conducted at different stations of shipyards.The outfitting plan is one of the crucial issues in shipbuilding.In this paper,production scheduling and material ordering with endogenous uncertainty of the outfitting process are investigated.The uncertain factors in outfitting equipment production are usually decision-related,which leads to difficulties in addressing uncertainties in the outfitting production workshops before production is conducted according to plan.This uncertainty is regarded as endogenous uncertainty and can be treated as non-anticipativity constraints in the model.To address this problem,a stochastic two-stage programming model with endogenous uncertainty is established to optimize the outfitting job scheduling and raw material ordering process.A practical case of the shipyard of China Merchants Heavy Industry Co.,Ltd.is used to evaluate the performance of the proposed method.Satisfactory results are achieved at the lowest expected total cost as the complete kit rate of outfitting equipment is improved and emergency replenishment is reduced.
基金supported in part by the National Natural Science Foundation of China under Grant No.61473066in part by the Natural Science Foundation of Hebei Province under Grant No.F2021501020+2 种基金in part by the S&T Program of Qinhuangdao under Grant No.202401A195in part by the Science Research Project of Hebei Education Department under Grant No.QN2025008in part by the Innovation Capability Improvement Plan Project of Hebei Province under Grant No.22567637H
文摘Recently,one of the main challenges facing the smart grid is insufficient computing resources and intermittent energy supply for various distributed components(such as monitoring systems for renewable energy power stations).To solve the problem,we propose an energy harvesting based task scheduling and resource management framework to provide robust and low-cost edge computing services for smart grid.First,we formulate an energy consumption minimization problem with regard to task offloading,time switching,and resource allocation for mobile devices,which can be decoupled and transformed into a typical knapsack problem.Then,solutions are derived by two different algorithms.Furthermore,we deploy renewable energy and energy storage units at edge servers to tackle intermittency and instability problems.Finally,we design an energy management algorithm based on sampling average approximation for edge computing servers to derive the optimal charging/discharging strategies,number of energy storage units,and renewable energy utilization.The simulation results show the efficiency and superiority of our proposed framework.
基金supported by the Deanship of Scientific Research and Graduate Studies at King Khalid University under research grant number(R.G.P.2/93/45).
文摘Thedeployment of the Internet of Things(IoT)with smart sensors has facilitated the emergence of fog computing as an important technology for delivering services to smart environments such as campuses,smart cities,and smart transportation systems.Fog computing tackles a range of challenges,including processing,storage,bandwidth,latency,and reliability,by locally distributing secure information through end nodes.Consisting of endpoints,fog nodes,and back-end cloud infrastructure,it provides advanced capabilities beyond traditional cloud computing.In smart environments,particularly within smart city transportation systems,the abundance of devices and nodes poses significant challenges related to power consumption and system reliability.To address the challenges of latency,energy consumption,and fault tolerance in these environments,this paper proposes a latency-aware,faulttolerant framework for resource scheduling and data management,referred to as the FORD framework,for smart cities in fog environments.This framework is designed to meet the demands of time-sensitive applications,such as those in smart transportation systems.The FORD framework incorporates latency-aware resource scheduling to optimize task execution in smart city environments,leveraging resources from both fog and cloud environments.Through simulation-based executions,tasks are allocated to the nearest available nodes with minimum latency.In the event of execution failure,a fault-tolerantmechanism is employed to ensure the successful completion of tasks.Upon successful execution,data is efficiently stored in the cloud data center,ensuring data integrity and reliability within the smart city ecosystem.
基金supported in part by the National Key Research and Development Program of China under Grant No.2021YFF0901300in part by the National Natural Science Foundation of China under Grant Nos.62173076 and 72271048.
文摘The distributed permutation flow shop scheduling problem(DPFSP)has received increasing attention in recent years.The iterated greedy algorithm(IGA)serves as a powerful optimizer for addressing such a problem because of its straightforward,single-solution evolution framework.However,a potential draw-back of IGA is the lack of utilization of historical information,which could lead to an imbalance between exploration and exploitation,especially in large-scale DPFSPs.As a consequence,this paper develops an IGA with memory and learning mechanisms(MLIGA)to efficiently solve the DPFSP targeted at the mini-malmakespan.InMLIGA,we incorporate a memory mechanism to make a more informed selection of the initial solution at each stage of the search,by extending,reconstructing,and reinforcing the information from previous solutions.In addition,we design a twolayer cooperative reinforcement learning approach to intelligently determine the key parameters of IGA and the operations of the memory mechanism.Meanwhile,to ensure that the experience generated by each perturbation operator is fully learned and to reduce the prior parameters of MLIGA,a probability curve-based acceptance criterion is proposed by combining a cube root function with custom rules.At last,a discrete adaptive learning rate is employed to enhance the stability of the memory and learningmechanisms.Complete ablation experiments are utilized to verify the effectiveness of the memory mechanism,and the results show that this mechanism is capable of improving the performance of IGA to a large extent.Furthermore,through comparative experiments involving MLIGA and five state-of-the-art algorithms on 720 benchmarks,we have discovered that MLI-GA demonstrates significant potential for solving large-scale DPFSPs.This indicates that MLIGA is well-suited for real-world distributed flow shop scheduling.
基金supported by the Central Government Guides Local Science and Technology Development Fund Project(2023ZY0020)Key R&D and Achievement Transformation Project in InnerMongolia Autonomous Region(2022YFHH0019)+3 种基金the Fundamental Research Funds for Inner Mongolia University of Science&Technology(2022053)Natural Science Foundation of Inner Mongolia(2022LHQN05002)National Natural Science Foundation of China(52067018)Metallurgical Engineering First-Class Discipline Construction Project in Inner Mongolia University of Science and Technology,Control Science and Engineering Quality Improvement and Cultivation Discipline Project in Inner Mongolia University of Science and Technology。
文摘In this paper,a bilevel optimization model of an integrated energy operator(IEO)–load aggregator(LA)is constructed to address the coordinate optimization challenge of multiple stakeholder island integrated energy system(IIES).The upper level represents the integrated energy operator,and the lower level is the electricity-heatgas load aggregator.Owing to the benefit conflict between the upper and lower levels of the IIES,a dynamic pricing mechanism for coordinating the interests of the upper and lower levels is proposed,combined with factors such as the carbon emissions of the IIES,as well as the lower load interruption power.The price of selling energy can be dynamically adjusted to the lower LA in the mechanism,according to the information on carbon emissions and load interruption power.Mutual benefits and win-win situations are achieved between the upper and lower multistakeholders.Finally,CPLEX is used to iteratively solve the bilevel optimization model.The optimal solution is selected according to the joint optimal discrimination mechanism.Thesimulation results indicate that the sourceload coordinate operation can reduce the upper and lower operation costs.Using the proposed pricingmechanism,the carbon emissions and load interruption power of IEO-LA are reduced by 9.78%and 70.19%,respectively,and the capture power of the carbon capture equipment is improved by 36.24%.The validity of the proposed model and method is verified.
基金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).
