The term photonic crystals appears because of the analogy between electron waves in crystals and the light waves in artificial periodic dielectric structures. During the recent years the investigation of one-, two-and three-dimensional periodic structures has attracted a widespread attention of the world optics community because of great potentiality of such structures in advanced applied optical fields. The interest in periodic structures has been stimulated by the fast development of semiconductor technology that now allows the fabrication of artificial structures, whose period is comparable with the wavelength of light in the visible and infrared ranges.

http://ieeexplore.ieee.org/iel5/6354/16969/00781867.pdf

Photonic crystals

http://romisatriawahono.net/lecture/rm/survey/softcomputing/Boussaid%20-%20Optimization%20Metaheuristics%20-%202013.pdf

A survey on optimization metaheuristics

The issue of setting the values of various parameters of an evolutionary algorithm is crucial for good performance. In this paper we discuss how to do this, beginning with the issue of whether these values are best set in advance or are best changed during evolution. We provide a classification of different approaches based on a number of complementary features, and pay special attention to setting parameters on-the-fly. This has the potential of adjusting the algorithm to the problem while solving the problem. This paper is intended to present a survey rather than a set of prescriptive details for implementing an EA for a particular type of problem. For this reason we have chosen to interleave a number of examples throughout the text. Thus we hope to both clarify the points we wish to raise as we present them, and also to give the reader a feel for some of the many possibilities available for controlling different parameters. © Springer-Verlag Berlin Heidelberg 2007.

/pdf/parameter-control-in-evolutionary-algorithms-2gkl3svcj7.pdf

Parameter Control in Evolutionary Algorithms

The combination of evolutionary algorithms with local search was named "memetic algorithms" (MAs) (Moscato, 1989). These methods are inspired by models of natural systems that combine the evolutionary adaptation of a population with individual learning within the lifetimes of its members. Additionally, MAs are inspired by Richard Dawkin's concept of a meme, which represents a unit of cultural evolution that can exhibit local refinement (Dawkins, 1976). In the case of MA's, "memes" refer to the strategies (e.g., local refinement, perturbation, or constructive methods, etc.) that are employed to improve individuals. In this paper, we review some works on the application of MAs to well-known combinatorial optimization problems, and place them in a framework defined by a general syntactic model. This model provides us with a classification scheme based on a computable index D, which facilitates algorithmic comparisons and suggests areas for future research. Also, by having an abstract model for this class of metaheuristics, it is possible to explore their design space and better understand their behavior from a theoretical standpoint. We illustrate the theoretical and practical relevance of this model and taxonomy for MAs in the context of a discussion of important design issues that must be addressed to produce effective and efficient MAs.

/pdf/a-tutorial-for-competent-memetic-algorithms-model-taxonomy-458dccg2fv.pdf

A tutorial for competent memetic algorithms: model, taxonomy, and design issues

Electrical load forecasting plays a vital role in order to achieve the concept of next generation power system such as smart grid, efficient energy management and better power system planning. As a result, high forecast accuracy is required for multiple time horizons that are associated with regulation, dispatching, scheduling and unit commitment of power grid. Artificial Intelligence (AI) based techniques are being developed and deployed worldwide in on Varity of applications, because of its superior capability to handle the complex input and output relationship. This paper provides the comprehensive and systematic literature review of Artificial Intelligence based short term load forecasting techniques. The major objective of this study is to review, identify, evaluate and analyze the performance of Artificial Intelligence (AI) based load forecast models and research gaps. The accuracy of ANN based forecast model is found to be dependent on number of parameters such as forecast model architecture, input combination, activation functions and training algorithm of the network and other exogenous variables affecting on forecast model inputs. Published literature presented in this paper show the potential of AI techniques for effective load forecasting in order to achieve the concept of smart grid and buildings.

A review on artificial intelligence based load demand forecasting techniques for smart grid and buildings

Electric load forecasting methods: Tools for decision making

Summary. In this chapter, we will give an overview over self-adaptive methods in evolutionary algorithms. Self-adaptation in its purest meaning is a state-of-the-art method to adjust the setting of control parameters. It is called self-adaptive because the algorithm controls the setting of these parameters itself – embedding them into an individual’s genome and evolving them. We will start with a short history of adaptation methods. The section is followed by a presentation of classification schemes for adaptation rules. Afterwards, we will review empirical and theoretical research of self-adaptation methods applied in genetic algorithms, evolutionary programming, and evolution strategies.

Self-Adaptation in Evolutionary Algorithms

Target-environment networks provide a conceptual framework for the analysis and prediction of complex regulatory systems such as genetic networks, eco-finance networks or sensor-target assignments. These evolving networks consist of two major groups of entities that are interacting by unknown relationships. The structure and dynamics of the hidden regulatory system have to be revealed from uncertain measurement data. In this paper, the concept of fuzzy target-environment networks is introduced and various fuzzy possibilistic regression models are presented. The relation between the targets and/or environmental entities of the regulatory network is given in terms of a fuzzy model. The vagueness of the regulatory system results from the (unknown) fuzzy coefficients. For an identification of the fuzzy coefficients’ shape, methods from fuzzy regression are adapted and made applicable to the bi-level situation of target-environment networks and uncertain data. Various shapes of fuzzy coefficients are considered and the control of outliers is discussed. A first numerical example is presented for purposes of illustration. The paper ends with a conclusion and an outlook to future studies.

Fuzzy prediction strategies for gene-environment networks – Fuzzy regression analysis for two-modal regulatory systems

This paper investigates the self-adaptation behavior of ( $$1,\lambda $$ )-evolution strategies (ES) on the noisy sphere model. To this end, the stochastic system dynamics is approximated on the level of the mean value dynamics. Being based on this "microscopic" analysis, the steady state behavior of the ES for the scaled noise scenario and the constant noise strength scenario will be theoretically analyzed and compared with real ES runs. An explanation will be given for the random walk like behavior of the mutation strength in the vicinity of the steady state. It will be shown that this is a peculiarity of the $$(1,\lambda)$$ -ES and that intermediate recombination strategies do not suffer from such behavior.

/pdf/self-adaptation-of-evolution-strategies-under-noisy-fitness-57nvhb9f3r.pdf

Self-adaptation of evolution strategies under noisy fitness evaluations

This paper presents a novel search-path optimization method for moving target search by an aerial vehicle, applicable to realistically sized search areas. For such missions, long endurance vehicles are needed, which are usually fixed-winged. The proposed method accounts for flight kinematics of fixed-wing and rotary-wing aerial vehicles. It additionally accounts for movements of the target, considerably increasing complexity of search-path optimization, compared to a static target. The objective is to maximize the probability to detect a conditionally deterministic moving target within a given time period. We propose a first K-step-lookahead planning method that takes flight kinematic constraints into account and in which the target and platform state space are heterogeneous. It consists of a binary integer linear program that yields a physically feasible search-path, while maximizing the probability of detection. It is based on the Max-K-Coverage problem, as it selects K waypoints while maximizing the probability that a target is within the field of view of a platform at one of these waypoints. This K-step-lookahead planning method is embedded in an iterative framework, where the probability of overlooking a target is fed back to the controller after observations are made. Simulations show the applicability and effectiveness of this method.

Silja Meyer-Nieberg

Papers

Electric load forecasting methods: Tools for decision making

Self-Adaptation in Evolutionary Algorithms

Fuzzy prediction strategies for gene-environment networks – Fuzzy regression analysis for two-modal regulatory systems

Self-adaptation of evolution strategies under noisy fitness evaluations

Aerial Vehicle Search-Path Optimization: A Novel Method for Emergency Operations