With the large-scale integration of renewable energy sources into the grid,distribution networks are increasingly challenged by issues related to renewable energy accommodation and the mainte-nance of power quality st...With the large-scale integration of renewable energy sources into the grid,distribution networks are increasingly challenged by issues related to renewable energy accommodation and the mainte-nance of power quality stability.To address the challenge that existing partitioning methods are inad-equate for the planning and operation needs of active distribution networks under frequently changing power flow conditions,a three-stage dynamic partitioning approach is proposed based on an im-proved sand cat swarm optimization(ISCSO)algorithm.Firstly,a comprehensive dynamic partitio-ning index is developed by integrating both structural and functional metrics,including modularity,voltage regulation capability,and regional renewable energy accommodation capacity.Secondly,to overcome the limitations of the conventional sand cat swarm optimization,namely its weak global ex-ploration ability and tendency to fall into local optima in the later optimization stages,chaotic map-ping is employed to initialize a uniformly distributed population.A nonlinear sensitivity mechanism is introduced to balance global exploration and local exploitation,alongside the design of a particle encoding and position updating scheme tailored for dynamic partitioning.Furthermore,a‘state re-tention-local adjustment-global reconstruction’partitioning structure is developed.To avoid unnec-essary partition changes under minor source-load fluctuations,the concept of overlapping nodes is introduced,enabling fine-tuned adjustments under such conditions.Finally,two experimental sce-narios are designed to validate the proposed method.Simulation results demonstrate strong electrical coupling performance and show that the method enhances voltage regulation and renewable energy integration capabilities across regions.展开更多
The escalating deployment of distributed power sources and random loads in DC distribution networks hasamplified the potential consequences of faults if left uncontrolled. To expedite the process of achieving an optim...The escalating deployment of distributed power sources and random loads in DC distribution networks hasamplified the potential consequences of faults if left uncontrolled. To expedite the process of achieving an optimalconfiguration of measurement points, this paper presents an optimal configuration scheme for fault locationmeasurement points in DC distribution networks based on an improved particle swarm optimization algorithm.Initially, a measurement point distribution optimization model is formulated, leveraging compressive sensing.The model aims to achieve the minimum number of measurement points while attaining the best compressivesensing reconstruction effect. It incorporates constraints from the compressive sensing algorithm and networkwide viewability. Subsequently, the traditional particle swarm algorithm is enhanced by utilizing the Haltonsequence for population initialization, generating uniformly distributed individuals. This enhancement reducesindividual search blindness and overlap probability, thereby promoting population diversity. Furthermore, anadaptive t-distribution perturbation strategy is introduced during the particle update process to enhance the globalsearch capability and search speed. The established model for the optimal configuration of measurement points issolved, and the results demonstrate the efficacy and practicality of the proposed method. The optimal configurationreduces the number of measurement points, enhances localization accuracy, and improves the convergence speedof the algorithm. These findings validate the effectiveness and utility of the proposed approach.展开更多
Feature selection(FS)is essential in machine learning(ML)and data mapping by its ability to preprocess high-dimensional data.By selecting a subset of relevant features,feature selection cuts down on the dimension of t...Feature selection(FS)is essential in machine learning(ML)and data mapping by its ability to preprocess high-dimensional data.By selecting a subset of relevant features,feature selection cuts down on the dimension of the data.It excludes irrelevant or surplus features,thus boosting the performance and efficiency of the model.Particle Swarm Optimization(PSO)boasts a streamlined algorithmic framework and exhibits rapid convergence traits.Compared with other algorithms,it incurs reduced computational expenses when tackling high-dimensional datasets.However,PSO faces challenges like inadequate convergence precision.Therefore,regarding FS problems,this paper presents a binary version enhanced PSO based on the Support Vector Machines(SVM)classifier.First,the Sand Cat Swarm Optimization(SCSO)is added to enhance the global search capability of PSO and improve the accuracy of the solution.Secondly,the Latin hypercube sampling strategy initializes populations more uniformly and helps to increase population diversity.The last is the roundup search strategy introducing the grey wolf hierarchy idea to help improve convergence speed.To verify the capability of Self-adaptive Cooperative Particle Swarm Optimization(SCPSO),the CEC2020 test suite and CEC2022 test suite are selected for experiments and applied to three engineering problems.Compared with the standard PSO algorithm,SCPSO converges faster,and the convergence accuracy is significantly improved.Moreover,SCPSO’s comprehensive performance far exceeds that of other algorithms.Six datasets from the University of California,Irvine(UCI)database were selected to evaluate SCPSO’s effectiveness in solving feature selection problems.The results indicate that SCPSO has significant potential for addressing these problems.展开更多
An improved adaptive particle swarm optimization(IAPSO)algorithm is presented for solving the minimum makespan problem of job shop scheduling problem(JSP).Inspired by hormone modulation mechanism,an adaptive hormonal ...An improved adaptive particle swarm optimization(IAPSO)algorithm is presented for solving the minimum makespan problem of job shop scheduling problem(JSP).Inspired by hormone modulation mechanism,an adaptive hormonal factor(HF),composed of an adaptive local hormonal factor(H l)and an adaptive global hormonal factor(H g),is devised to strengthen the information connection between particles.Using HF,each particle of the swarm can adjust its position self-adaptively to avoid premature phenomena and reach better solution.The computational results validate the effectiveness and stability of the proposed IAPSO,which can not only find optimal or close-to-optimal solutions but also obtain both better and more stability results than the existing particle swarm optimization(PSO)algorithms.展开更多
Based on the improved particle swarm optimization(PSO) algorithm,an optimization approach for the cargo oil tank design(COTD) is presented in this paper.The purpose is to design an optimal overall dimension of the car...Based on the improved particle swarm optimization(PSO) algorithm,an optimization approach for the cargo oil tank design(COTD) is presented in this paper.The purpose is to design an optimal overall dimension of the cargo oil tank(COT) under various kinds of constraints in the preliminary design stage.A non-linear programming model is built to simulate the optimization design,in which the requirements and rules for COTD are used as the constraints.Considering the distance between the inner shell and hull,a fuzzy constraint is used to express the feasibility degree of the double-hull configuration.In terms of the characteristic of COTD,the PSO algorithm is improved to solve this problem.A bivariate extremum strategy is presented to deal with the fuzzy constraint,by which the maximum and minimum cargo capacities are obtained simultaneously.Finally,the simulation demonstrates the feasibility and effectiveness of the proposed approach.展开更多
Skin cancer is one of the most dangerous cancer.Because of the high melanoma death rate,skin cancer is divided into non-melanoma and melanoma.The dermatologist finds it difficult to identify skin cancer from dermoscop...Skin cancer is one of the most dangerous cancer.Because of the high melanoma death rate,skin cancer is divided into non-melanoma and melanoma.The dermatologist finds it difficult to identify skin cancer from dermoscopy images of skin lesions.Sometimes,pathology and biopsy examinations are required for cancer diagnosis.Earlier studies have formulated computer-based systems for detecting skin cancer from skin lesion images.With recent advancements in hardware and software technologies,deep learning(DL)has developed as a potential technique for feature learning.Therefore,this study develops a new sand cat swarm optimization with a deep transfer learning method for skin cancer detection and classification(SCSODTL-SCC)technique.The major intention of the SCSODTL-SCC model lies in the recognition and classification of different types of skin cancer on dermoscopic images.Primarily,Dull razor approach-related hair removal and median filtering-based noise elimination are performed.Moreover,the U2Net segmentation approach is employed for detecting infected lesion regions in dermoscopic images.Furthermore,the NASNetLarge-based feature extractor with a hybrid deep belief network(DBN)model is used for classification.Finally,the classification performance can be improved by the SCSO algorithm for the hyperparameter tuning process,showing the novelty of the work.The simulation values of the SCSODTL-SCC model are scrutinized on the benchmark skin lesion dataset.The comparative results assured that the SCSODTL-SCC model had shown maximum skin cancer classification performance in different measures.展开更多
To solve the weapon network system optimization problem against small raid objects with low attitude,the concept of direction probability and a new evaluation index system are proposed.By calculating the whole damagin...To solve the weapon network system optimization problem against small raid objects with low attitude,the concept of direction probability and a new evaluation index system are proposed.By calculating the whole damaging probability that changes with the defending angle,the efficiency of the whole weapon network system can be subtly described.With such method,we can avoid the inconformity of the description obtained from the traditional index systems.Three new indexes are also proposed,i.e.join index,overlap index and cover index,which help manage the relationship among several sub-weapon-networks.By normalizing the computation results with the Sigmoid function,the matching problem between the optimization algorithm and indexes is well settled.Also,the algorithm of improved marriage in honey bees optimization that proposed in our previous work is applied to optimize the embattlement problem.Simulation is carried out to show the efficiency of the proposed indexes and the optimization algorithm.展开更多
In order to improve some shortcomings of the standard particle swarm optimization algorithm, such as premature convergence and slow local search speed, a double population particle swarm optimization algorithm based o...In order to improve some shortcomings of the standard particle swarm optimization algorithm, such as premature convergence and slow local search speed, a double population particle swarm optimization algorithm based on Lorenz equation and dynamic self-adaptive strategy is proposed. Chaotic sequences produced by Lorenz equation are used to tune the acceleration coefficients for the balance between exploration and exploitation, the dynamic self-adaptive inertia weight factor is used to accelerate the converging speed, and the double population purposes to enhance convergence accuracy. The experiment was carried out with four multi-objective test functions compared with two classical multi-objective algorithms, non-dominated sorting genetic algorithm and multi-objective particle swarm optimization algorithm. The results show that the proposed algorithm has excellent performance with faster convergence rate and strong ability to jump out of local optimum, could use to solve many optimization problems.展开更多
Using an improved particle swarm optimization algorithm(IPSO)to drive a transfer matrix method,a nonreciprocal absorber with an ultrawide absorption bandwidth and angular insensitivity is realized in plasma-embedded p...Using an improved particle swarm optimization algorithm(IPSO)to drive a transfer matrix method,a nonreciprocal absorber with an ultrawide absorption bandwidth and angular insensitivity is realized in plasma-embedded photonic crystals arranged in a structure composed of periodic and quasi-periodic sequences on a normalized scale.The effective dielectric function,which determines the absorption of the plasma,is subject to the basic parameters of the plasma,causing the absorption of the proposed absorber to be easily modulated by these parameters.Compared with other quasi-periodic sequences,the Octonacci sequence is superior both in relative bandwidth and absolute bandwidth.Under further optimization using IPSO with 14 parameters set to be optimized,the absorption characteristics of the proposed structure with different numbers of layers of the smallest structure unit N are shown and discussed.IPSO is also used to address angular insensitive nonreciprocal ultrawide bandwidth absorption,and the optimized result shows excellent unidirectional absorbability and angular insensitivity of the proposed structure.The impacts of the sequence number of quasi-periodic sequence M and collision frequency of plasma1ν1 to absorption in the angle domain and frequency domain are investigated.Additionally,the impedance match theory and the interference field theory are introduced to express the findings of the algorithm.展开更多
This study concentrates of the new generation of the agile （AEOS）. AEOS is a key study object on management problems earth observation satellite in many countries because of its many advantages over non-agile satell...This study concentrates of the new generation of the agile （AEOS）. AEOS is a key study object on management problems earth observation satellite in many countries because of its many advantages over non-agile satellites. Hence, the mission planning and scheduling of AEOS is a popular research problem. This research investigates AEOS characteristics and establishes a mission planning model based on the working principle and constraints of AEOS as per analysis. To solve the scheduling issue of AEOS, several improved algorithms are developed. Simulation results suggest that these algorithms are effective.展开更多
综合能源系统(integrated energy system,IES)参与电力现货市场交易时,由于市场供需关系的变化导致交易价格具有不确定性。因此,对综合能源系统运行边际成本进行精细化分析,研究充分利用综合能源系统灵活性资源参与市场的最优调度策略...综合能源系统(integrated energy system,IES)参与电力现货市场交易时,由于市场供需关系的变化导致交易价格具有不确定性。因此,对综合能源系统运行边际成本进行精细化分析,研究充分利用综合能源系统灵活性资源参与市场的最优调度策略。首先,分析了外部现货市场环境下市场价格不确定性典型场景处理方法,并研究了综合能源系统内部多种源荷可调资源及运行成本结构;其次,建立了在电力市场价格不确定性条件下考虑系统边际成本交易优化模型,并提出沙猫群优化算法进行求解。最后,通过对实际案例的仿真验证。结果表明:该策略不仅可以降低IES的运行成本,还能增强其对市场价格不确定性的适应能力,为综合能源系统在电力现货市场环境下的运行提供了新的思路和方法,有助于实现能源系统参与市场调度的经济性和可靠性双重优化。展开更多
基金Supported by the Technology Project of State Grid Corporation Headquarters(No.5100-202322029A-1-1-ZN)the 2024 Youth Science Foun-dation Project(No.62303006).
文摘With the large-scale integration of renewable energy sources into the grid,distribution networks are increasingly challenged by issues related to renewable energy accommodation and the mainte-nance of power quality stability.To address the challenge that existing partitioning methods are inad-equate for the planning and operation needs of active distribution networks under frequently changing power flow conditions,a three-stage dynamic partitioning approach is proposed based on an im-proved sand cat swarm optimization(ISCSO)algorithm.Firstly,a comprehensive dynamic partitio-ning index is developed by integrating both structural and functional metrics,including modularity,voltage regulation capability,and regional renewable energy accommodation capacity.Secondly,to overcome the limitations of the conventional sand cat swarm optimization,namely its weak global ex-ploration ability and tendency to fall into local optima in the later optimization stages,chaotic map-ping is employed to initialize a uniformly distributed population.A nonlinear sensitivity mechanism is introduced to balance global exploration and local exploitation,alongside the design of a particle encoding and position updating scheme tailored for dynamic partitioning.Furthermore,a‘state re-tention-local adjustment-global reconstruction’partitioning structure is developed.To avoid unnec-essary partition changes under minor source-load fluctuations,the concept of overlapping nodes is introduced,enabling fine-tuned adjustments under such conditions.Finally,two experimental sce-narios are designed to validate the proposed method.Simulation results demonstrate strong electrical coupling performance and show that the method enhances voltage regulation and renewable energy integration capabilities across regions.
基金the National Natural Science Foundation of China(52177074).
文摘The escalating deployment of distributed power sources and random loads in DC distribution networks hasamplified the potential consequences of faults if left uncontrolled. To expedite the process of achieving an optimalconfiguration of measurement points, this paper presents an optimal configuration scheme for fault locationmeasurement points in DC distribution networks based on an improved particle swarm optimization algorithm.Initially, a measurement point distribution optimization model is formulated, leveraging compressive sensing.The model aims to achieve the minimum number of measurement points while attaining the best compressivesensing reconstruction effect. It incorporates constraints from the compressive sensing algorithm and networkwide viewability. Subsequently, the traditional particle swarm algorithm is enhanced by utilizing the Haltonsequence for population initialization, generating uniformly distributed individuals. This enhancement reducesindividual search blindness and overlap probability, thereby promoting population diversity. Furthermore, anadaptive t-distribution perturbation strategy is introduced during the particle update process to enhance the globalsearch capability and search speed. The established model for the optimal configuration of measurement points issolved, and the results demonstrate the efficacy and practicality of the proposed method. The optimal configurationreduces the number of measurement points, enhances localization accuracy, and improves the convergence speedof the algorithm. These findings validate the effectiveness and utility of the proposed approach.
基金supported by the Fundamental Research Funds for the Central Universities of China(No.300102122105)the Natural Science Basic Research Plan in Shaanxi Province of China(2023-JC-YB-023).
文摘Feature selection(FS)is essential in machine learning(ML)and data mapping by its ability to preprocess high-dimensional data.By selecting a subset of relevant features,feature selection cuts down on the dimension of the data.It excludes irrelevant or surplus features,thus boosting the performance and efficiency of the model.Particle Swarm Optimization(PSO)boasts a streamlined algorithmic framework and exhibits rapid convergence traits.Compared with other algorithms,it incurs reduced computational expenses when tackling high-dimensional datasets.However,PSO faces challenges like inadequate convergence precision.Therefore,regarding FS problems,this paper presents a binary version enhanced PSO based on the Support Vector Machines(SVM)classifier.First,the Sand Cat Swarm Optimization(SCSO)is added to enhance the global search capability of PSO and improve the accuracy of the solution.Secondly,the Latin hypercube sampling strategy initializes populations more uniformly and helps to increase population diversity.The last is the roundup search strategy introducing the grey wolf hierarchy idea to help improve convergence speed.To verify the capability of Self-adaptive Cooperative Particle Swarm Optimization(SCPSO),the CEC2020 test suite and CEC2022 test suite are selected for experiments and applied to three engineering problems.Compared with the standard PSO algorithm,SCPSO converges faster,and the convergence accuracy is significantly improved.Moreover,SCPSO’s comprehensive performance far exceeds that of other algorithms.Six datasets from the University of California,Irvine(UCI)database were selected to evaluate SCPSO’s effectiveness in solving feature selection problems.The results indicate that SCPSO has significant potential for addressing these problems.
基金Supported by the National Natural Science Foundation of China(51175262)the Research Fund for Doctoral Program of Higher Education of China(20093218110020)+2 种基金the Jiangsu Province Science Foundation for Excellent Youths(BK201210111)the Jiangsu Province Industry-Academy-Research Grant(BY201220116)the Innovative and Excellent Foundation for Doctoral Dissertation of Nanjing University of Aeronautics and Astronautics(BCXJ10-09)
文摘An improved adaptive particle swarm optimization(IAPSO)algorithm is presented for solving the minimum makespan problem of job shop scheduling problem(JSP).Inspired by hormone modulation mechanism,an adaptive hormonal factor(HF),composed of an adaptive local hormonal factor(H l)and an adaptive global hormonal factor(H g),is devised to strengthen the information connection between particles.Using HF,each particle of the swarm can adjust its position self-adaptively to avoid premature phenomena and reach better solution.The computational results validate the effectiveness and stability of the proposed IAPSO,which can not only find optimal or close-to-optimal solutions but also obtain both better and more stability results than the existing particle swarm optimization(PSO)algorithms.
基金the National Special Fund for Agro-scientific Research in the Public Interest(No.201003024)
文摘Based on the improved particle swarm optimization(PSO) algorithm,an optimization approach for the cargo oil tank design(COTD) is presented in this paper.The purpose is to design an optimal overall dimension of the cargo oil tank(COT) under various kinds of constraints in the preliminary design stage.A non-linear programming model is built to simulate the optimization design,in which the requirements and rules for COTD are used as the constraints.Considering the distance between the inner shell and hull,a fuzzy constraint is used to express the feasibility degree of the double-hull configuration.In terms of the characteristic of COTD,the PSO algorithm is improved to solve this problem.A bivariate extremum strategy is presented to deal with the fuzzy constraint,by which the maximum and minimum cargo capacities are obtained simultaneously.Finally,the simulation demonstrates the feasibility and effectiveness of the proposed approach.
基金supported by the Technology Development Program of MSS [No.S3033853]by the National University Development Project by the Ministry of Education in 2022.
文摘Skin cancer is one of the most dangerous cancer.Because of the high melanoma death rate,skin cancer is divided into non-melanoma and melanoma.The dermatologist finds it difficult to identify skin cancer from dermoscopy images of skin lesions.Sometimes,pathology and biopsy examinations are required for cancer diagnosis.Earlier studies have formulated computer-based systems for detecting skin cancer from skin lesion images.With recent advancements in hardware and software technologies,deep learning(DL)has developed as a potential technique for feature learning.Therefore,this study develops a new sand cat swarm optimization with a deep transfer learning method for skin cancer detection and classification(SCSODTL-SCC)technique.The major intention of the SCSODTL-SCC model lies in the recognition and classification of different types of skin cancer on dermoscopic images.Primarily,Dull razor approach-related hair removal and median filtering-based noise elimination are performed.Moreover,the U2Net segmentation approach is employed for detecting infected lesion regions in dermoscopic images.Furthermore,the NASNetLarge-based feature extractor with a hybrid deep belief network(DBN)model is used for classification.Finally,the classification performance can be improved by the SCSO algorithm for the hyperparameter tuning process,showing the novelty of the work.The simulation values of the SCSODTL-SCC model are scrutinized on the benchmark skin lesion dataset.The comparative results assured that the SCSODTL-SCC model had shown maximum skin cancer classification performance in different measures.
基金Sponsored by Beijing Priority Laboratory Fund of China(SYS10070522)
文摘To solve the weapon network system optimization problem against small raid objects with low attitude,the concept of direction probability and a new evaluation index system are proposed.By calculating the whole damaging probability that changes with the defending angle,the efficiency of the whole weapon network system can be subtly described.With such method,we can avoid the inconformity of the description obtained from the traditional index systems.Three new indexes are also proposed,i.e.join index,overlap index and cover index,which help manage the relationship among several sub-weapon-networks.By normalizing the computation results with the Sigmoid function,the matching problem between the optimization algorithm and indexes is well settled.Also,the algorithm of improved marriage in honey bees optimization that proposed in our previous work is applied to optimize the embattlement problem.Simulation is carried out to show the efficiency of the proposed indexes and the optimization algorithm.
文摘In order to improve some shortcomings of the standard particle swarm optimization algorithm, such as premature convergence and slow local search speed, a double population particle swarm optimization algorithm based on Lorenz equation and dynamic self-adaptive strategy is proposed. Chaotic sequences produced by Lorenz equation are used to tune the acceleration coefficients for the balance between exploration and exploitation, the dynamic self-adaptive inertia weight factor is used to accelerate the converging speed, and the double population purposes to enhance convergence accuracy. The experiment was carried out with four multi-objective test functions compared with two classical multi-objective algorithms, non-dominated sorting genetic algorithm and multi-objective particle swarm optimization algorithm. The results show that the proposed algorithm has excellent performance with faster convergence rate and strong ability to jump out of local optimum, could use to solve many optimization problems.
文摘Using an improved particle swarm optimization algorithm(IPSO)to drive a transfer matrix method,a nonreciprocal absorber with an ultrawide absorption bandwidth and angular insensitivity is realized in plasma-embedded photonic crystals arranged in a structure composed of periodic and quasi-periodic sequences on a normalized scale.The effective dielectric function,which determines the absorption of the plasma,is subject to the basic parameters of the plasma,causing the absorption of the proposed absorber to be easily modulated by these parameters.Compared with other quasi-periodic sequences,the Octonacci sequence is superior both in relative bandwidth and absolute bandwidth.Under further optimization using IPSO with 14 parameters set to be optimized,the absorption characteristics of the proposed structure with different numbers of layers of the smallest structure unit N are shown and discussed.IPSO is also used to address angular insensitive nonreciprocal ultrawide bandwidth absorption,and the optimized result shows excellent unidirectional absorbability and angular insensitivity of the proposed structure.The impacts of the sequence number of quasi-periodic sequence M and collision frequency of plasma1ν1 to absorption in the angle domain and frequency domain are investigated.Additionally,the impedance match theory and the interference field theory are introduced to express the findings of the algorithm.
基金supported by the National Natural Science Foundation of China(7127106671171065+1 种基金71202168)the Natural Science Foundation of Heilongjiang Province(GC13D506)
文摘This study concentrates of the new generation of the agile （AEOS）. AEOS is a key study object on management problems earth observation satellite in many countries because of its many advantages over non-agile satellites. Hence, the mission planning and scheduling of AEOS is a popular research problem. This research investigates AEOS characteristics and establishes a mission planning model based on the working principle and constraints of AEOS as per analysis. To solve the scheduling issue of AEOS, several improved algorithms are developed. Simulation results suggest that these algorithms are effective.
文摘综合能源系统(integrated energy system,IES)参与电力现货市场交易时,由于市场供需关系的变化导致交易价格具有不确定性。因此,对综合能源系统运行边际成本进行精细化分析,研究充分利用综合能源系统灵活性资源参与市场的最优调度策略。首先,分析了外部现货市场环境下市场价格不确定性典型场景处理方法,并研究了综合能源系统内部多种源荷可调资源及运行成本结构;其次,建立了在电力市场价格不确定性条件下考虑系统边际成本交易优化模型,并提出沙猫群优化算法进行求解。最后,通过对实际案例的仿真验证。结果表明:该策略不仅可以降低IES的运行成本,还能增强其对市场价格不确定性的适应能力,为综合能源系统在电力现货市场环境下的运行提供了新的思路和方法,有助于实现能源系统参与市场调度的经济性和可靠性双重优化。
