Complex network models are frequently employed for simulating and studyingdiverse real-world complex systems.Among these models,scale-free networks typically exhibit greater fragility to malicious attacks.Consequently...Complex network models are frequently employed for simulating and studyingdiverse real-world complex systems.Among these models,scale-free networks typically exhibit greater fragility to malicious attacks.Consequently,enhancing the robustness of scale-free networks has become a pressing issue.To address this problem,this paper proposes a Multi-Granularity Integration Algorithm(MGIA),which aims to improve the robustness of scale-free networks while keeping the initial degree of each node unchanged,ensuring network connectivity and avoiding the generation of multiple edges.The algorithm generates a multi-granularity structure from the initial network to be optimized,then uses different optimization strategies to optimize the networks at various granular layers in this structure,and finally realizes the information exchange between different granular layers,thereby further enhancing the optimization effect.We propose new network refresh,crossover,and mutation operators to ensure that the optimized network satisfies the given constraints.Meanwhile,we propose new network similarity and network dissimilarity evaluation metrics to improve the effectiveness of the optimization operators in the algorithm.In the experiments,the MGIA enhances the robustness of the scale-free network by 67.6%.This improvement is approximately 17.2%higher than the optimization effects achieved by eight currently existing complex network robustness optimization algorithms.展开更多
Low Earth orbit(LEO)satellite networks exhibit distinct characteristics,e.g.,limited resources of individual satellite nodes and dynamic network topology,which have brought many challenges for routing algorithms.To sa...Low Earth orbit(LEO)satellite networks exhibit distinct characteristics,e.g.,limited resources of individual satellite nodes and dynamic network topology,which have brought many challenges for routing algorithms.To satisfy quality of service(QoS)requirements of various users,it is critical to research efficient routing strategies to fully utilize satellite resources.This paper proposes a multi-QoS information optimized routing algorithm based on reinforcement learning for LEO satellite networks,which guarantees high level assurance demand services to be prioritized under limited satellite resources while considering the load balancing performance of the satellite networks for low level assurance demand services to ensure the full and effective utilization of satellite resources.An auxiliary path search algorithm is proposed to accelerate the convergence of satellite routing algorithm.Simulation results show that the generated routing strategy can timely process and fully meet the QoS demands of high assurance services while effectively improving the load balancing performance of the link.展开更多
Internet of things networks often suffer from early node failures and short lifespan due to energy limits.Traditional routing methods are not enough.This work proposes a new hybrid algorithm called ACOGA.It combines A...Internet of things networks often suffer from early node failures and short lifespan due to energy limits.Traditional routing methods are not enough.This work proposes a new hybrid algorithm called ACOGA.It combines Ant Colony Optimization(ACO)and the Greedy Algorithm(GA).ACO finds smart paths while Greedy makes quick decisions.This improves energy use and performance.ACOGA outperforms Hybrid Energy-Efficient(HEE)and Adaptive Lossless Data Compression(ALDC)algorithms.After 500 rounds,only 5%of ACOGA’s nodes are dead,compared to 15%for HEE and 20%for ALDC.The network using ACOGA runs for 1200 rounds before the first nodes fail.HEE lasts 900 rounds and ALDC only 850.ACOGA saves at least 15%more energy by better distributing the load.It also achieves a 98%packet delivery rate.The method works well in mixed IoT networks like Smart Water Management Systems(SWMS).These systems have different power levels and communication ranges.The simulation of proposed model has been done in MATLAB simulator.The results show that that the proposed model outperform then the existing models.展开更多
Project construction and development are an impor-tant part of future army designs.In today’s world,intelligent war-fare and joint operations have become the dominant develop-ments in warfare,so the construction and ...Project construction and development are an impor-tant part of future army designs.In today’s world,intelligent war-fare and joint operations have become the dominant develop-ments in warfare,so the construction and development of the army need top-down,top-level design,and comprehensive plan-ning.The traditional project development model is no longer suf-ficient to meet the army’s complex capability requirements.Projects in various fields need to be developed and coordinated to form a joint force and improve the army’s combat effective-ness.At the same time,when a program consists of large-scale project data,the effectiveness of the traditional,precise mathe-matical planning method is greatly reduced because it is time-consuming,costly,and impractical.To solve above problems,this paper proposes a multi-stage program optimization model based on a heterogeneous network and hybrid genetic algo-rithm and verifies the effectiveness and feasibility of the model and algorithm through an example.The results show that the hybrid algorithm proposed in this paper is better than the exist-ing meta-heuristic algorithm.展开更多
This study proposes a novel time-synchronization protocol inspired by stochastic gradient algorithms.The clock model of each network node in this synchronizer is configured as a generic adaptive filter where different...This study proposes a novel time-synchronization protocol inspired by stochastic gradient algorithms.The clock model of each network node in this synchronizer is configured as a generic adaptive filter where different stochastic gradient algorithms can be adopted for adaptive clock frequency adjustments.The study analyzes the pairwise synchronization behavior of the protocol and proves the generalized convergence of the synchronization error and clock frequency.A novel closed-form expression is also derived for a generalized asymptotic error variance steady state.Steady and convergence analyses are then presented for the synchronization,with frequency adaptations done using least mean square(LMS),the Newton search,the gradient descent(GraDes),the normalized LMS(N-LMS),and the Sign-Data LMS algorithms.Results obtained from real-time experiments showed a better performance of our protocols as compared to the Average Proportional-Integral Synchronization Protocol(AvgPISync)regarding the impact of quantization error on synchronization accuracy,precision,and convergence time.This generalized approach to time synchronization allows flexibility in selecting a suitable protocol for different wireless sensor network applications.展开更多
Wireless sensor network deployment optimization is a classic NP-hard problem and a popular topic in academic research.However,the current research on wireless sensor network deployment problems uses overly simplistic ...Wireless sensor network deployment optimization is a classic NP-hard problem and a popular topic in academic research.However,the current research on wireless sensor network deployment problems uses overly simplistic models,and there is a significant gap between the research results and actual wireless sensor networks.Some scholars have now modeled data fusion networks to make them more suitable for practical applications.This paper will explore the deployment problem of a stochastic data fusion wireless sensor network(SDFWSN),a model that reflects the randomness of environmental monitoring and uses data fusion techniques widely used in actual sensor networks for information collection.The deployment problem of SDFWSN is modeled as a multi-objective optimization problem.The network life cycle,spatiotemporal coverage,detection rate,and false alarm rate of SDFWSN are used as optimization objectives to optimize the deployment of network nodes.This paper proposes an enhanced multi-objective mongoose optimization algorithm(EMODMOA)to solve the deployment problem of SDFWSN.First,to overcome the shortcomings of the DMOA algorithm,such as its low convergence and tendency to get stuck in a local optimum,an encircling and hunting strategy is introduced into the original algorithm to propose the EDMOA algorithm.The EDMOA algorithm is designed as the EMODMOA algorithm by selecting reference points using the K-Nearest Neighbor(KNN)algorithm.To verify the effectiveness of the proposed algorithm,the EMODMOA algorithm was tested at CEC 2020 and achieved good results.In the SDFWSN deployment problem,the algorithm was compared with the Non-dominated Sorting Genetic Algorithm II(NSGAII),Multiple Objective Particle Swarm Optimization(MOPSO),Multi-Objective Evolutionary Algorithm based on Decomposition(MOEA/D),and Multi-Objective Grey Wolf Optimizer(MOGWO).By comparing and analyzing the performance evaluation metrics and optimization results of the objective functions of the multi-objective algorithms,the algorithm outperforms the other algorithms in the SDFWSN deployment results.To better demonstrate the superiority of the algorithm,simulations of diverse test cases were also performed,and good results were obtained.展开更多
The adoption of 5G for Railways(5G-R)is expanding,particularly in high-speed trains,due to the benefits offered by 5G technology.High-speed trains must provide seamless connectivity and Quality of Service(QoS)to ensur...The adoption of 5G for Railways(5G-R)is expanding,particularly in high-speed trains,due to the benefits offered by 5G technology.High-speed trains must provide seamless connectivity and Quality of Service(QoS)to ensure passengers have a satisfactory experience throughout their journey.Installing base stations along urban environments can improve coverage but can dramatically reduce the experience of users due to interference.In particular,when a user with a mobile phone is a passenger in a high speed train traversing between urban centres,the coverage and the 5G resources in general need to be adequate not to diminish her experience of the service.The utilization of macro,pico,and femto cells may optimize the utilization of 5G resources.In this paper,a Genetic Algorithm(GA)-based approach to address the challenges of 5G network planning for 5G-R services is presented.The network is divided into three cell types,macro,pico,and femto cells—and the optimization process is designed to achieve a balance between key objectives:providing comprehensive coverage,minimizing interference,and maximizing energy efficiency.The study focuses on environments with high user density,such as high-speed trains,where reliable and high-quality connectivity is critical.Through simulations,the effectiveness of the GA-driven framework in optimizing coverage and performance in such scenarios is demonstrated.The algorithm is compared with the Particle Swarm Optimisation(PSO)and the Simulated Annealing(SA)methods and interesting insights emerged.The GA offers a strong balance between coverage and efficiency,achieving significantly higher coverage than PSO while maintaining competitive energy efficiency and interference levels.Its steady fitness improvement and adaptability make it well-suited for scenarios where wide coverage is a priority alongside acceptable performance trade-offs.展开更多
With the continuous growth of power demand and the diversification of power consumption structure,the loss of distribution network has gradually become the focus of attention.Given the problems of single loss reductio...With the continuous growth of power demand and the diversification of power consumption structure,the loss of distribution network has gradually become the focus of attention.Given the problems of single loss reduction measure,lack of economy,and practicality in existing research,this paper proposes an optimization method of distribution network loss reduction based on tabu search algorithm and optimizes the combination and parameter configuration of loss reduction measure.The optimization model is developed with the goal of maximizing comprehensive benefits,incorporating both economic and environmental factors,and accounting for investment costs,including the loss of power reduction.Additionally,the model ensures that constraint conditions such as power flow equations,voltage deviations,and line transmission capacities are satisfied.The solution is obtained through a tabu search algorithm,which is well-suited for solving nonlinear problems with multiple constraints.Combined with the example of 10kV25 node construction,the simulation results show that the method can significantly reduce the network loss on the basis of ensuring the economy and environmental protection of the system,which provides a theoretical basis for distribution network planning.展开更多
The presence of circles in the network maximum flow problem increases the complexity of the preflow algorithm.This study proposes a novel two-stage preflow algorithm to address this issue.First,this study proves that ...The presence of circles in the network maximum flow problem increases the complexity of the preflow algorithm.This study proposes a novel two-stage preflow algorithm to address this issue.First,this study proves that at least one zero-flow arc must be present when the flow of the network reaches its maximum value.This result indicates that the maximum flow of the network will remain constant if a zero-flow arc within a circle is removed;therefore,the maximum flow of each network without circles can be calculated.The first stage involves identifying the zero-flow arc in the circle when the network flow reaches its maximum.The second stage aims to remove the zero-flow arc identified and modified in the first stage,thereby producing a new network without circles.The maximum flow of the original looped network can be obtained by solving the maximum flow of the newly generated acyclic network.Finally,an example is provided to demonstrate the validity and feasibility of this algorithm.This algorithm not only improves computational efficiency but also provides new perspectives and tools for solving similar network optimization problems.展开更多
To extract and display the significant information of combat systems,this paper introduces the methodology of functional cartography into combat networks and proposes an integrated framework named“functional cartogra...To extract and display the significant information of combat systems,this paper introduces the methodology of functional cartography into combat networks and proposes an integrated framework named“functional cartography of heterogeneous combat networks based on the operational chain”(FCBOC).In this framework,a functional module detection algorithm named operational chain-based label propagation algorithm(OCLPA),which considers the cooperation and interactions among combat entities and can thus naturally tackle network heterogeneity,is proposed to identify the functional modules of the network.Then,the nodes and their modules are classified into different roles according to their properties.A case study shows that FCBOC can provide a simplified description of disorderly information of combat networks and enable us to identify their functional and structural network characteristics.The results provide useful information to help commanders make precise and accurate decisions regarding the protection,disintegration or optimization of combat networks.Three algorithms are also compared with OCLPA to show that FCBOC can most effectively find functional modules with practical meaning.展开更多
The accurate estimation of lithium battery state of health(SOH)plays an important role in the health management of battery systems.In order to improve the prediction accuracy of SOH,this paper proposes a stochastic co...The accurate estimation of lithium battery state of health(SOH)plays an important role in the health management of battery systems.In order to improve the prediction accuracy of SOH,this paper proposes a stochastic configuration network based on a multi-converged black-winged kite search algorithm,called SBKA-CLSCN.Firstly,the indirect health index(HI)of the battery is extracted by combining it with Person correlation coefficients in the battery charging and discharging cycle point data.Secondly,to address the problem that the black-winged kite optimization algorithm(BKA)falls into the local optimum problem and improve the convergence speed,the Sine chaotic black-winged kite search algorithm(SBKA)is designed,which mainly utilizes the Sine mapping and the golden-sine strategy to enhance the algorithm’s global optimality search ability;secondly,the Cauchy distribution and Laplace regularization techniques are used in the SCN model,which is referred to as CLSCN,thereby improving the model’s overall search capability and generalization ability.Finally,the performance of SBKA and SBKA-CLSCN is evaluated using eight benchmark functions and the CALCE battery dataset,respectively,and compared in comparison with the Long Short-Term Memory(LSTM)model and the Gated Recurrent Unit(GRU)model,and the experimental results demonstrate the feasibility and effectiveness of the SBKA-CLSCN algorithm.展开更多
Accurately forecasting peak particle velocity(PPV)during blasting operations plays a crucial role in mitigating vibration-related hazards and preventing economic losses.This research introduces an approach to PPV pred...Accurately forecasting peak particle velocity(PPV)during blasting operations plays a crucial role in mitigating vibration-related hazards and preventing economic losses.This research introduces an approach to PPV prediction by combining conventional empirical equations with physics-informed neural networks(PINN)and optimizing the model parameters via the Particle Swarm Optimization(PSO)algorithm.The proposed PSO-PINN framework was rigorously benchmarked against seven established machine learning approaches:Multilayer Perceptron(MLP),Extreme Gradient Boosting(XGBoost),Random Forest(RF),Support Vector Regression(SVR),Gradient Boosting Decision Tree(GBDT),Adaptive Boosting(Adaboost),and Gene Expression Programming(GEP).Comparative analysis showed that PSO-PINN outperformed these models,achieving RMSE reductions of 17.82-37.63%,MSE reductions of 32.47-61.10%,AR improvements of 2.97-21.19%,and R^(2)enhancements of 7.43-29.21%,demonstrating superior accuracy and generalization.Furthermore,the study determines the impact of incorporating empirical formulas as physical constraints in neural networks and examines the effects of different empirical equations,particle swarm size,iteration count in PSO,regularization coefficient,and learning rate in PINN on model performance.Lastly,a predictive system for blast vibration PPV is designed and implemented.The research outcomes offer theoretical references and practical recommendations for blast vibration forecasting in similar engineering applications.展开更多
Wireless Sensor Networks(WSNs),as a crucial component of the Internet of Things(IoT),are widely used in environmental monitoring,industrial control,and security surveillance.However,WSNs still face challenges such as ...Wireless Sensor Networks(WSNs),as a crucial component of the Internet of Things(IoT),are widely used in environmental monitoring,industrial control,and security surveillance.However,WSNs still face challenges such as inaccurate node clustering,low energy efficiency,and shortened network lifespan in practical deployments,which significantly limit their large-scale application.To address these issues,this paper proposes an Adaptive Chaotic Ant Colony Optimization algorithm(AC-ACO),aiming to optimize the energy utilization and system lifespan of WSNs.AC-ACO combines the path-planning capability of Ant Colony Optimization(ACO)with the dynamic characteristics of chaotic mapping and introduces an adaptive mechanism to enhance the algorithm’s flexibility and adaptability.By dynamically adjusting the pheromone evaporation factor and heuristic weights,efficient node clustering is achieved.Additionally,a chaotic mapping initialization strategy is employed to enhance population diversity and avoid premature convergence.To validate the algorithm’s performance,this paper compares AC-ACO with clustering methods such as Low-Energy Adaptive Clustering Hierarchy(LEACH),ACO,Particle Swarm Optimization(PSO),and Genetic Algorithm(GA).Simulation results demonstrate that AC-ACO outperforms the compared algorithms in key metrics such as energy consumption optimization,network lifetime extension,and communication delay reduction,providing an efficient solution for improving energy efficiency and ensuring long-term stable operation of wireless sensor networks.展开更多
The quantum hybrid algorithm has recently become a very promising and speedy method for solving larger-scale optimization problems in the noisy intermediate-scale quantum(NISQ)era.The unit commitment(UC)problem is a f...The quantum hybrid algorithm has recently become a very promising and speedy method for solving larger-scale optimization problems in the noisy intermediate-scale quantum(NISQ)era.The unit commitment(UC)problem is a fundamental problem in the field of power systems that aims to satisfy the power balance constraint with minimal cost.In this paper,we focus on the implementation of the UC solution using exact quantum algorithms based on the quantum neural network(QNN).This method is tested with a ten-unit system under the power balance constraint.In order to improve computing precision and reduce network complexity,we propose a knowledge-based partially connected quantum neural network(PCQNN).The results show that exact solutions can be obtained by the improved algorithm and that the depth of the quantum circuit can be reduced simultaneously.展开更多
This paper proposes a cost-optimal energy management strategy for reconfigurable distribution networks with high penetration of renewable generation.The proposed strategy accounts for renewable generation costs,mainte...This paper proposes a cost-optimal energy management strategy for reconfigurable distribution networks with high penetration of renewable generation.The proposed strategy accounts for renewable generation costs,maintenance and operating expenses of energy storage systems,diesel generator operational costs,typical daily load profiles,and power balance constraints.A penalty term for power backflow is incorporated into the objective function to discourage undesirable reverse flows.The Bald Eagle Search(BES)meta-heuristic is adopted to solve the resulting constrained optimization problem.Numerical simulations under multiple load scenarios demonstrate that the proposed method effectively reduces operating cost while preventing power backflow and maintaining secure operation of the distribution network.展开更多
This study addresses the critical challenge of reconfiguration in unbalanced power distribution networks(UPDNs),focusing on the complex 123-Bus test system.Three scenarios are investigated:(1)simultaneous power loss r...This study addresses the critical challenge of reconfiguration in unbalanced power distribution networks(UPDNs),focusing on the complex 123-Bus test system.Three scenarios are investigated:(1)simultaneous power loss reduction and voltage profile improvement,(2)minimization of voltage and current unbalance indices under various operational cases,and(3)multi-objective optimization using Pareto front analysis to concurrently optimize voltage unbalance index,active power loss,and current unbalance index.Unlike previous research that oftensimplified system components,this work maintains all equipment,including capacitor banks,transformers,and voltage regulators,to ensure realistic results.The study evaluates twelve metaheuristic algorithms to solve the reconfiguration problem(RecPrb)in UPDNs.A comprehensive statistical analysis is conducted to identify the most efficient algorithm for solving the RecPrb in the 123-Bus UPDN,employing multiple performance metrics and comparative techniques.The Artificial Hummingbird Algorithm emerges as the top-performing algorithm and is subsequently applied to address a multi-objective optimization challenge in the 123-Bus UPDN.This research contributes valuable insights for network operators and researchers in selecting suitable algorithms for specific reconfiguration scenarios,advancing the field of UPDN optimization and management.展开更多
Low earth orbit (LEO) satellite networkscan provide wider service coverage and lower latencythan traditional terrestrial networks, which haveattracted considerable attention. However, the unevendistribution of human p...Low earth orbit (LEO) satellite networkscan provide wider service coverage and lower latencythan traditional terrestrial networks, which haveattracted considerable attention. However, the unevendistribution of human population and data trafficon the ground incurs unbalanced traffic load inLEO satellite networks. To this end, we proposea load-balancing routing algorithm for LEO satellitenetworks based on ant colony optimization and reinforcementlearning. In the ant colony algorithm,we improve the pheromone update rule by introducingload-aware heuristic information, e.g., the currentnode transmission overhead, delay and load status, andreinforcement learning-based link quality evaluation.It enables the routing algorithm to select the lightlyloaded node as the next hop to balance the networkload. We simulate and verify the proposed algorithmusing the NS2 simulation platform, and the resultsshow that our algorithm improves the data delivery ratioand throughput while ensuring lower latency andtransmission overhead.展开更多
With the birth of Software-Defined Networking(SDN),integration of both SDN and traditional architectures becomes the development trend of computer networks.Network intrusion detection faces challenges in dealing with ...With the birth of Software-Defined Networking(SDN),integration of both SDN and traditional architectures becomes the development trend of computer networks.Network intrusion detection faces challenges in dealing with complex attacks in SDN environments,thus to address the network security issues from the viewpoint of Artificial Intelligence(AI),this paper introduces the Crayfish Optimization Algorithm(COA)to the field of intrusion detection for both SDN and traditional network architectures,and based on the characteristics of the original COA,an Improved Crayfish Optimization Algorithm(ICOA)is proposed by integrating strategies of elite reverse learning,Levy flight,crowding factor and parameter modification.The ICOA is then utilized for AI-integrated feature selection of intrusion detection for both SDN and traditional network architectures,to reduce the dimensionality of the data and improve the performance of network intrusion detection.Finally,the performance evaluation is performed by testing not only the NSL-KDD dataset and the UNSW-NB 15 dataset for traditional networks but also the InSDN dataset for SDN-based networks.Experimental results show that ICOA improves the accuracy by 0.532%and 2.928%respectively compared with GWO and COA in traditional networks.In SDN networks,the accuracy of ICOA is 0.25%and 0.3%higher than COA and PSO.These findings collectively indicate that AI-integrated feature selection based on the proposed ICOA can promote network intrusion detection for both SDN and traditional architectures.展开更多
Recommending personalized travel routes from sparse,implicit feedback poses a significant challenge,as conventional systems often struggle with information overload and fail to capture the complex,sequential nature of...Recommending personalized travel routes from sparse,implicit feedback poses a significant challenge,as conventional systems often struggle with information overload and fail to capture the complex,sequential nature of user preferences.To address this,we propose a Conditional Generative Adversarial Network(CGAN)that generates diverse and highly relevant itineraries.Our approach begins by constructing a conditional vector that encapsulates a user’s profile.This vector uniquely fuses embeddings from a Heterogeneous Information Network(HIN)to model complex user-place-route relationships,a Recurrent Neural Network(RNN)to capture sequential path dynamics,and Neural Collaborative Filtering(NCF)to incorporate collaborative signals from the wider user base.This comprehensive condition,further enhanced with features representing user interaction confidence and uncertainty,steers a CGAN stabilized by spectral normalization to generate high-fidelity latent route representations,effectively mitigating the data sparsity problem.Recommendations are then formulated using an Anchor-and-Expand algorithm,which selects relevant starting Points of Interest(POI)based on user history,then expands routes through latent similarity matching and geographic coherence optimization,culminating in Traveling Salesman Problem(TSP)-based route optimization for practical travel distances.Experiments on a real-world check-in dataset validate our model’s unique generative capability,achieving F1 scores ranging from 0.163 to 0.305,and near-zero pairs−F1 scores between 0.002 and 0.022.These results confirm the model’s success in generating novel travel routes by recommending new locations and sequences rather than replicating users’past itineraries.This work provides a robust solution for personalized travel planning,capable of generating novel and compelling routes for both new and existing users by learning from collective travel intelligence.展开更多
Community detection is one of the most fundamental applications in understanding the structure of complicated networks.Furthermore,it is an important approach to identifying closely linked clusters of nodes that may r...Community detection is one of the most fundamental applications in understanding the structure of complicated networks.Furthermore,it is an important approach to identifying closely linked clusters of nodes that may represent underlying patterns and relationships.Networking structures are highly sensitive in social networks,requiring advanced techniques to accurately identify the structure of these communities.Most conventional algorithms for detecting communities perform inadequately with complicated networks.In addition,they miss out on accurately identifying clusters.Since single-objective optimization cannot always generate accurate and comprehensive results,as multi-objective optimization can.Therefore,we utilized two objective functions that enable strong connections between communities and weak connections between them.In this study,we utilized the intra function,which has proven effective in state-of-the-art research studies.We proposed a new inter-function that has demonstrated its effectiveness by making the objective of detecting external connections between communities is to make them more distinct and sparse.Furthermore,we proposed a Multi-Objective community strength enhancement algorithm(MOCSE).The proposed algorithm is based on the framework of the Multi-Objective Evolutionary Algorithm with Decomposition(MOEA/D),integrated with a new heuristic mutation strategy,community strength enhancement(CSE).The results demonstrate that the model is effective in accurately identifying community structures while also being computationally efficient.The performance measures used to evaluate the MOEA/D algorithm in our work are normalized mutual information(NMI)and modularity(Q).It was tested using five state-of-the-art algorithms on social networks,comprising real datasets(Zachary,Dolphin,Football,Krebs,SFI,Jazz,and Netscience),as well as twenty synthetic datasets.These results provide the robustness and practical value of the proposed algorithm in multi-objective community identification.展开更多
基金National Natural Science Foundation of China(11971211,12171388).
文摘Complex network models are frequently employed for simulating and studyingdiverse real-world complex systems.Among these models,scale-free networks typically exhibit greater fragility to malicious attacks.Consequently,enhancing the robustness of scale-free networks has become a pressing issue.To address this problem,this paper proposes a Multi-Granularity Integration Algorithm(MGIA),which aims to improve the robustness of scale-free networks while keeping the initial degree of each node unchanged,ensuring network connectivity and avoiding the generation of multiple edges.The algorithm generates a multi-granularity structure from the initial network to be optimized,then uses different optimization strategies to optimize the networks at various granular layers in this structure,and finally realizes the information exchange between different granular layers,thereby further enhancing the optimization effect.We propose new network refresh,crossover,and mutation operators to ensure that the optimized network satisfies the given constraints.Meanwhile,we propose new network similarity and network dissimilarity evaluation metrics to improve the effectiveness of the optimization operators in the algorithm.In the experiments,the MGIA enhances the robustness of the scale-free network by 67.6%.This improvement is approximately 17.2%higher than the optimization effects achieved by eight currently existing complex network robustness optimization algorithms.
基金National Key Research and Development Program(2021YFB2900604)。
文摘Low Earth orbit(LEO)satellite networks exhibit distinct characteristics,e.g.,limited resources of individual satellite nodes and dynamic network topology,which have brought many challenges for routing algorithms.To satisfy quality of service(QoS)requirements of various users,it is critical to research efficient routing strategies to fully utilize satellite resources.This paper proposes a multi-QoS information optimized routing algorithm based on reinforcement learning for LEO satellite networks,which guarantees high level assurance demand services to be prioritized under limited satellite resources while considering the load balancing performance of the satellite networks for low level assurance demand services to ensure the full and effective utilization of satellite resources.An auxiliary path search algorithm is proposed to accelerate the convergence of satellite routing algorithm.Simulation results show that the generated routing strategy can timely process and fully meet the QoS demands of high assurance services while effectively improving the load balancing performance of the link.
文摘Internet of things networks often suffer from early node failures and short lifespan due to energy limits.Traditional routing methods are not enough.This work proposes a new hybrid algorithm called ACOGA.It combines Ant Colony Optimization(ACO)and the Greedy Algorithm(GA).ACO finds smart paths while Greedy makes quick decisions.This improves energy use and performance.ACOGA outperforms Hybrid Energy-Efficient(HEE)and Adaptive Lossless Data Compression(ALDC)algorithms.After 500 rounds,only 5%of ACOGA’s nodes are dead,compared to 15%for HEE and 20%for ALDC.The network using ACOGA runs for 1200 rounds before the first nodes fail.HEE lasts 900 rounds and ALDC only 850.ACOGA saves at least 15%more energy by better distributing the load.It also achieves a 98%packet delivery rate.The method works well in mixed IoT networks like Smart Water Management Systems(SWMS).These systems have different power levels and communication ranges.The simulation of proposed model has been done in MATLAB simulator.The results show that that the proposed model outperform then the existing models.
基金supported by the National Natural Science Foundation of China(724701189072431011).
文摘Project construction and development are an impor-tant part of future army designs.In today’s world,intelligent war-fare and joint operations have become the dominant develop-ments in warfare,so the construction and development of the army need top-down,top-level design,and comprehensive plan-ning.The traditional project development model is no longer suf-ficient to meet the army’s complex capability requirements.Projects in various fields need to be developed and coordinated to form a joint force and improve the army’s combat effective-ness.At the same time,when a program consists of large-scale project data,the effectiveness of the traditional,precise mathe-matical planning method is greatly reduced because it is time-consuming,costly,and impractical.To solve above problems,this paper proposes a multi-stage program optimization model based on a heterogeneous network and hybrid genetic algo-rithm and verifies the effectiveness and feasibility of the model and algorithm through an example.The results show that the hybrid algorithm proposed in this paper is better than the exist-ing meta-heuristic algorithm.
基金funded by Universiti Putra Malaysia under a Geran Putra Inisiatif(GPI)research grant with reference to GP-GPI/2023/9762100.
文摘This study proposes a novel time-synchronization protocol inspired by stochastic gradient algorithms.The clock model of each network node in this synchronizer is configured as a generic adaptive filter where different stochastic gradient algorithms can be adopted for adaptive clock frequency adjustments.The study analyzes the pairwise synchronization behavior of the protocol and proves the generalized convergence of the synchronization error and clock frequency.A novel closed-form expression is also derived for a generalized asymptotic error variance steady state.Steady and convergence analyses are then presented for the synchronization,with frequency adaptations done using least mean square(LMS),the Newton search,the gradient descent(GraDes),the normalized LMS(N-LMS),and the Sign-Data LMS algorithms.Results obtained from real-time experiments showed a better performance of our protocols as compared to the Average Proportional-Integral Synchronization Protocol(AvgPISync)regarding the impact of quantization error on synchronization accuracy,precision,and convergence time.This generalized approach to time synchronization allows flexibility in selecting a suitable protocol for different wireless sensor network applications.
基金supported by the National Natural Science Foundation of China under Grant Nos.U21A20464,62066005Innovation Project of Guangxi Graduate Education under Grant No.YCSW2024313.
文摘Wireless sensor network deployment optimization is a classic NP-hard problem and a popular topic in academic research.However,the current research on wireless sensor network deployment problems uses overly simplistic models,and there is a significant gap between the research results and actual wireless sensor networks.Some scholars have now modeled data fusion networks to make them more suitable for practical applications.This paper will explore the deployment problem of a stochastic data fusion wireless sensor network(SDFWSN),a model that reflects the randomness of environmental monitoring and uses data fusion techniques widely used in actual sensor networks for information collection.The deployment problem of SDFWSN is modeled as a multi-objective optimization problem.The network life cycle,spatiotemporal coverage,detection rate,and false alarm rate of SDFWSN are used as optimization objectives to optimize the deployment of network nodes.This paper proposes an enhanced multi-objective mongoose optimization algorithm(EMODMOA)to solve the deployment problem of SDFWSN.First,to overcome the shortcomings of the DMOA algorithm,such as its low convergence and tendency to get stuck in a local optimum,an encircling and hunting strategy is introduced into the original algorithm to propose the EDMOA algorithm.The EDMOA algorithm is designed as the EMODMOA algorithm by selecting reference points using the K-Nearest Neighbor(KNN)algorithm.To verify the effectiveness of the proposed algorithm,the EMODMOA algorithm was tested at CEC 2020 and achieved good results.In the SDFWSN deployment problem,the algorithm was compared with the Non-dominated Sorting Genetic Algorithm II(NSGAII),Multiple Objective Particle Swarm Optimization(MOPSO),Multi-Objective Evolutionary Algorithm based on Decomposition(MOEA/D),and Multi-Objective Grey Wolf Optimizer(MOGWO).By comparing and analyzing the performance evaluation metrics and optimization results of the objective functions of the multi-objective algorithms,the algorithm outperforms the other algorithms in the SDFWSN deployment results.To better demonstrate the superiority of the algorithm,simulations of diverse test cases were also performed,and good results were obtained.
文摘The adoption of 5G for Railways(5G-R)is expanding,particularly in high-speed trains,due to the benefits offered by 5G technology.High-speed trains must provide seamless connectivity and Quality of Service(QoS)to ensure passengers have a satisfactory experience throughout their journey.Installing base stations along urban environments can improve coverage but can dramatically reduce the experience of users due to interference.In particular,when a user with a mobile phone is a passenger in a high speed train traversing between urban centres,the coverage and the 5G resources in general need to be adequate not to diminish her experience of the service.The utilization of macro,pico,and femto cells may optimize the utilization of 5G resources.In this paper,a Genetic Algorithm(GA)-based approach to address the challenges of 5G network planning for 5G-R services is presented.The network is divided into three cell types,macro,pico,and femto cells—and the optimization process is designed to achieve a balance between key objectives:providing comprehensive coverage,minimizing interference,and maximizing energy efficiency.The study focuses on environments with high user density,such as high-speed trains,where reliable and high-quality connectivity is critical.Through simulations,the effectiveness of the GA-driven framework in optimizing coverage and performance in such scenarios is demonstrated.The algorithm is compared with the Particle Swarm Optimisation(PSO)and the Simulated Annealing(SA)methods and interesting insights emerged.The GA offers a strong balance between coverage and efficiency,achieving significantly higher coverage than PSO while maintaining competitive energy efficiency and interference levels.Its steady fitness improvement and adaptability make it well-suited for scenarios where wide coverage is a priority alongside acceptable performance trade-offs.
文摘With the continuous growth of power demand and the diversification of power consumption structure,the loss of distribution network has gradually become the focus of attention.Given the problems of single loss reduction measure,lack of economy,and practicality in existing research,this paper proposes an optimization method of distribution network loss reduction based on tabu search algorithm and optimizes the combination and parameter configuration of loss reduction measure.The optimization model is developed with the goal of maximizing comprehensive benefits,incorporating both economic and environmental factors,and accounting for investment costs,including the loss of power reduction.Additionally,the model ensures that constraint conditions such as power flow equations,voltage deviations,and line transmission capacities are satisfied.The solution is obtained through a tabu search algorithm,which is well-suited for solving nonlinear problems with multiple constraints.Combined with the example of 10kV25 node construction,the simulation results show that the method can significantly reduce the network loss on the basis of ensuring the economy and environmental protection of the system,which provides a theoretical basis for distribution network planning.
基金The National Natural Science Foundation of China(No.72001107,72271120)the Fundamental Research Funds for the Central Universities(No.NS2024047,NP2024106)the China Postdoctoral Science Foundation(No.2020T130297,2019M660119).
文摘The presence of circles in the network maximum flow problem increases the complexity of the preflow algorithm.This study proposes a novel two-stage preflow algorithm to address this issue.First,this study proves that at least one zero-flow arc must be present when the flow of the network reaches its maximum value.This result indicates that the maximum flow of the network will remain constant if a zero-flow arc within a circle is removed;therefore,the maximum flow of each network without circles can be calculated.The first stage involves identifying the zero-flow arc in the circle when the network flow reaches its maximum.The second stage aims to remove the zero-flow arc identified and modified in the first stage,thereby producing a new network without circles.The maximum flow of the original looped network can be obtained by solving the maximum flow of the newly generated acyclic network.Finally,an example is provided to demonstrate the validity and feasibility of this algorithm.This algorithm not only improves computational efficiency but also provides new perspectives and tools for solving similar network optimization problems.
文摘To extract and display the significant information of combat systems,this paper introduces the methodology of functional cartography into combat networks and proposes an integrated framework named“functional cartography of heterogeneous combat networks based on the operational chain”(FCBOC).In this framework,a functional module detection algorithm named operational chain-based label propagation algorithm(OCLPA),which considers the cooperation and interactions among combat entities and can thus naturally tackle network heterogeneity,is proposed to identify the functional modules of the network.Then,the nodes and their modules are classified into different roles according to their properties.A case study shows that FCBOC can provide a simplified description of disorderly information of combat networks and enable us to identify their functional and structural network characteristics.The results provide useful information to help commanders make precise and accurate decisions regarding the protection,disintegration or optimization of combat networks.Three algorithms are also compared with OCLPA to show that FCBOC can most effectively find functional modules with practical meaning.
文摘The accurate estimation of lithium battery state of health(SOH)plays an important role in the health management of battery systems.In order to improve the prediction accuracy of SOH,this paper proposes a stochastic configuration network based on a multi-converged black-winged kite search algorithm,called SBKA-CLSCN.Firstly,the indirect health index(HI)of the battery is extracted by combining it with Person correlation coefficients in the battery charging and discharging cycle point data.Secondly,to address the problem that the black-winged kite optimization algorithm(BKA)falls into the local optimum problem and improve the convergence speed,the Sine chaotic black-winged kite search algorithm(SBKA)is designed,which mainly utilizes the Sine mapping and the golden-sine strategy to enhance the algorithm’s global optimality search ability;secondly,the Cauchy distribution and Laplace regularization techniques are used in the SCN model,which is referred to as CLSCN,thereby improving the model’s overall search capability and generalization ability.Finally,the performance of SBKA and SBKA-CLSCN is evaluated using eight benchmark functions and the CALCE battery dataset,respectively,and compared in comparison with the Long Short-Term Memory(LSTM)model and the Gated Recurrent Unit(GRU)model,and the experimental results demonstrate the feasibility and effectiveness of the SBKA-CLSCN algorithm.
基金supported by the National Natural Science Foundation of China(Grant No.52409143)the Basic Scientific Research Fund of Changjiang River Scientific Research Institute for Central-level Public Welfare Research Institutes(Grant No.CKSF2025184/YT)the Hubei Provincial Natural Science Foundation of China(Grant No.2022CFB673).
文摘Accurately forecasting peak particle velocity(PPV)during blasting operations plays a crucial role in mitigating vibration-related hazards and preventing economic losses.This research introduces an approach to PPV prediction by combining conventional empirical equations with physics-informed neural networks(PINN)and optimizing the model parameters via the Particle Swarm Optimization(PSO)algorithm.The proposed PSO-PINN framework was rigorously benchmarked against seven established machine learning approaches:Multilayer Perceptron(MLP),Extreme Gradient Boosting(XGBoost),Random Forest(RF),Support Vector Regression(SVR),Gradient Boosting Decision Tree(GBDT),Adaptive Boosting(Adaboost),and Gene Expression Programming(GEP).Comparative analysis showed that PSO-PINN outperformed these models,achieving RMSE reductions of 17.82-37.63%,MSE reductions of 32.47-61.10%,AR improvements of 2.97-21.19%,and R^(2)enhancements of 7.43-29.21%,demonstrating superior accuracy and generalization.Furthermore,the study determines the impact of incorporating empirical formulas as physical constraints in neural networks and examines the effects of different empirical equations,particle swarm size,iteration count in PSO,regularization coefficient,and learning rate in PINN on model performance.Lastly,a predictive system for blast vibration PPV is designed and implemented.The research outcomes offer theoretical references and practical recommendations for blast vibration forecasting in similar engineering applications.
基金funded by the Natural Science Foundation of Xinjiang Uygur Autonomous Region:No.22D01B148Bidding Topics for the Center for Integration of Education and Production and Development of New Business in 2024:No.2024-KYJD05+1 种基金Basic Scientific Research Business Fee Project of Colleges and Universities in Autonomous Region:No.XJEDU2025P126Xinjiang College of Science&Technology School-level Scientific Research Fund Project:No.2024-KYTD01.
文摘Wireless Sensor Networks(WSNs),as a crucial component of the Internet of Things(IoT),are widely used in environmental monitoring,industrial control,and security surveillance.However,WSNs still face challenges such as inaccurate node clustering,low energy efficiency,and shortened network lifespan in practical deployments,which significantly limit their large-scale application.To address these issues,this paper proposes an Adaptive Chaotic Ant Colony Optimization algorithm(AC-ACO),aiming to optimize the energy utilization and system lifespan of WSNs.AC-ACO combines the path-planning capability of Ant Colony Optimization(ACO)with the dynamic characteristics of chaotic mapping and introduces an adaptive mechanism to enhance the algorithm’s flexibility and adaptability.By dynamically adjusting the pheromone evaporation factor and heuristic weights,efficient node clustering is achieved.Additionally,a chaotic mapping initialization strategy is employed to enhance population diversity and avoid premature convergence.To validate the algorithm’s performance,this paper compares AC-ACO with clustering methods such as Low-Energy Adaptive Clustering Hierarchy(LEACH),ACO,Particle Swarm Optimization(PSO),and Genetic Algorithm(GA).Simulation results demonstrate that AC-ACO outperforms the compared algorithms in key metrics such as energy consumption optimization,network lifetime extension,and communication delay reduction,providing an efficient solution for improving energy efficiency and ensuring long-term stable operation of wireless sensor networks.
基金supported in part by the China Postdoctoral Science Foundation(Grant No.2023M740874)。
文摘The quantum hybrid algorithm has recently become a very promising and speedy method for solving larger-scale optimization problems in the noisy intermediate-scale quantum(NISQ)era.The unit commitment(UC)problem is a fundamental problem in the field of power systems that aims to satisfy the power balance constraint with minimal cost.In this paper,we focus on the implementation of the UC solution using exact quantum algorithms based on the quantum neural network(QNN).This method is tested with a ten-unit system under the power balance constraint.In order to improve computing precision and reduce network complexity,we propose a knowledge-based partially connected quantum neural network(PCQNN).The results show that exact solutions can be obtained by the improved algorithm and that the depth of the quantum circuit can be reduced simultaneously.
基金the Science and Technology Project of State Grid Jiangsu Electric Power Co.,Ltd.(Project No.J2024066).
文摘This paper proposes a cost-optimal energy management strategy for reconfigurable distribution networks with high penetration of renewable generation.The proposed strategy accounts for renewable generation costs,maintenance and operating expenses of energy storage systems,diesel generator operational costs,typical daily load profiles,and power balance constraints.A penalty term for power backflow is incorporated into the objective function to discourage undesirable reverse flows.The Bald Eagle Search(BES)meta-heuristic is adopted to solve the resulting constrained optimization problem.Numerical simulations under multiple load scenarios demonstrate that the proposed method effectively reduces operating cost while preventing power backflow and maintaining secure operation of the distribution network.
基金supported by the Scientific and Technological Research Council of Turkey(TUBITAK)under Grant No.124E002(1001-Project).
文摘This study addresses the critical challenge of reconfiguration in unbalanced power distribution networks(UPDNs),focusing on the complex 123-Bus test system.Three scenarios are investigated:(1)simultaneous power loss reduction and voltage profile improvement,(2)minimization of voltage and current unbalance indices under various operational cases,and(3)multi-objective optimization using Pareto front analysis to concurrently optimize voltage unbalance index,active power loss,and current unbalance index.Unlike previous research that oftensimplified system components,this work maintains all equipment,including capacitor banks,transformers,and voltage regulators,to ensure realistic results.The study evaluates twelve metaheuristic algorithms to solve the reconfiguration problem(RecPrb)in UPDNs.A comprehensive statistical analysis is conducted to identify the most efficient algorithm for solving the RecPrb in the 123-Bus UPDN,employing multiple performance metrics and comparative techniques.The Artificial Hummingbird Algorithm emerges as the top-performing algorithm and is subsequently applied to address a multi-objective optimization challenge in the 123-Bus UPDN.This research contributes valuable insights for network operators and researchers in selecting suitable algorithms for specific reconfiguration scenarios,advancing the field of UPDN optimization and management.
基金supported in part by the National Natural Science Foundation of China(Grant No.62273107,61702127,62272113)Science and Technology Program of Guangzhou(Grant No.201804010461).
文摘Low earth orbit (LEO) satellite networkscan provide wider service coverage and lower latencythan traditional terrestrial networks, which haveattracted considerable attention. However, the unevendistribution of human population and data trafficon the ground incurs unbalanced traffic load inLEO satellite networks. To this end, we proposea load-balancing routing algorithm for LEO satellitenetworks based on ant colony optimization and reinforcementlearning. In the ant colony algorithm,we improve the pheromone update rule by introducingload-aware heuristic information, e.g., the currentnode transmission overhead, delay and load status, andreinforcement learning-based link quality evaluation.It enables the routing algorithm to select the lightlyloaded node as the next hop to balance the networkload. We simulate and verify the proposed algorithmusing the NS2 simulation platform, and the resultsshow that our algorithm improves the data delivery ratioand throughput while ensuring lower latency andtransmission overhead.
基金supported by the National Natural Science Foundation of China under Grant 61602162the Hubei Provincial Science and Technology Plan Project under Grant 2023BCB041.
文摘With the birth of Software-Defined Networking(SDN),integration of both SDN and traditional architectures becomes the development trend of computer networks.Network intrusion detection faces challenges in dealing with complex attacks in SDN environments,thus to address the network security issues from the viewpoint of Artificial Intelligence(AI),this paper introduces the Crayfish Optimization Algorithm(COA)to the field of intrusion detection for both SDN and traditional network architectures,and based on the characteristics of the original COA,an Improved Crayfish Optimization Algorithm(ICOA)is proposed by integrating strategies of elite reverse learning,Levy flight,crowding factor and parameter modification.The ICOA is then utilized for AI-integrated feature selection of intrusion detection for both SDN and traditional network architectures,to reduce the dimensionality of the data and improve the performance of network intrusion detection.Finally,the performance evaluation is performed by testing not only the NSL-KDD dataset and the UNSW-NB 15 dataset for traditional networks but also the InSDN dataset for SDN-based networks.Experimental results show that ICOA improves the accuracy by 0.532%and 2.928%respectively compared with GWO and COA in traditional networks.In SDN networks,the accuracy of ICOA is 0.25%and 0.3%higher than COA and PSO.These findings collectively indicate that AI-integrated feature selection based on the proposed ICOA can promote network intrusion detection for both SDN and traditional architectures.
基金supported by the Chung-Ang University Research Grants in 2023.Alsothe work is supported by the ELLIIT Excellence Center at Linköping–Lund in Information Technology in Sweden.
文摘Recommending personalized travel routes from sparse,implicit feedback poses a significant challenge,as conventional systems often struggle with information overload and fail to capture the complex,sequential nature of user preferences.To address this,we propose a Conditional Generative Adversarial Network(CGAN)that generates diverse and highly relevant itineraries.Our approach begins by constructing a conditional vector that encapsulates a user’s profile.This vector uniquely fuses embeddings from a Heterogeneous Information Network(HIN)to model complex user-place-route relationships,a Recurrent Neural Network(RNN)to capture sequential path dynamics,and Neural Collaborative Filtering(NCF)to incorporate collaborative signals from the wider user base.This comprehensive condition,further enhanced with features representing user interaction confidence and uncertainty,steers a CGAN stabilized by spectral normalization to generate high-fidelity latent route representations,effectively mitigating the data sparsity problem.Recommendations are then formulated using an Anchor-and-Expand algorithm,which selects relevant starting Points of Interest(POI)based on user history,then expands routes through latent similarity matching and geographic coherence optimization,culminating in Traveling Salesman Problem(TSP)-based route optimization for practical travel distances.Experiments on a real-world check-in dataset validate our model’s unique generative capability,achieving F1 scores ranging from 0.163 to 0.305,and near-zero pairs−F1 scores between 0.002 and 0.022.These results confirm the model’s success in generating novel travel routes by recommending new locations and sequences rather than replicating users’past itineraries.This work provides a robust solution for personalized travel planning,capable of generating novel and compelling routes for both new and existing users by learning from collective travel intelligence.
文摘Community detection is one of the most fundamental applications in understanding the structure of complicated networks.Furthermore,it is an important approach to identifying closely linked clusters of nodes that may represent underlying patterns and relationships.Networking structures are highly sensitive in social networks,requiring advanced techniques to accurately identify the structure of these communities.Most conventional algorithms for detecting communities perform inadequately with complicated networks.In addition,they miss out on accurately identifying clusters.Since single-objective optimization cannot always generate accurate and comprehensive results,as multi-objective optimization can.Therefore,we utilized two objective functions that enable strong connections between communities and weak connections between them.In this study,we utilized the intra function,which has proven effective in state-of-the-art research studies.We proposed a new inter-function that has demonstrated its effectiveness by making the objective of detecting external connections between communities is to make them more distinct and sparse.Furthermore,we proposed a Multi-Objective community strength enhancement algorithm(MOCSE).The proposed algorithm is based on the framework of the Multi-Objective Evolutionary Algorithm with Decomposition(MOEA/D),integrated with a new heuristic mutation strategy,community strength enhancement(CSE).The results demonstrate that the model is effective in accurately identifying community structures while also being computationally efficient.The performance measures used to evaluate the MOEA/D algorithm in our work are normalized mutual information(NMI)and modularity(Q).It was tested using five state-of-the-art algorithms on social networks,comprising real datasets(Zachary,Dolphin,Football,Krebs,SFI,Jazz,and Netscience),as well as twenty synthetic datasets.These results provide the robustness and practical value of the proposed algorithm in multi-objective community identification.
