Probability Distributions.- Linear Models for Regression.- Linear Models for Classification.- Neural Networks.- Kernel Methods.- Sparse Kernel Machines.- Graphical Models.- Mixture Models and EM.- Approximate Inference.- Sampling Methods.- Continuous Latent Variables.- Sequential Data.- Combining Models.

Pattern Recognition and Machine Learning

Data Mining - Concepts and Techniques.

An Introduction to MultiAgent Systems.

Differential Evolution (DE) is arguably one of the most powerful and versatile evolutionary optimizers for the continuous parameter spaces in recent times. Almost 5 years have passed since the first comprehensive survey article was published on DE by Das and Suganthan in 2011. Several developments have been reported on various aspects of the algorithm in these 5 years and the research on and with DE have now reached an impressive state. Considering the huge progress of research with DE and its applications in diverse domains of science and technology, we find that it is a high time to provide a critical review of the latest literatures published and also to point out some important future avenues of research. The purpose of this paper is to summarize and organize the information on these current developments on DE. Beginning with a comprehensive foundation of the basic DE family of algorithms, we proceed through the recent proposals on parameter adaptation of DE, DE-based single-objective global optimizers, DE adopted for various optimization scenarios including constrained, large-scale, multi-objective, multi-modal and dynamic optimization, hybridization of DE with other optimizers, and also the multi-faceted literature on applications of DE. The paper also presents a dozen of interesting open problems and future research issues on DE.

Recent advances in differential evolution – An updated survey

Multiagent Systems is the title of a collection of papers dedicated to surveying specific themes of Multiagent Systems (MAS) and Distributed Artificial Intelligence (DAI). All of them authored by leading researchers of this dynamic multidisciplinary field.

/pdf/multiagent-systems-a-modern-approach-to-distributed-5fon0donq1.pdf

Multiagent systems: a modern approach to distributed artificial intelligence

A distributed algorithm is presented to solve the economic power dispatch with transmission line losses and generator constraints. The proposed approach is based on two consensus algorithms running in parallel. The first algorithm is a first-order consensus protocol modified by a correction term which uses a local estimation of the system power mismatch to ensure the generation-demand equality. The second algorithm performs the estimation of the power mismatch in the system using a consensus strategy called consensus on the most up-to-date information. The proposed approach can handle networks of different size and topology using the information about the number of nodes which is also evaluated in a distributed fashion. Simulations performed on standard test cases demonstrate the effectiveness of the proposed approach for both small and large systems.

Distributed Consensus-Based Economic Dispatch With Transmission Losses

This paper proposes the compact differential evolution (cDE) algorithm. cDE, like other compact evolutionary algorithms, does not process a population of solutions but its statistic description which evolves similarly to all the evolutionary algorithms. In addition, cDE employs the mutation and crossover typical of differential evolution (DE) thus reproducing its search logic. Unlike other compact evolutionary algorithms, in cDE, the survivor selection scheme of DE can be straightforwardly encoded. One important feature of the proposed cDE algorithm is the capability of efficiently performing an optimization process despite a limited memory requirement. This fact makes the cDE algorithm suitable for hardware contexts characterized by small computational power such as micro-controllers and commercial robots. In addition, due to its nature cDE uses an implicit randomization of the offspring generation which corrects and improves the DE search logic. An extensive numerical setup has been implemented in order to prove the viability of cDE and test its performance with respect to other modern compact evolutionary algorithms and state-of-the-art population-based DE algorithms. Test results show that cDE outperforms on a regular basis its corresponding population-based DE variant. Experiments have been repeated for four different mutation schemes. In addition cDE outperforms other modern compact algorithms and displays a competitive performance with respect to state-of-the-art population-based algorithms employing a DE logic. Finally, the cDE is applied to a challenging experimental case study regarding the on-line training of a nonlinear neural-network-based controller for a precise positioning system subject to changes of payload. The main peculiarity of this control application is that the control software is not implemented into a computer connected to the control system but directly on the micro-controller. Both numerical results on the test functions and experimental results on the real-world problem are very promising and allow us to think that cDE and future developments can be an efficient option for optimization in hardware environments characterized by limited memory.

Compact Differential Evolution

Genetic algorithms for supply-chain scheduling: A case study in the distribution of ready-mixed concrete

This paper presents a distributed algorithm based on auction techniques and consensus protocols to solve the nonconvex economic dispatch problem. The optimization problem of the nonconvex economic dispatch includes several constraints such as valve-point loading effect, multiple fuel option, and prohibited operating zones. Each generating unit locally evaluates quantities used as bids in the auction mechanism. These units send their bids to their neighbors in a communication graph that supports the power system and which provides the required information flow. A consensus procedure is used to share the bids among the network agents and resolves the auction. As a result, the power distribution of generating units is updated and the generation cost is minimized. The effectiveness of this approach is demonstrated by simulations on standard test systems.

A Distributed Auction-Based Algorithm for the Nonconvex Economic Dispatch Problem

Recent research on compact genetic algorithms (cGAs) has proposed a number of evolutionary search methods with reduced memory requirements. In cGAs, the evolution of populations is emulated by processing a probability vector with specific update rules. This paper considers the implementation of cGAs in microcontroller-based control platforms. In particular, to overcome some problems related to the binary encoding schemes adopted in most cGAs, this paper also proposes a new variant based on a real-valued solution coding. The presented variant achieves final solutions of the same quality as those found by binary cGAs, with a significantly reduced computational cost. The potential of the proposed approach is assessed by means of an extensive comparative study, which includes numerical results on benchmark functions, simulated and experimental microcontroller design problems.

David Naso

Papers

Distributed Consensus-Based Economic Dispatch With Transmission Losses

Compact Differential Evolution

Genetic algorithms for supply-chain scheduling: A case study in the distribution of ready-mixed concrete

A Distributed Auction-Based Algorithm for the Nonconvex Economic Dispatch Problem

Real-Valued Compact Genetic Algorithms for Embedded Microcontroller Optimization