Research on Grid Planning of Dual Power Distribution Network Based on Parallel Ant Colony Optimization Algorithm

A distribution network plays an extremely important role in the safe and efficient operation of a power grid.As the core part of a power grid’s operation,a distribution network will have a significant impact on the safety and reliability of residential electricity consumption.it is necessary to actively plan and modify the distribution network’s structure in the power grid,improve the quality of the distribution network,and optimize the planning of the distribution network,so that the network can be fully utilized to meet the needs of electricity consumption.In this paper,a distribution network grid planning algorithm based on the reliability of electricity consumption was completed using ant colony algorithm.For the distribution network structure planning of dual power sources,the parallel ant colony algorithm was used to prove that the premise of parallelism is the interactive process of ant colonies,and the dual power distribution network structure model is established based on the principle of the lowest cost.The artificial ants in the algorithm were compared with real ants in nature,and the basic steps and working principle of the ant colony optimization algorithm was studied with the help of the travelling salesman problem(TSP).Then,the limitations of the ant colony algorithm were analyzed,and an improvement strategy was proposed by using python for digital simulation.The results demonstrated the reliability of model-building and algorithm improvement.

Correlation knowledge extraction based on data mining for distribution network planning

Traditional distribution network planning relies on the professional knowledge of planners,especially when analyzing the correlations between the problems existing in the network and the crucial influencing factors.The inherent laws reflected by the historical data of the distribution network are ignored,which affects the objectivity of the planning scheme.In this study,to improve the efficiency and accuracy of distribution network planning,the characteristics of distribution network data were extracted using a data-mining technique,and correlation knowledge of existing problems in the network was obtained.A data-mining model based on correlation rules was established.The inputs of the model were the electrical characteristic indices screened using the gray correlation method.The Apriori algorithm was used to extract correlation knowledge from the operational data of the distribution network and obtain strong correlation rules.Degree of promotion and chi-square tests were used to verify the rationality of the strong correlation rules of the model output.In this study,the correlation relationship between heavy load or overload problems of distribution network feeders in different regions and related characteristic indices was determined,and the confidence of the correlation rules was obtained.These results can provide an effective basis for the formulation of a distribution network planning scheme.

Neural network and genetic algorithm based global path planning in a static environment

Mobile robot global path planning in a static environment is an important problem. The paper proposes a method of global path planning based on neural network and genetic algorithm. We constructed the neural network model of environmental information in the workspace for a robot and used this model to establish the relationship between a collision avoidance path and the output of the model. Then the two-dimensional coding for the path via-points was converted to one-dimensional one and the fitness of both the collision avoidance path and the shortest distance are integrated into a fitness function. The simulation results showed that the proposed method is correct and effective.

Application of Interval Algorithm in Rural Power Network Planning

Rural power network planning is a complicated nonlinear optimized combination problem which based on load forecasting results, and its actual load is affected by many uncertain factors, which influenced optimization results of rural power network planning. To solve the problems, the interval algorithm was used to modify the initial search method of uncertainty load mathematics model in rural network planning. Meanwhile, the genetic/tabu search combination algorithm was adopted to optimize the initialized network. The sample analysis results showed that compared with the certainty planning, the improved method was suitable for urban medium-voltage distribution network planning with consideration of uncertainty load and the planning results conformed to the reality.

Evolutional Algorithm Based Cascade Long Reach Passive Optical Networks Planning

In this paper, we propose a mathe- matical model for long reach Passive Optical Networks （PON） planning. The model consid- ers the traffic demand, user requirements and physical constraints. It can support conven- tional star-like topologies as well as cascade PON networks. Then a two-stage evolutional algorithm is described to solve this problem. The first stage was to find a proper splitter can- didate site set, composing the outer loop. The second stage aimed to get the optimal topology when the splitter locations were selected, com- posing the internal loop. In this algorithm, the Pr/ifer sequence is used to build up a one-to-one correspondence between a PON network configuration and a chromosome. Compared with the results obtained by the enumeration method, the proposed model and algorithm are shown to be effective and accu- rate.

Optimization of UMTS Network Planning Using Genetic Algorithms

The continuously growing of cellular networks complexity, which followed the introduction of UMTS technology, has reduced the usefulness of traditional design tools, making them quite unworthy. The purpose of this paper is to illustrate a design tool for UMTS optimized net planning based on genetic algorithms. In particular, some utilities for 3G net designers, useful to respect important aspects (such as the environmental one) of the cellular network, are shown.

A Genetic Algorithm for Overall Designing and Planning of a Long Term Evolution Advanced Network

In the mobile radio industry, planning is a fundamental step for the deployment and commissioning of a Telecom network. The proposed models are based on the technology and the focussed architecture. In this context, we introduce a comprehensive single-lens model for a fourth generation mobile network, Long Term Evolution Advanced Network (4G/LTE-A) technology which includes three sub assignments: cells in the core network. In the resolution, we propose an adaptation of the Genetic Evolutionary Algorithm for a global resolution. This is a combinatorial optimization problem that is considered as difficult. The use of this adaptive method does not necessarily lead to optimal solutions with the aim of reducing the convergence time towards a feasible solution.

UAV penetration mission path planning based on improved holonic particle swarm optimization

To meet the requirements of safety, concealment, and timeliness of trajectory planning during the unmanned aerial vehicle(UAV) penetration process, a three-dimensional path planning algorithm is proposed based on improved holonic particle swarm optimization(IHPSO). Firstly, the requirements of terrain threat, radar detection, and penetration time in the process of UAV penetration are quantified. Regarding radar threats, a radar echo analysis method based on radar cross section(RCS)and the spatial situation is proposed to quantify the concealment of UAV penetration. Then the structure-particle swarm optimization(PSO) algorithm is improved from three aspects.First, the conversion ability of the search strategy is enhanced by using the system clustering method and the information entropy grouping strategy instead of random grouping and constructing the state switching conditions based on the fitness function.Second, the unclear setting of iteration numbers is addressed by using particle spacing to create the termination condition of the algorithm. Finally, the trajectory is optimized to meet the intended requirements by building a predictive control model and using the IHPSO for simulation verification. Numerical examples show the superiority of the proposed method over the existing PSO methods.

Distribution network planning based on shortest path

In order to form an algorithm for distribution network routing,an automatic routing method of distribution network planning was proposed based on the shortest path.The problem of automatic routing was divided into two steps in the method:the first step was that the shortest paths along streets between substation and load points were found by the basic ant colony algorithm to form a preliminary radial distribution network,and the second step was that the result of the shortest path was used to initialize pheromone concentration and pheromone updating rules to generate globally optimal distribution network.Cases studies show that the proposed method is effective and can meet the planning requirements.It is verified that the proposed method has better solution and utility than planning method based on the ant colony algorithm.

Optimization of Air Route Network Nodes to Avoid ″Three Areas″ Based on An Adaptive Ant Colony Algorithm

Air route network(ARN)planning is an efficient way to alleviate civil aviation flight delays caused by increasing development and pressure for safe operation.Here,the ARN shortest path was taken as the objective function,and an air route network node(ARNN)optimization model was developed to circumvent the restrictions imposed by″three areas″,also known as prohibited areas,restricted areas,and dangerous areas(PRDs),by creating agrid environment.And finally the objective function was solved by means of an adaptive ant colony algorithm(AACA).The A593,A470,B221,and G204 air routes in the busy ZSHA flight information region,where the airspace includes areas with different levels of PRDs,were taken as an example.Based on current flight patterns,a layout optimization of the ARNN was computed using this model and algorithm and successfully avoided PRDs.The optimized result reduced the total length of routes by 2.14% and the total cost by 9.875%.

Discrete logistics network design model under interval hierarchical OD demand based on interval genetic algorithm

Aimed at the uncertain characteristics of discrete logistics network design,an interval hierarchical triangular uncertain OD demand model based on interval demand and network flow is presented.Under consideration of the system profit,the uncertain demand of logistics network is measured by interval variables and interval parameters,and an interval planning model of discrete logistics network is established.The risk coefficient and maximum constrained deviation are defined to realize the certain transformation of the model.By integrating interval algorithm and genetic algorithm,an interval hierarchical optimal genetic algorithm is proposed to solve the model.It is shown by a tested example that in the same scenario condition an interval solution[3275.3,3 603.7]can be obtained by the model and algorithm which is obviously better than the single precise optimal solution by stochastic or fuzzy algorithm,so it can be reflected that the model and algorithm have more stronger operability and the solution result has superiority to scenario decision.

3DT-PP:localization and path planning of mobile anchors over complex 3D terrains

Mobile anchors are widely used for localization in WSNs.However,special properties over 3D terrains limit the implementation of them.In this paper,a novel 3D localization algorithm is proposed,called 3 DT-PP,which utilizes path planning of mobile anchors over complex 3 D terrains,and simulations based upon the model of mountain surface network are conducted.The simulation results show that the algorithm decreases the position error by about 91%,8.7%and lowers calculation overhead by about 75%,1.3%,than the typical state-of-the-art localization algorithm(i.e.,'MDS-MAP','Landscape-3D').Thus,our algorithm is more potential in practical WSNs which are the characteristic of limited energy and 3D deployment.

PRECESION： progressive recovery and restoration planning of interdependent services in enterprise data centers

The primary focus of this paper is to design a progressive restoration plan for an enterprise data center environment following a partial or full disruption. Repairing and restoring disrupted components in an enterprise data center requires a significant amount of time and human effort. Following a major disruption, the recovery process involves multiple stages, and during each stage, the partially recovered infrastructures can provide limited services to users at some degraded service level. However, how fast and efficiently an enterprise infrastructure can be recovered de- pends on how the recovery mechanism restores the disrupted components, considering the inter-dependencies between services, along with the limitations of expert human operators. The entire problem turns out to be NP- hard and rather complex, and we devise an efficient meta-heuristic to solve the problem. By considering some real-world examples, we show that the proposed meta-heuristic provides very accurate results, and still runs 600-2800 times faster than the optimal solution obtained from a general purpose mathematical solver [1].

Analysis of Transit Network Design Using GIS and Honeybee Algorithm in the City of Sanandaj, Iran

Public transit planning is a user-oriented problem, respectful of financial issues and involves different stakeholders such as the general public, the transportation provider and the local government. One of the main components of public transit planning is the transit network design (TND) problem. This research is an attempt to perform transit network design and analysis in the city of Sanandaj, Iran using the capabilities of GIS and Honeybee algorithm. Objectives of this study are formulating a multi-objective model of the TND problem, developing a GIS-based procedure for solving the TND problem and examination of the solutions using artificial metaheuristic methods such as honeybee algorithm. The transit network design approach in this research, aims to reduce the walking distance, the total travel distance and the total number of stops needed for a suitable transit service in Sanandaj, Iran. One of the contributions of this research is developing a transit network design with utilizing a spectrum of GIS software modelling functionalities and using the abilities of the artificial intelligence in modelling and assessment of the transit network.

Improved sparrow search algorithm for RFID network planning

To solve the problem that the performance of the coverage,interference rate,load balance andweak power in the radio frequency identification(RFID)network planning.This paper proposes an elite opposition-based learning and Lévy flight sparrow search algorithm(SSA),which is named elite opposition-based learning and Levy flight SSA(ELSSA).First,the algorithm initializes the population by an elite opposed-based learning strategy to enhance the diversity of the population.Second,Lévy flight is introduced into the scrounger’s position update formula to solve the situation that the algorithm falls into the local optimal solution.It has a probability that the current position is changed by Lévy flight.This method can jump out of the local optimal solution.In the end,the proposed method is compared with particle swarm optimization(PSO)algorithm,grey wolf optimzer(GWO)algorithm and SSA in the multiple simulation tests.The simulated results showed that,under the same number of readers,the average fitness of the ELSSA is improved respectively by 3.36%,5.67%and 18.45%.By setting the different number of readers,ELSSA uses fewer readers than other algorithms.The conclusion shows that the proposed method can ensure a satisfying coverage by using fewer readers and achieving higher comprehensive performance.

应用差分进化-神经网络模型的杀爆弹瞄准点分配方法

为在不增加计算时耗的前提下提升多枚杀爆弹对面目标打击毁伤效能,建立融入动爆威力计算的多瞄准点规划方法.对面目标采用结构化网格划分方法实现多枚杀爆弹对目标毁伤区域的精确计算,并进行计算结果验证,基于多次计算结果采用神经网络方法建立单枚弹药对面目标毁伤区域的计算代理模型,在同样计算条件下,比非代理模型计算时间缩短1000倍;据此,通过差分进化算法实现多枚杀爆弹对面目标打击瞄准点及末端弹道参数的规划.通过实例对比分析表明:该瞄准点规划方法形成的打击方案比传统以毁伤半径为输入的方法毁伤效果大幅提升,最低提升25.5%,且单次规划时间不超过3 s,解决了瞄准点规划中毁伤效能模型复杂度与计算耗时之间的矛盾.

考虑截获交通流量与充电行驶距离的电动汽车充电网络规划

为优化电动汽车充电网络布局,提高充电服务能力与效率,提出了同时考虑截获交通流量与充电行驶距离的充电网络规划模型。电动汽车动力电池初始荷电状态的不确定性导致充电网络截获交通流量具有随机特性,采用蒙特卡洛模拟方法对其概率特性进行了分析。为提升充电网络在任何情况下的充电服务能力,所提模型以充电网络截获交通流量最小值最大为优化目标之一。为提升充电服务效率,模型另一个优化目标为平均充电行驶距离最短。此外,模型考虑了充电行驶距离机会约束及充电站建设数目约束,采用非支配遗传算法对所提模型进行求解,获得Pareto最优解集。最后,以25节点交通网络为例进行了仿真实验,验证了所提方法的有效性。并基于仿真结果,分析了机会约束置信度与充电站数目对规划结果的影响。

路径规划问题的多策略改进樽海鞘群算法研究

针对移动机器人寻找最优路径问题,提出了一种融合无标度网络、自适应权重和黄金正弦算法变异策略的樽海鞘群算法BAGSSA(Adaptive Salp Swarm Algorithm with Scale-free of BA Network and Golden Sine)。首先,生成一个无标度网络来映射跟随者的关系,增强算法全局寻优的能力,在追随者进化过程中集成自适应权重ω,以实现算法探索和开发的平衡;同时选用黄金正弦算法变异进一步提高解的精度。其次,对12个基准函数进行仿真求解,实验数据表明平均值、标准差、Wilcoxon检验和收敛曲线均优于基本樽海鞘群和其他群体智能算法,证明了所提算法具有较高的寻优精度和收敛速度。最后,将BAGSSA应用于移动机器人路径规划问题中,并在两种测试环境中进行仿真实验,仿真结果表明,改进樽海鞘群算法较其他算法所寻路径更优,并具有一定理论与实际应用价值。

基于改进鲸鱼算法的分布式电源双层规划

为了改善分布式电源接入配电网对电网安全、经济运行的影响,需要对分布式电源进行优化规划。充分考虑了风光出力不确定性及相关性,选择风电、光伏、微型燃气轮机作为待规划的分布式电源,建立双层规划模型。以分布式电源投资费用、运维费用、主动配电网购电费用、微型燃气轮机燃料费、污染治理费用、网络损耗费用综合最小为目标函数,建立了上层规划模型。以每个场景下年综合运行费用最小为目标,考虑功率平衡、节点电压、支路容量、分布式电源渗透率等约束条件,构建下层运行模型。针对鲸鱼算法收敛速度慢、不能及时跳出局部解等问题,采用tent映射、引入惯性权重、非线性收缩因子三种措施改进鲸鱼算法。最后通过算例仿真进行验证。结果表明:本文所提改进方法可以提高鲸鱼算法性能,可以更有效地求解所提模型。

数字孪生水网建设应着力解决的几个关键问题

数字孪生水网建设涉及多学科交叉、新技术融合,有诸多重点和难点,应着力把握好坚持问题导向、夯实算据基础、优化算法核心、强化算力支撑、着力业务应用、加强网络安全等关键问题。结合数字孪生水网建设先行先试经验,围绕工程安全、供水安全、水质安全,提出了数字孪生水网建设的关键问题及解决思路:围绕建设目标确定建设内容和重点,以问题为导向开展需求分析;打造“天空地”一体化监测感知体系,完善地面监测站网、提升新型监测感知能力、强化数据治理与运用、推进数据资源共享夯实算据基础;完善模型平台,开发知识平台,优化算法核心;建设信创云平台和高性能计算集群,扩充计算资源、升级通信网络强化算力支撑;提升水网智慧调控能力,着力实现业务“四预”;构建网络安全体系,保障网络和数据安全;理清数字孪生流域、数字孪生水网、数字孪生工程的关系,提升整体效能。