نتایج جستجو برای: Imperialistic Competitive Algorithm
تعداد نتایج: 833071 فیلتر نتایج به سال:
How to use renewable sources has been a great problem for many years. Researchers have invented and developed Microgrids, flexible networks with a central control system; nevertheless, for installing renewable sources on them there is still questions. As a result, researchers started to use different algorithms in order to solve problems and find best answers for electrical functions. One of th...
in this paper, we present a new method to determine the optimal location and parameter settings of unifiedpower flow controller (upfc) for removing voltage violations and transmission lines overloading. upfc isconsidered as the most powerful member of the facts devices, that it can control shunt and series power flow.this option gives to upfc the power to control the voltage profile and transmi...
In this paper, a method for extracting edges from Imperialistic competition evolutionary algorithm is used. The edges of this method are obtained in two distinct ways: The first method of imperialistic competitive algorithm for optimizing the parameters of a decision threshold. The method is useful to derive the standard Sobel edge operator and improved Sobel operator productivity. The second m...
the scheduling problems are the non-polynomial problems-hard (np-hard), is to solve it, and meta-heuristic innovative method compared with the exact method require less time and memory.in this research, developed imperialistic competitive algorithm used to solving the single-mode resource-constrained project scheduling problem.also the basic feasible solution algorithm used in order to increase...
In engineering, flood routing is an important technique necessary for the solution of a floodcontrol problem and for the satisfactory operation of a flood-prediction service. A simple conceptual model like the Muskingum model is very effective for the flood routing process. One challenge in application of the Muskingum model is that its parameters cannot be measured physically. In this article ...
In graph theory, Graph Colouring Problem (GCP) is an assignment of colours to vertices of any given graph such that the colours on adjacent vertices are different. The GCP is known to be an optimization and NP-hard problem. Imperialist Competitive Algorithm (ICA) is a meta-heuristic optimization and stochastic search strategy which is inspired from socio-political phenomenon of imperialistic co...
In this paper we re-call a recently developed meta heuristic optimization algorithm based on socio-political process of imperialistic competition. This Colonial Competitive Algorithm (CCA) has shown its efficient capability in comparison to convenient optimization algorithms like GA, PSO. In this study we investigate the synthesis problem of unequally linear space antenna using CCA and show the...
The novel Imperialist Competitive Algorithm (ICA) that was recently introduced has a good performance in some optimization problems. The ICA inspired by socio-political process of imperialistic competition of human being in the real world. In this paper, a new Imperialist Competitive Algorithm with Adaptive Radius of Colonies movement (ICAR) is proposed. In the proposed algorithm, for an effect...
measurement of magnitude and frequency of the voltage flicker is very important for monitoring andcontrolling voltage flicker efficiently to improve the network power quality. this paper presents twonew methods for measurement of flicker signal parameters using shuffled frog leaping algorithm(sfla) and imperialist competitive algorithm (ica). this paper estimates fundamental voltage andflicker ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید