This paper presents an evaluation method for the entropy-weighting of wind power clusters that comprehensively evaluates the allocation problems of wind power clusters by considering the correlation between indicators...This paper presents an evaluation method for the entropy-weighting of wind power clusters that comprehensively evaluates the allocation problems of wind power clusters by considering the correlation between indicators and the dynamic performance of weight changes.A dynamic layered sorting allocation method is also proposed.The proposed evaluation method considers the power-limiting degree of the last cycle,the adjustment margin,and volatility.It uses the theory of weight variation to update the entropy weight coefficients of each indicator in real time,and then performs a fuzzy evaluation based on the membership function to obtain intuitive comprehensive evaluation results.A case study of a large-scale wind power base in Northwest China was conducted.The proposed evaluation method is compared with fixed-weight entropy and principal component analysis methods.The results show that the three scoring trends are the same,and that the proposed evaluation method is closer to the average level of the latter two,demonstrating higher accuracy.The proposed allocation method can reduce the number of adjustments made to wind farms,which is significant for the allocation and evaluation of wind power clusters.展开更多
In an unmanned aerial vehicle ad-hoc network(UANET),sparse and rapidly mobile unmanned aerial vehicles(UAVs)/nodes can dynamically change the UANET topology.This may lead to UANET service performance issues.In this st...In an unmanned aerial vehicle ad-hoc network(UANET),sparse and rapidly mobile unmanned aerial vehicles(UAVs)/nodes can dynamically change the UANET topology.This may lead to UANET service performance issues.In this study,for planning rapidly changing UAV swarms,we propose a dynamic value iteration network(DVIN)model trained using the episodic Q-learning method with the connection information of UANETs to generate a state value spread function,which enables UAVs/nodes to adapt to novel physical locations.We then evaluate the performance of the DVIN model and compare it with the non-dominated sorting genetic algorithm II and the exhaustive method.Simulation results demonstrate that the proposed model significantly reduces the decisionmaking time for UAV/node path planning with a high average success rate.展开更多
In this paper, the genetic algorithms are applied to the optimization problem of magnet sorting in an electron storage ring, according to which the objectives are set so that the closed orbit distortion and beta beati...In this paper, the genetic algorithms are applied to the optimization problem of magnet sorting in an electron storage ring, according to which the objectives are set so that the closed orbit distortion and beta beating can be minimized and the dynamic aperture maximized. The sorting of dipole, quadrupole and sextupole magnets is optimized while the optimization results show the power of the application of genetic algorithms in magnet sorting.展开更多
In Indus-2, by optimizing the position of the magnetic elements, using the simulated annealing algorithm, at different locations in the ring with their field errors, the effects on beam parameters have been minimized....In Indus-2, by optimizing the position of the magnetic elements, using the simulated annealing algorithm, at different locations in the ring with their field errors, the effects on beam parameters have been minimized. Closed orbit distortion and beta beat are considerably reduced by optimizing the dipole and quadrupole magnets positions in the ring. For the Indus-2 storage ring, sextupole optimization gives insignificant improvement in dynamic aperture with chromaticity-correcting sextupoles. The magnets have been placed in the ring with the optimized sequence and storage of the beam has been achieved at injection energy without energizing any corrector magnets. Magnet sorting has led to the easy beam current accumulation and the measurement of parameters such as closed orbit distortion, beta function, dispersion, dynamic aperture etc.展开更多
Shared manufacturing is recognized as a new point-to-point manufac-turing mode in the digital era.Shared manufacturing is referred to as a new man-ufacturing mode to realize the dynamic allocation of manufacturing tas...Shared manufacturing is recognized as a new point-to-point manufac-turing mode in the digital era.Shared manufacturing is referred to as a new man-ufacturing mode to realize the dynamic allocation of manufacturing tasks and resources.Compared with the traditional mode,shared manufacturing offers more abundant manufacturing resources and flexible configuration options.This paper proposes a model based on the description of the dynamic allocation of tasks and resources in the shared manufacturing environment,and the characteristics of shared manufacturing resource allocation.The execution of manufacturing tasks,in which candidate manufacturing resources enter or exit at various time nodes,enables the dynamic allocation of manufacturing tasks and resources.Then non-dominated sorting genetic algorithm(NSGA-II)and multi-objective particle swarm optimization(MOPSO)algorithms are designed to solve the model.The optimal parameter settings for the NSGA-II and MOPSO algorithms have been obtained according to the experiments with various population sizes and iteration numbers.In addition,the proposed model’s efficiency,which considers the entries and exits of manufacturing resources in the shared manufacturing environment,is further demonstrated by the overlap between the outputs of the NSGA-II and MOPSO algorithms for optimal resource allocation.展开更多
基金supported by the National Natural Science Foundation of China(Grant No.52076038,U22B20112,No.52106238)the Fundamental Research Funds for Central Universities(No.423162,B230201051).
文摘This paper presents an evaluation method for the entropy-weighting of wind power clusters that comprehensively evaluates the allocation problems of wind power clusters by considering the correlation between indicators and the dynamic performance of weight changes.A dynamic layered sorting allocation method is also proposed.The proposed evaluation method considers the power-limiting degree of the last cycle,the adjustment margin,and volatility.It uses the theory of weight variation to update the entropy weight coefficients of each indicator in real time,and then performs a fuzzy evaluation based on the membership function to obtain intuitive comprehensive evaluation results.A case study of a large-scale wind power base in Northwest China was conducted.The proposed evaluation method is compared with fixed-weight entropy and principal component analysis methods.The results show that the three scoring trends are the same,and that the proposed evaluation method is closer to the average level of the latter two,demonstrating higher accuracy.The proposed allocation method can reduce the number of adjustments made to wind farms,which is significant for the allocation and evaluation of wind power clusters.
基金Project supported by the National Natural Science Foundation of China(No.61501399)the SAIC MOTOR(No.1925)the National Key R&D Program of China(No.2018AAA0102302)。
文摘In an unmanned aerial vehicle ad-hoc network(UANET),sparse and rapidly mobile unmanned aerial vehicles(UAVs)/nodes can dynamically change the UANET topology.This may lead to UANET service performance issues.In this study,for planning rapidly changing UAV swarms,we propose a dynamic value iteration network(DVIN)model trained using the episodic Q-learning method with the connection information of UANETs to generate a state value spread function,which enables UAVs/nodes to adapt to novel physical locations.We then evaluate the performance of the DVIN model and compare it with the non-dominated sorting genetic algorithm II and the exhaustive method.Simulation results demonstrate that the proposed model significantly reduces the decisionmaking time for UAV/node path planning with a high average success rate.
基金Supported by National Natural Science Foundation of China(10979045,11175180,11175182)
文摘In this paper, the genetic algorithms are applied to the optimization problem of magnet sorting in an electron storage ring, according to which the objectives are set so that the closed orbit distortion and beta beating can be minimized and the dynamic aperture maximized. The sorting of dipole, quadrupole and sextupole magnets is optimized while the optimization results show the power of the application of genetic algorithms in magnet sorting.
文摘In Indus-2, by optimizing the position of the magnetic elements, using the simulated annealing algorithm, at different locations in the ring with their field errors, the effects on beam parameters have been minimized. Closed orbit distortion and beta beat are considerably reduced by optimizing the dipole and quadrupole magnets positions in the ring. For the Indus-2 storage ring, sextupole optimization gives insignificant improvement in dynamic aperture with chromaticity-correcting sextupoles. The magnets have been placed in the ring with the optimized sequence and storage of the beam has been achieved at injection energy without energizing any corrector magnets. Magnet sorting has led to the easy beam current accumulation and the measurement of parameters such as closed orbit distortion, beta function, dispersion, dynamic aperture etc.
基金This work was supported by the Key Program of Social Science Planning Foundation of Liaoning Province under Grant L21AGL017.
文摘Shared manufacturing is recognized as a new point-to-point manufac-turing mode in the digital era.Shared manufacturing is referred to as a new man-ufacturing mode to realize the dynamic allocation of manufacturing tasks and resources.Compared with the traditional mode,shared manufacturing offers more abundant manufacturing resources and flexible configuration options.This paper proposes a model based on the description of the dynamic allocation of tasks and resources in the shared manufacturing environment,and the characteristics of shared manufacturing resource allocation.The execution of manufacturing tasks,in which candidate manufacturing resources enter or exit at various time nodes,enables the dynamic allocation of manufacturing tasks and resources.Then non-dominated sorting genetic algorithm(NSGA-II)and multi-objective particle swarm optimization(MOPSO)algorithms are designed to solve the model.The optimal parameter settings for the NSGA-II and MOPSO algorithms have been obtained according to the experiments with various population sizes and iteration numbers.In addition,the proposed model’s efficiency,which considers the entries and exits of manufacturing resources in the shared manufacturing environment,is further demonstrated by the overlap between the outputs of the NSGA-II and MOPSO algorithms for optimal resource allocation.
