Maximum Power Point Tracking Algorithm for Advanced Photovoltaic Systems

Photovoltaic (PV) systems are the major nonconventional sources for power generation for present power strategy. The power of PV system has rapid increase because of its unpolluted, less noise and limited maintenance. But whole PV system has two main disadvantages drawbacks, that is, the power generation of it is quite low and the output power is nonlinear, which is influenced by climatic conditions, namely environmental temperature and the solar irradiation. The natural limiting factor is that PV potential in respect of temperature and irradiation has nonlinear output behavior. An automated power tracking method, for example, maximum power point tracking (MPPT), is necessarily applied to improve the power generation of PV systems. The MPPT methods undergo serious challenges when the PV system is under partial shade condition because PV shows several peaks in power. Hence, the exploration method might easily be misguided and might trapped to the local maxima. Therefore, a reasonable exploratory method must be constructed, which has to determine the global maxima for PV of shaded partially. The traditional approaches namely constant voltage tracking (CVT), perturb and observe (P&O), hill climbing (HC), Incremental Conductance (INC), and fractional open circuit voltage (FOCV) methods, indeed some of their improved types, are quite incompetent in tracking the global MPP (GMPP). Traditional techniques and soft computing-based bio-inspired and nature-inspired algorithms applied to MPPT were reviewed to explore the possibility for research while optimizing the PV system with global maximum output power under partially shading conditions. This paper is aimed to review, compare, and analyze almost all the techniques that implemented so far. Further this paper provides adequate details about algorithms that focuses to derive improved MPPT under non-uniform irradiation. Each algorithm got merits and demerits of its own with respect to the converging speed, computing time, complexity of coding, hardware suitability, stability and so on

Brain Tumor Segmentation Techniques: A Review

Image processing is used widely in solving a variety of problems. The important and complex phase of image processing is image segmentation. This paper provides a brief description on some of the segmentation algorithms specifically on brain tumor MR Images. Later in this paper, simple comparisons are made between the listed algorithms. This work helps in understanding some of the existing brain MR Image segmentation algorithms better

A Review on the Application of Natural Computing in Environmental Informatics

Natural computing offers new opportunities to understand, model and analyze the complexity of the physical and human-created environment. This paper examines the application of natural computing in environmental informatics, by investigating related work in this research field. Various nature-inspired techniques are presented, which have been employed to solve different relevant problems. Advantages and disadvantages of these techniques are discussed, together with analysis of how natural computing is generally used in environmental research.Comment: Proc. of EnviroInfo 201

Investigations of machining characteristics in upgraded MQL assisted turning of pure titanium alloy using evolutionary algorithms

Environmental protection is the major concern of any form of manufacturing industry today. As focus has shifted towards sustainable cooling strategies, minimum quantity lubrication (MQL) has proven its usefulness. The current survey intends to make the MQL strategy more effective while improving its performance. A Ranque–Hilsch vortex tube (RHVT) was implemented into the MQL process in order to enhance the performance of the manufacturing process. The RHVT is a device that allows for separating the hot and cold air within the compressed air flows that come tangentially into the vortex chamber through the inlet nozzles. Turning tests with a unique combination of cooling technique were performed on titanium (Grade 2), where the effectiveness of the RHVT was evaluated. The surface quality measurements, forces values, and tool wear were carefully investigated. A combination of analysis of variance (ANOVA) and evolutionary techniques (particle swarm optimization (PSO), bacteria foraging optimization (BFO), and teaching learning-based optimization (TLBO)) was brought into use in order to analyze the influence of the process parameters. In the end, an appropriate correlation between PSO, BFO, and TLBO was investigated. It was shown that RHVT improved the results by nearly 15% for all of the responses, while the TLBO technique was found to be the best optimization technique, with an average time of 1.09 s and a success rate of 90%

Bacterial Foraging Based Channel Equalizers

A channel equalizer is one of the most important subsystems in any digital communication receiver. It is also the subsystem that consumes maximum computation time in the receiver. Traditionally maximum-likelihood sequence estimation (MLSE) was the most popular form of equalizer. Owing to non-stationary characteristics of the communication channel MLSE receivers perform poorly. Under these circumstances ‘Maximum A-posteriori Probability (MAP)’ receivers also called Bayesian receivers perform better. Natural selection tends to eliminate animals with poor “foraging strategies” and favor the propagation of genes of those animals that have successful foraging strategies since they are more likely to enjoy reproductive success. After many generations, poor foraging strategies are either eliminated or shaped into good ones (redesigned). Logically, such evolutionary principles have led scientists in the field of “foraging theory” to hypothesize that it is appropriate to model the activity of foraging as an optimization process. This thesis presents an investigation on design of bacterial foraging based channel equalizer for digital communication. Extensive simulation studies shows that the performance of the proposed receiver is close to optimal receiver for variety of channel conditions. The proposed receiver also provides near optimal performance when channel suffers from nonlinearities

Introductory Review of Swarm Intelligence Techniques

With the rapid upliftment of technology, there has emerged a dire need to fine-tune or optimize certain processes, software, models or structures, with utmost accuracy and efficiency. Optimization algorithms are preferred over other methods of optimization through experimentation or simulation, for their generic problem-solving abilities and promising efficacy with the least human intervention. In recent times, the inducement of natural phenomena into algorithm design has immensely triggered the efficiency of optimization process for even complex multi-dimensional, non-continuous, non-differentiable and noisy problem search spaces. This chapter deals with the Swarm intelligence (SI) based algorithms or Swarm Optimization Algorithms, which are a subset of the greater Nature Inspired Optimization Algorithms (NIOAs). Swarm intelligence involves the collective study of individuals and their mutual interactions leading to intelligent behavior of the swarm. The chapter presents various population-based SI algorithms, their fundamental structures along with their mathematical models.Comment: Submitted to Springe

How Can Bee Colony Algorithm Serve Medicine?

Healthcare professionals usually should make complex decisions with far reaching consequences and associated risks in health care fields. As it was demonstrated in other industries, the ability to drill down into pertinent data to explore knowledge behind the data can greatly facilitate superior, informed decisions to ensue the facts. Nature has always inspired researchers to develop models of solving the problems. Bee colony algorithm (BCA), based on the self-organized behavior of social insects is one of the most popular member of the family of population oriented, nature inspired meta-heuristic swarm intelligence method which has been proved its superiority over some other nature inspired algorithms. The objective of this model was to identify valid novel, potentially useful, and understandable correlations and patterns in existing data. This review employs a thematic analysis of online series of academic papers to outline BCA in medical hive, reducing the response and computational time and optimizing the problems. To illustrate the benefits of this model, the cases of disease diagnose system are presented

A novel hybrid bacteria-chemotaxis spiral-dynamic algorithm with application to modelling of flexible systems

This paper presents a novel hybrid optimisation algorithm namely HBCSD, which synergises a bacterial foraging algorithm (BFA) and spiral dynamics algorithm (SDA). The main objective of this strategy is to develop an algorithm that is capable to reach a global optimum point at the end of the final solution with a faster convergence speed compared to its predecessor algorithms. The BFA is incorporated into the algorithm to act as a global search or exploration phase. The solutions from the exploration phase then feed into SDA, which acts as a local search or exploitation phase. The proposed algorithm is used in dynamic modelling of two types of flexible systems, namely a flexible robot manipulator and a twin rotor system. The results obtained show that the proposed algorithm outperforms its predecessor algorithms in terms of fitness accuracy, convergence speed, and time-domain and frequency-domain dynamic characterisation of the two flexible systems. © 2014 Elsevier Ltd

Reactive scheduling to treat disruptive events in the MRCPSP

Esta tesis se centra en diseñar y desarrollar una metodología para abordar el MRCPSP con diversas funciones objetivo y diferentes tipos de interrupciones. En esta tesis se exploran el MRCPSP con dos funciones objetivo, a saber: (1) minimizar la duración del proyecto y (2) maximizar el valor presente neto del proyecto. Luego, se tiene en cuenta dos tipos diferentes de interrupciones, (a) interrupción de duración, e (b) interrupción de recurso renovable. Para resolver el MRCPSP, en esta tesis se proponen tres estrategias metaheurísticas: (1) algoritmo memético para minimizar la duración del proyecto, (2) algoritmo adaptativo de forrajeo bacteriano para maximizar el valor presente neto del proyecto y (3) algoritmo de optimización multiobjetivo de forrajeo bacteriano (MBFO) para resolver el MRCPSP con eventos de interrupción. Para juzgar el rendimiento del algoritmo memético y de forrajeo bacteriano propuestos, se ha llevado a cabo un extenso análisis basado en diseño factorial y diseño Taguchi para controlar y optimizar los parámetros del algoritmo. Además se han puesto a prueba resolviendo las instancias de los conjuntos más importantes en la literatura: PSPLIB (10,12,14,16,18,20 y 30 actividades) y MMLIB (50 y 100 actividades). También se ha demostrado la superioridad de los algoritmos metaheurísticos propuestos sobre otros enfoques heurísticos y metaheurísticos del estado del arte. A partir de los estudios experimentales se ha ajustado la MBFO, utilizando un caso de estudio.DoctoradoDoctor en Ingeniería Industria