This paper presents an adaptive route selection algorithm that can be employed in the Cognitive Cooperative Network (CCN). Here each Cognitive node (CN), also called Secondary User (SU), communicates with other SUs an...
详细信息
ISBN:
(纸本)9781467386883
This paper presents an adaptive route selection algorithm that can be employed in the Cognitive Cooperative Network (CCN). Here each Cognitive node (CN), also called Secondary User (SU), communicates with other SUs and has the capability to change its transmission and receiption efficiency without interfering Primary User (PU). In this paper, we propose a modified bat algorithm for selecting best relay that is able to achieve considerable performance gain in CCN. The aim of the proposed approach is attaining a best link to send data, lesser packet delivery time, and higher throughput. For achieving lesser transmission time and better throughput we use Digital Network Coding (DNC) scheme along with Decode and Forward (DF) relaying protocol. The DF protocol with modified bat algorithm improved CCN's routing efficiency. Monte carlo simulation is used to evaluate the performance and obtained results are compared with other protocols and performance evaluation reveals that network performance has improved in throughput.
Integration of distributed generation in power system challenges operation and management of power distribution network. This paper presents modified bat algorithm for Optimal Reactive Power Dispatch (OPRF) of distrib...
详细信息
ISBN:
(纸本)9781509022946
Integration of distributed generation in power system challenges operation and management of power distribution network. This paper presents modified bat algorithm for Optimal Reactive Power Dispatch (OPRF) of distributed generation for voltage support in distribution network. An objective function with constraints of voltage, DG reactive power, thermal limits of lines is presented. A modified IEEE 37 node test feeder with variable generation was used to validate the proposed algorithm. A co-simulation setup was used in which electric grid was developed in Power system tool (DigSILENT PowerFactory) and modified bat algorithm was developed in Python. Results showed that modified bat algorithm is quite effective for voltage profile improvement and loss minimization
batalgorithm (BA) is a recently introduced Meta heuristic algorithm which mimics the echolocation behavior of micro-bats. In this paper, modified bat algorithm (MBA) is presented whose focus is to increase the explor...
详细信息
ISBN:
(纸本)9781509032945
batalgorithm (BA) is a recently introduced Meta heuristic algorithm which mimics the echolocation behavior of micro-bats. In this paper, modified bat algorithm (MBA) is presented whose focus is to increase the exploration capability of BA and improve its consistency in finding global optima. The proposed version is tested on standard benchmark problems and is compared with standard state-of-art algorithms. Experimental results show that MBA is comparatively better than BA, flower pollination algorithm (FPA), differential evolution (DE) and bat flower pollinator (BFP).
Now a day, non-uniform increase of demand on a power system turns the research toward the dynamic analysis. In this paper, to perform dynamic analysis and to solve economic load dispatch problem using optimal power fl...
详细信息
Now a day, non-uniform increase of demand on a power system turns the research toward the dynamic analysis. In this paper, to perform dynamic analysis and to solve economic load dispatch problem using optimal power flow (OPF), four realistic load levels are considered. Further, the effectiveness of the objective has been enhanced in the presence of interline power flow controller (IPFC). An optimal location identification methodology for IPFC based on line stability index (LSI) is also presented. The effect of ramp-rate limits on generations and the effect of dynamic loads on generation fuel cost and transmission losses are also analyzed on standard IEEE-30 bus and real time 23 bus test systems with supporting validations, numerical and graphical results.
In this paper, an optimal design of the two-degree-of-freedom proportional-integral-derivative-accelerated (2DOF-PIDA) controllers for the liquid-level system based on the modern optimization by using the modifiedbat...
详细信息
In this paper, an optimal design of the two-degree-of-freedom proportional-integral-derivative-accelerated (2DOF-PIDA) controllers for the liquid-level system based on the modern optimization by using the modified bat algorithm (MBA) is proposed. The MBA is the new modified version of the original batalgorithm (BA) developed from the echolocation behaviour of micro bats. To improve its exploration and exploitation properties, the random number drawn from a Levy-flight distribution and new loudness and pulse emission rate functions are proposed. Performance of the MBA over the BA investigated against 10 benchmark functions is presented in this paper. Results of the 2DOF-PIDA controllers designed by the proposed MBA for the liquid-level system are compared with those of the one-degree-of-freedom proportional-integral-derivative (1DOF-PID) controller designed by Ziegler-Nichols (ZN) tuning rule, 2DOF-PID designed by Araki-Taguchi (AT) tuning rule and 1DOF-PID and 1DOF-PIDA controllers designed by the MBA. As results, it was found that the liquid-level controlled system with the 2DOF-PIDA controllers designed by the MBA can provide very satisfactory responses superior to that with the 2DOF-PID controllers designed by AT and MBA and 1DOF-PID controller designed by ZN, significantly.
This paper deals with an extensive variant of the inverse p-facility maxian location problem on networks in which the set of vertices is considered as the existing client points and the aim is to modify (augment or re...
详细信息
This paper deals with an extensive variant of the inverse p-facility maxian location problem on networks in which the set of vertices is considered as the existing client points and the aim is to modify (augment or reduce) the underlying vertex weights and the arc lengths at the minimum overall cost with respect to the modification bounds so that a given set of p vertices, denoting the predetermined facility sites, becomes a p-facility maxian location of the perturbed network. A novel modified directional batalgorithm, as a meta-heuristic approach, is developed to solve the problem under the bottleneck-type Hamming, sum-type Hamming, rectilinear and Chebyshev cost norms. Through computational tests, the effectiveness of the proposed algorithm is shown.
In cloud computing, virtual machines (VMs) must be moved from one overloaded server to another to control impending resource requests and reduce the performance overhead. Hence, the main objective is to carry out the ...
详细信息
This paper develops a new framework to solve the practical non-convex economic dispatch problem with regard to the constraints including ramp rate limits, valve loading effect, prohibited operating zone, spinning rese...
详细信息
This paper develops a new framework to solve the practical non-convex economic dispatch problem with regard to the constraints including ramp rate limits, valve loading effect, prohibited operating zone, spinning reserve and multi-fuel option. In the proposed framework, batalgorithm, as a new optimization algorithm, is employed to explore the problem search space globally. In addition, a newly introduced adaptive modification method is developed to improve the variety of the bat population when increasing the convergence speed simultaneously. This modification is constructed based on the roulette wheel mechanism in conjunction with the crossover and mutation operators from the genetic algorithm. At the end of paper, the superiority of the proposed framework is examined using the IEEE 10-unit and 40-unit test systems.
In the present world, it is hard to overlook - the omnipresence of 'network'. Be it the study of internet structure, mobile network, protein interactions or social networks, they all religiously emphasizes on ...
详细信息
ISBN:
(纸本)9781509032518
In the present world, it is hard to overlook - the omnipresence of 'network'. Be it the study of internet structure, mobile network, protein interactions or social networks, they all religiously emphasizes on network and graph studies. Social network analysis is an emerging field including community detection as its key task. A community in a network, depicts group of nodes in which density of links is high. To find the community structure modularity metric of social network has been used in different optimization approaches like greedy optimization, simulated annealing, extremal optimization, particle swarm optimization and genetic approach. In this paper we have not only introduced modularity metrics but also hamiltonian function (potts model) amalgamated with meta-heuristic optimization approaches of batalgorithm and Novel batalgorithm. By utilizing objective functions (modularity and hamiltonian) with modified discrete version of bat and Novel batalgorithm we have devised four new variants for community detection. The results obtained across four variants are compared with traditional approaches like Girvan and Newman, fast greedy modularity optimization, Reichardt and Bornholdt, Ronhovde and Nussinov, and spectral clustering. After analyzing the results, we have dwelled upon a promising outcome supporting the modified variants.
This work presents an efficient hybrid algorithm (EHA) that consists of a search space reducer (SSR) and a modifiedbat-inspired algorithm (MBA) to solve the transmission network expansion planning (TNEP). The contrib...
详细信息
This work presents an efficient hybrid algorithm (EHA) that consists of a search space reducer (SSR) and a modifiedbat-inspired algorithm (MBA) to solve the transmission network expansion planning (TNEP). The contribution of the proposal is to consider, at the same time, the security constraints criterion N-1', load scenarios and network losses to give a more comprehensive approach in an efficient manner, which allows applying the EHA to large-scale real system. Discrete variables in the TNEP are handled by the MBA, and an optimal power flow is used to evaluate the fitness function as well as planning options. By using the SSR to define the initial candidate set for the MBA, the solution search space is reduced improving the computational performance of the proposed MBA. To validate the proposed method and show its efficiency in comparison with others in the literature, tests are conducted on Garver and IEEE 24-bus test system, in addition to an equivalent Brazilian system.
暂无评论