期刊文献+
共找到10,816篇文章
< 1 2 250 >
每页显示 20 50 100
Application of DSAPSO Algorithm in Distribution Network Reconfiguration with Distributed Generation
1
作者 Caixia Tao Shize Yang Taiguo Li 《Energy Engineering》 EI 2024年第1期187-201,共15页
With the current integration of distributed energy resources into the grid,the structure of distribution networks is becoming more complex.This complexity significantly expands the solution space in the optimization p... With the current integration of distributed energy resources into the grid,the structure of distribution networks is becoming more complex.This complexity significantly expands the solution space in the optimization process for network reconstruction using intelligent algorithms.Consequently,traditional intelligent algorithms frequently encounter insufficient search accuracy and become trapped in local optima.To tackle this issue,a more advanced particle swarm optimization algorithm is proposed.To address the varying emphases at different stages of the optimization process,a dynamic strategy is implemented to regulate the social and self-learning factors.The Metropolis criterion is introduced into the simulated annealing algorithm to occasionally accept suboptimal solutions,thereby mitigating premature convergence in the population optimization process.The inertia weight is adjusted using the logistic mapping technique to maintain a balance between the algorithm’s global and local search abilities.The incorporation of the Pareto principle involves the consideration of network losses and voltage deviations as objective functions.A fuzzy membership function is employed for selecting the results.Simulation analysis is carried out on the restructuring of the distribution network,using the IEEE-33 node system and the IEEE-69 node system as examples,in conjunction with the integration of distributed energy resources.The findings demonstrate that,in comparison to other intelligent optimization algorithms,the proposed enhanced algorithm demonstrates a shorter convergence time and effectively reduces active power losses within the network.Furthermore,it enhances the amplitude of node voltages,thereby improving the stability of distribution network operations and power supply quality.Additionally,the algorithm exhibits a high level of generality and applicability. 展开更多
关键词 Reconfiguration of distribution network distributed generation particle swarm optimization algorithm simulated annealing algorithm active network loss
下载PDF
Optimal Location and Sizing ofMulti-Resource Distributed Generator Based onMulti-Objective Artificial Bee Colony Algorithm
2
作者 Qiangfei Cao Huilai Wang +1 位作者 Zijia Hui Lingyun Chen 《Energy Engineering》 EI 2024年第2期499-521,共23页
Distribution generation(DG)technology based on a variety of renewable energy technologies has developed rapidly.A large number of multi-type DG are connected to the distribution network(DN),resulting in a decline in t... Distribution generation(DG)technology based on a variety of renewable energy technologies has developed rapidly.A large number of multi-type DG are connected to the distribution network(DN),resulting in a decline in the stability of DN operation.It is urgent to find a method that can effectively connect multi-energy DG to DN.photovoltaic(PV),wind power generation(WPG),fuel cell(FC),and micro gas turbine(MGT)are considered in this paper.A multi-objective optimization model was established based on the life cycle cost(LCC)of DG,voltage quality,voltage fluctuation,system network loss,power deviation of the tie-line,DG pollution emission index,and meteorological index weight of DN.Multi-objective artificial bee colony algorithm(MOABC)was used to determine the optimal location and capacity of the four kinds of DG access DN,and compared with the other three heuristic algorithms.Simulation tests based on IEEE 33 test node and IEEE 69 test node show that in IEEE 33 test node,the total voltage deviation,voltage fluctuation,and system network loss of DN decreased by 49.67%,7.47%and 48.12%,respectively,compared with that without DG configuration.In the IEEE 69 test node,the total voltage deviation,voltage fluctuation and system network loss of DN in the MOABC configuration scheme decreased by 54.98%,35.93%and 75.17%,respectively,compared with that without DG configuration,indicating that MOABC can reasonably plan the capacity and location of DG.Achieve the maximum trade-off between DG economy and DN operation stability. 展开更多
关键词 distributed generation distribution network life cycle cost multi-objective artificial bee colony algorithm voltage stability
下载PDF
Energy Economic Dispatch for Photovoltaic-Storage via Distributed Event-Triggered Surplus Algorithm
3
作者 Kaicheng Liu Chen Liang +2 位作者 Naiyue Wu Xiaoyang Dong Hui Yu 《Energy Engineering》 EI 2024年第9期2621-2637,共17页
This paper presents a novel approach to economic dispatch in smart grids equipped with diverse energy devices.This method integrates features including photovoltaic(PV)systems,energy storage coupling,varied energy rol... This paper presents a novel approach to economic dispatch in smart grids equipped with diverse energy devices.This method integrates features including photovoltaic(PV)systems,energy storage coupling,varied energy roles,and energy supply and demand dynamics.The systemmodel is developed by considering energy devices as versatile units capable of fulfilling various functionalities and playing multiple roles simultaneously.To strike a balance between optimality and feasibility,renewable energy resources are modeled with considerations for forecasting errors,Gaussian distribution,and penalty factors.Furthermore,this study introduces a distributed event-triggered surplus algorithm designed to address the economic dispatch problem by minimizing production costs.Rooted in surplus theory and finite time projection,the algorithm effectively rectifies network imbalances caused by directed graphs and addresses local inequality constraints.The algorithm greatly reduces the communication burden through event triggering mechanism.Finally,both theoretical proofs and numerical simulations verify the convergence and event-triggered nature of the algorithm. 展开更多
关键词 Fully distributed algorithm economic dispatch directed graph renewable energy resource
下载PDF
Distributed Optimal Variational GNE Seeking in Merely Monotone Games
4
作者 Wangli He Yanzhen Wang 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2024年第7期1621-1630,共10页
In this paper, the optimal variational generalized Nash equilibrium(v-GNE) seeking problem in merely monotone games with linearly coupled cost functions is investigated, in which the feasible strategy domain of each a... In this paper, the optimal variational generalized Nash equilibrium(v-GNE) seeking problem in merely monotone games with linearly coupled cost functions is investigated, in which the feasible strategy domain of each agent is coupled through an affine constraint. A distributed algorithm based on the hybrid steepest descent method is first proposed to seek the optimal v-GNE. Then, an accelerated algorithm with relaxation is proposed and analyzed, which has the potential to further improve the convergence speed to the optimal v-GNE. Some sufficient conditions in both algorithms are obtained to ensure the global convergence towards the optimal v-GNE. To illustrate the performance of the algorithms, numerical simulation is conducted based on a networked Nash-Cournot game with bounded market capacities. 展开更多
关键词 distributed algorithms equilibria selection generalized Nash equilibrium(GNE) merely monotone games
下载PDF
A Whale Optimization Algorithm with Distributed Collaboration and Reverse Learning Ability 被引量:2
5
作者 Zhedong Xu Yongbo Su +1 位作者 Fang Yang Ming Zhang 《Computers, Materials & Continua》 SCIE EI 2023年第6期5965-5986,共22页
Due to the development of digital transformation,intelligent algorithms are getting more and more attention.The whale optimization algorithm(WOA)is one of swarm intelligence optimization algorithms and is widely used ... Due to the development of digital transformation,intelligent algorithms are getting more and more attention.The whale optimization algorithm(WOA)is one of swarm intelligence optimization algorithms and is widely used to solve practical engineering optimization problems.However,with the increased dimensions,higher requirements are put forward for algorithm performance.The double population whale optimization algorithm with distributed collaboration and reverse learning ability(DCRWOA)is proposed to solve the slow convergence speed and unstable search accuracy of the WOA algorithm in optimization problems.In the DCRWOA algorithm,the novel double population search strategy is constructed.Meanwhile,the reverse learning strategy is adopted in the population search process to help individuals quickly jump out of the non-ideal search area.Numerical experi-ments are carried out using standard test functions with different dimensions(10,50,100,200).The optimization case of shield construction parameters is also used to test the practical application performance of the proposed algo-rithm.The results show that the DCRWOA algorithm has higher optimization accuracy and stability,and the convergence speed is significantly improved.Therefore,the proposed DCRWOA algorithm provides a better method for solving practical optimization problems. 展开更多
关键词 Whale optimization algorithm double population cooperation distributION reverse learning convergence speed
下载PDF
Distributed collaborative complete coverage path planning based on hybrid strategy
6
作者 ZHANG Jia DU Xin +1 位作者 DONG Qichen XIN Bin 《Journal of Systems Engineering and Electronics》 SCIE CSCD 2024年第2期463-472,共10页
Collaborative coverage path planning(CCPP) refers to obtaining the shortest paths passing over all places except obstacles in a certain area or space. A multi-unmanned aerial vehicle(UAV) collaborative CCPP algorithm ... Collaborative coverage path planning(CCPP) refers to obtaining the shortest paths passing over all places except obstacles in a certain area or space. A multi-unmanned aerial vehicle(UAV) collaborative CCPP algorithm is proposed for the urban rescue search or military search in outdoor environment.Due to flexible control of small UAVs, it can be considered that all UAVs fly at the same altitude, that is, they perform search tasks on a two-dimensional plane. Based on the agents’ motion characteristics and environmental information, a mathematical model of CCPP problem is established. The minimum time for UAVs to complete the CCPP is the objective function, and complete coverage constraint, no-fly constraint, collision avoidance constraint, and communication constraint are considered. Four motion strategies and two communication strategies are designed. Then a distributed CCPP algorithm is designed based on hybrid strategies. Simulation results compared with patternbased genetic algorithm(PBGA) and random search method show that the proposed method has stronger real-time performance and better scalability and can complete the complete CCPP task more efficiently and stably. 展开更多
关键词 multi-agent cooperation unmanned aerial vehicles(UAV) distributed algorithm complete coverage path planning(CCPP)
下载PDF
Optimal Configuration of Fault Location Measurement Points in DC Distribution Networks Based on Improved Particle Swarm Optimization Algorithm
7
作者 Huanan Yu Hangyu Li +1 位作者 He Wang Shiqiang Li 《Energy Engineering》 EI 2024年第6期1535-1555,共21页
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. 展开更多
关键词 Optimal allocation improved particle swarm algorithm fault location compressed sensing DC distribution network
下载PDF
Distributed Momentum-Based Frank-Wolfe Algorithm for Stochastic Optimization 被引量:1
8
作者 Jie Hou Xianlin Zeng +2 位作者 Gang Wang Jian Sun Jie Chen 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2023年第3期685-699,共15页
This paper considers distributed stochastic optimization,in which a number of agents cooperate to optimize a global objective function through local computations and information exchanges with neighbors over a network... This paper considers distributed stochastic optimization,in which a number of agents cooperate to optimize a global objective function through local computations and information exchanges with neighbors over a network.Stochastic optimization problems are usually tackled by variants of projected stochastic gradient descent.However,projecting a point onto a feasible set is often expensive.The Frank-Wolfe(FW)method has well-documented merits in handling convex constraints,but existing stochastic FW algorithms are basically developed for centralized settings.In this context,the present work puts forth a distributed stochastic Frank-Wolfe solver,by judiciously combining Nesterov's momentum and gradient tracking techniques for stochastic convex and nonconvex optimization over networks.It is shown that the convergence rate of the proposed algorithm is O(k^(-1/2))for convex optimization,and O(1/log_(2)(k))for nonconvex optimization.The efficacy of the algorithm is demonstrated by numerical simulations against a number of competing alternatives. 展开更多
关键词 distributed optimization Frank-Wolfe(FW)algorithms momentum-based method stochastic optimization
下载PDF
Adaptive Butterfly Optimization Algorithm(ABOA)Based Feature Selection and Deep Neural Network(DNN)for Detection of Distributed Denial-of-Service(DDoS)Attacks in Cloud
9
作者 S.Sureshkumar G.K.D.Prasanna Venkatesan R.Santhosh 《Computer Systems Science & Engineering》 SCIE EI 2023年第10期1109-1123,共15页
Cloud computing technology provides flexible,on-demand,and completely controlled computing resources and services are highly desirable.Despite this,with its distributed and dynamic nature and shortcomings in virtualiz... Cloud computing technology provides flexible,on-demand,and completely controlled computing resources and services are highly desirable.Despite this,with its distributed and dynamic nature and shortcomings in virtualization deployment,the cloud environment is exposed to a wide variety of cyber-attacks and security difficulties.The Intrusion Detection System(IDS)is a specialized security tool that network professionals use for the safety and security of the networks against attacks launched from various sources.DDoS attacks are becoming more frequent and powerful,and their attack pathways are continually changing,which requiring the development of new detection methods.Here the purpose of the study is to improve detection accuracy.Feature Selection(FS)is critical.At the same time,the IDS’s computational problem is limited by focusing on the most relevant elements,and its performance and accuracy increase.In this research work,the suggested Adaptive butterfly optimization algorithm(ABOA)framework is used to assess the effectiveness of a reduced feature subset during the feature selection phase,that was motivated by this motive Candidates.Accurate classification is not compromised by using an ABOA technique.The design of Deep Neural Networks(DNN)has simplified the categorization of network traffic into normal and DDoS threat traffic.DNN’s parameters can be finetuned to detect DDoS attacks better using specially built algorithms.Reduced reconstruction error,no exploding or vanishing gradients,and reduced network are all benefits of the changes outlined in this paper.When it comes to performance criteria like accuracy,precision,recall,and F1-Score are the performance measures that show the suggested architecture outperforms the other existing approaches.Hence the proposed ABOA+DNN is an excellent method for obtaining accurate predictions,with an improved accuracy rate of 99.05%compared to other existing approaches. 展开更多
关键词 Cloud computing distributed denial of service intrusion detection system adaptive butterfly optimization algorithm deep neural network
下载PDF
Grid Side Distributed Energy Storage Cloud Group End Region Hierarchical Time-Sharing Configuration Algorithm Based onMulti-Scale and Multi Feature Convolution Neural Network
10
作者 Wen Long Bin Zhu +3 位作者 Huaizheng Li Yan Zhu Zhiqiang Chen Gang Cheng 《Energy Engineering》 EI 2023年第5期1253-1269,共17页
There is instability in the distributed energy storage cloud group end region on the power grid side.In order to avoid large-scale fluctuating charging and discharging in the power grid environment and make the capaci... There is instability in the distributed energy storage cloud group end region on the power grid side.In order to avoid large-scale fluctuating charging and discharging in the power grid environment and make the capacitor components showa continuous and stable charging and discharging state,a hierarchical time-sharing configuration algorithm of distributed energy storage cloud group end region on the power grid side based on multi-scale and multi feature convolution neural network is proposed.Firstly,a voltage stability analysis model based onmulti-scale and multi feature convolution neural network is constructed,and the multi-scale and multi feature convolution neural network is optimized based on Self-OrganizingMaps(SOM)algorithm to analyze the voltage stability of the cloud group end region of distributed energy storage on the grid side under the framework of credibility.According to the optimal scheduling objectives and network size,the distributed robust optimal configuration control model is solved under the framework of coordinated optimal scheduling at multiple time scales;Finally,the time series characteristics of regional power grid load and distributed generation are analyzed.According to the regional hierarchical time-sharing configuration model of“cloud”,“group”and“end”layer,the grid side distributed energy storage cloud group end regional hierarchical time-sharing configuration algorithm is realized.The experimental results show that after applying this algorithm,the best grid side distributed energy storage configuration scheme can be determined,and the stability of grid side distributed energy storage cloud group end region layered timesharing configuration can be improved. 展开更多
关键词 Multiscale and multi feature convolution neural network distributed energy storage at grid side cloud group end region layered time-sharing configuration algorithm
下载PDF
Multi-source coordinated stochastic restoration for SOP in distribution networks with a two-stage algorithm 被引量:1
11
作者 Xianxu Huo Pan Zhang +3 位作者 Tao Zhang Shiting Sun Zhanyi Li Lei Dong 《Global Energy Interconnection》 EI CAS CSCD 2023年第2期141-153,共13页
After suffering from a grid blackout, distributed energy resources(DERs), such as local renewable energy and controllable distributed generators and energy storage can be used to restore loads enhancing the system’s ... After suffering from a grid blackout, distributed energy resources(DERs), such as local renewable energy and controllable distributed generators and energy storage can be used to restore loads enhancing the system’s resilience. In this study, a multi-source coordinated load restoration strategy was investigated for a distribution network with soft open points(SOPs). Here, the flexible regulation ability of the SOPs is fully utilized to improve the load restoration level while mitigating voltage deviations. Owing to the uncertainty, a scenario-based stochastic optimization approach was employed,and the load restoration problem was formulated as a mixed-integer nonlinear programming model. A computationally efficient solution algorithm was developed for the model using convex relaxation and linearization methods. The algorithm is organized into a two-stage structure, in which the energy storage system is dispatched in the first stage by solving a relaxed convex problem. In the second stage, an integer programming problem is calculated to acquire the outputs of both SOPs and power resources. A numerical test was conducted on both IEEE 33-bus and IEEE 123-bus systems to validate the effectiveness of the proposed strategy. 展开更多
关键词 Load restoration Soft open points distribution network Stochastic optimization Two-stage algorithm
下载PDF
Distributed blackboard decision-making framework for collaborative planning based on nested genetic algorithm 被引量:4
12
作者 Yaozhong Zhang Lei Zhang Zhiqiang Du 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2015年第6期1236-1243,共8页
A distributed blackboard decision-making framework for collaborative planning based on nested genetic algorithm (NGA) is proposed. By using blackboard-based communication paradigm and shared data structure, multiple... A distributed blackboard decision-making framework for collaborative planning based on nested genetic algorithm (NGA) is proposed. By using blackboard-based communication paradigm and shared data structure, multiple decision-makers (DMs) can collaboratively solve the tasks-platforms allocation scheduling problems dynamically through the coordinator. This methodo- logy combined with NGA maximizes tasks execution accuracy, also minimizes the weighted total workload of the DM which is measured in terms of intra-DM and inter-DM coordination. The intra-DM employs an optimization-based scheduling algorithm to match the tasks-platforms assignment request with its own platforms. The inter-DM coordinates the exchange of collaborative request information and platforms among DMs using the blackboard architecture. The numerical result shows that the proposed black- board DM framework based on NGA can obtain a near-optimal solution for the tasks-platforms collaborative planning problem. The assignment of platforms-tasks and the patterns of coordination can achieve a nice trade-off between intra-DM and inter-DM coordination workload. 展开更多
关键词 distributed collaborative planning BLACKBOARD decision maker (DM) nested genetic algorithm (NGA).
下载PDF
Distributed consensus algorithm for networked Euler-Lagrange systems with self-delays and uncertainties 被引量:3
13
作者 Xu Zhu dianguo Yan Yaohong Qu 《Journal of Systems Engineering and Electronics》 SCIE EI CSCD 2012年第6期898-905,共8页
A distributed coordinated consensus problem for multiple networked Euler-Lagrange systems is studied. The communication between agents is subject to time delays, unknown parameters and nonlinear inputs, but only with ... A distributed coordinated consensus problem for multiple networked Euler-Lagrange systems is studied. The communication between agents is subject to time delays, unknown parameters and nonlinear inputs, but only with their states available for measurement. When the communication topology of the system is connected, an adaptive control algorithm with selfdelays and uncertainties is suggested to guarantee global full-state synchro-nization that the difference between the agent's positions and ve-locities asymptotically converges to zero. Moreover, the distributed sliding-mode law is given for chaotic systems with nonlinear inputs to compensate for the effects of nonlinearity. Finally, simulation results show the effectiveness of the proposed control algorithm. 展开更多
关键词 networked multi-agent system Euler-Lagrange (EL)system distributed consensus algorithm Lyapunov stability self-delay uncertainty.
下载PDF
A Fully Distributed Approach to Optimal Energy Scheduling of Users and Generators Considering a Novel Combined Neurodynamic Algorithm in Smart Grid 被引量:4
14
作者 Chentao Xu Xing He 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2021年第7期1325-1335,共11页
A fully distributed microgrid system model is presented in this paper.In the user side,two types of load and plug-in electric vehicles are considered to schedule energy for more benefits.The charging and discharging s... A fully distributed microgrid system model is presented in this paper.In the user side,two types of load and plug-in electric vehicles are considered to schedule energy for more benefits.The charging and discharging states of the electric vehicles are represented by the zero-one variables with more flexibility.To solve the nonconvex optimization problem of the users,a novel neurodynamic algorithm which combines the neural network algorithm with the differential evolution algorithm is designed and its convergence speed is faster.A distributed algorithm with a new approach to deal with the inequality constraints is used to solve the convex optimization problem of the generators which can protect their privacy.Simulation results and comparative experiments show that the model and algorithms are effective. 展开更多
关键词 Differential evolution algorithm distributed algorithm electric vehicle neural network zero-one variable.
下载PDF
Distribution Network Optimization Model of Industrial Park with Distributed Energy Resources under the Carbon Neutral Targets
15
作者 Xiaobao Yu Kang Yang 《Energy Engineering》 EI 2023年第12期2741-2760,共20页
Taking an industrial park as an example,this study aims to analyze the characteristics of a distribution network that incorporates distributed energy resources(DERs).The study begins by summarizing the key features of... Taking an industrial park as an example,this study aims to analyze the characteristics of a distribution network that incorporates distributed energy resources(DERs).The study begins by summarizing the key features of a distribution network with DERs based on recent power usage data.To predict and analyze the load growth of the industrial park,an improved back-propagation algorithm is employed.Furthermore,the study classifies users within the industrial park according to their specific power consumption and supply requirements.This user segmentation allows for the introduction of three constraints:node voltage,wire current,and capacity of DERs.By incorporating these constraints,the study constructs an optimization model for the distribution network in the industrial park,with the objective of minimizing the total operation and maintenance cost.The primary goal of these optimizations is to address the needs of DERs connected to the distribution network,while simultaneously mitigating their potential adverse impact on the network.Additionally,the study aims to enhance the overall energy efficiency of the industrial park through more efficient utilization of resources. 展开更多
关键词 distributed energy resources improved back-propagation algorithm multi-population genetic algorithm distribution energy carbon neutral
下载PDF
Retrieval and Regional Distribution Analysis of Ammonia,Sulfur Dioxide and Nitrogen Dioxide in the Urban Environment Using Ultraviolet DOAS Algorithm
16
作者 Hao Chen Jie Xu +5 位作者 YiboHu Fuzhou Niu Zhiyan Li Dan Wang Guizhong Fu Chuanxin Li 《Computer Modeling in Engineering & Sciences》 SCIE EI 2023年第2期1251-1262,共12页
Aiming at the in situ and mobile observation of urban environmental air pollution,a portable instrument using ultraviolet spectrum retrieval algorithm was developed based on the basis of Differential Optical Absorptio... Aiming at the in situ and mobile observation of urban environmental air pollution,a portable instrument using ultraviolet spectrum retrieval algorithm was developed based on the basis of Differential Optical Absorption Spectroscopy(DOAS)and multiple-pass cell technique.Typical trace gas pollutants,NH3,SO2,and NO2,were explored using their optical spectral characteristics in deep ultraviolet wavelength range from 210 to 215 nm.The gas concentration was retrieved by Lambert-Beer’s law and nonlinear least square method.With an optimized optical alignment,the detection limits of NH3,SO2,NO2 were estimated to be 2.2,2.3,and 36.2 ppb,respectively.The system was used in carrying out some cruise observations in Chengdu,China.During the entire period,the polluted gases showed varied distribution and typical daily average concentrations ofNH3,SO2,NO2 were 23.2,3.5,and 106.0 ppb,respectively.The contributions from different sources were analyzed combined with the HYSPLIT model.Results show that the portable DOAS system is a convenient and effective tool for regional distribution measurement and pollution source monitoring. 展开更多
关键词 Ultraviolet DOAS algorithm retrieve method white cell urban environment regional distribution
下载PDF
A Primal-Dual SGD Algorithm for Distributed Nonconvex Optimization 被引量:4
17
作者 Xinlei Yi Shengjun Zhang +2 位作者 Tao Yang Tianyou Chai Karl Henrik Johansson 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2022年第5期812-833,共22页
The distributed nonconvex optimization problem of minimizing a global cost function formed by a sum of n local cost functions by using local information exchange is considered.This problem is an important component of... The distributed nonconvex optimization problem of minimizing a global cost function formed by a sum of n local cost functions by using local information exchange is considered.This problem is an important component of many machine learning techniques with data parallelism,such as deep learning and federated learning.We propose a distributed primal-dual stochastic gradient descent(SGD)algorithm,suitable for arbitrarily connected communication networks and any smooth(possibly nonconvex)cost functions.We show that the proposed algorithm achieves the linear speedup convergence rate O(1/(√nT))for general nonconvex cost functions and the linear speedup convergence rate O(1/(nT)) when the global cost function satisfies the Polyak-Lojasiewicz(P-L)condition,where T is the total number of iterations.We also show that the output of the proposed algorithm with constant parameters linearly converges to a neighborhood of a global optimum.We demonstrate through numerical experiments the efficiency of our algorithm in comparison with the baseline centralized SGD and recently proposed distributed SGD algorithms. 展开更多
关键词 distributed nonconvex optimization linear speedup Polyak-Lojasiewicz(P-L)condition primal-dual algorithm stochastic gradient descent
下载PDF
A Distributed Newton Method for Processing Signals Defined on the Large-Scale Networks
18
作者 Yanhai Zhang Junzheng Jiang +1 位作者 Haitao Wang Mou Ma 《China Communications》 SCIE CSCD 2023年第5期315-329,共15页
In the graph signal processing(GSP)framework,distributed algorithms are highly desirable in processing signals defined on large-scale networks.However,in most existing distributed algorithms,all nodes homogeneously pe... In the graph signal processing(GSP)framework,distributed algorithms are highly desirable in processing signals defined on large-scale networks.However,in most existing distributed algorithms,all nodes homogeneously perform the local computation,which calls for heavy computational and communication costs.Moreover,in many real-world networks,such as those with straggling nodes,the homogeneous manner may result in serious delay or even failure.To this end,we propose active network decomposition algorithms to select non-straggling nodes(normal nodes)that perform the main computation and communication across the network.To accommodate the decomposition in different kinds of networks,two different approaches are developed,one is centralized decomposition that leverages the adjacency of the network and the other is distributed decomposition that employs the indicator message transmission between neighboring nodes,which constitutes the main contribution of this paper.By incorporating the active decomposition scheme,a distributed Newton method is employed to solve the least squares problem in GSP,where the Hessian inverse is approximately evaluated by patching a series of inverses of local Hessian matrices each of which is governed by one normal node.The proposed algorithm inherits the fast convergence of the second-order algorithms while maintains low computational and communication cost.Numerical examples demonstrate the effectiveness of the proposed algorithm. 展开更多
关键词 graph signal processing distributed Newton method active network decomposition secondorder algorithm
下载PDF
An Improved Hyperplane Assisted Multiobjective Optimization for Distributed Hybrid Flow Shop Scheduling Problem in Glass Manufacturing Systems
19
作者 Yadian Geng Junqing Li 《Computer Modeling in Engineering & Sciences》 SCIE EI 2023年第1期241-266,共26页
To solve the distributed hybrid flow shop scheduling problem(DHFS)in raw glass manufacturing systems,we investigated an improved hyperplane assisted evolutionary algorithm(IhpaEA).Two objectives are simultaneously con... To solve the distributed hybrid flow shop scheduling problem(DHFS)in raw glass manufacturing systems,we investigated an improved hyperplane assisted evolutionary algorithm(IhpaEA).Two objectives are simultaneously considered,namely,the maximum completion time and the total energy consumptions.Firstly,each solution is encoded by a three-dimensional vector,i.e.,factory assignment,scheduling,and machine assignment.Subsequently,an efficient initialization strategy embeds two heuristics are developed,which can increase the diversity of the population.Then,to improve the global search abilities,a Pareto-based crossover operator is designed to take more advantage of non-dominated solutions.Furthermore,a local search heuristic based on three parts encoding is embedded to enhance the searching performance.To enhance the local search abilities,the cooperation of the search operator is designed to obtain better non-dominated solutions.Finally,the experimental results demonstrate that the proposed algorithm is more efficient than the other three state-of-the-art algorithms.The results show that the Pareto optimal solution set obtained by the improved algorithm is superior to that of the traditional multiobjective algorithm in terms of diversity and convergence of the solution. 展开更多
关键词 distributed hybrid flow shop energy consumption hyperplane-assisted multi-objective algorithm glass manufacturing system
下载PDF
ADMM-based Distributed Algorithm for Economic Dispatch in Power Systems With Both Packet Drops and Communication Delays 被引量:5
20
作者 Qing Yang Gang Chen Ting Wang 《IEEE/CAA Journal of Automatica Sinica》 SCIE EI CSCD 2020年第3期842-852,共11页
By virtue of alternating direction method of multipliers(ADMM), Newton-Raphson method, ratio consensus approach and running sum method, two distributed iterative strategies are presented in this paper to address the e... By virtue of alternating direction method of multipliers(ADMM), Newton-Raphson method, ratio consensus approach and running sum method, two distributed iterative strategies are presented in this paper to address the economic dispatch problem(EDP) in power systems. Different from most of the existing distributed ED approaches which neglect the effects of packet drops or/and time delays, this paper takes into account both packet drops and time delays which frequently occur in communication networks. Moreover, directed and possibly unbalanced graphs are considered in our algorithms, over which many distributed approaches fail to converge. Furthermore, the proposed schemes can address the EDP with local constraints of generators and nonquadratic convex cost functions, not just quadratic ones required in some existing ED approaches. Both theoretical analyses and simulation studies are provided to demonstrate the effectiveness of the proposed schemes. 展开更多
关键词 ALTERNATING direction method of multipliers(ADMM) average consensus directed graph(digraph) distributed algorithm economic DISPATCH packet DROPS time DELAYS
下载PDF
上一页 1 2 250 下一页 到第
使用帮助 返回顶部