SQG-Differential Evolution for difficult optimization problems under a tight function evaluation budget

In the context of industrial engineering, it is important to integrate efficient computational optimization methods in the product development process. Some of the most challenging simulation-based engineering design optimization problems are characterized by: a large number of design variables, the absence of analytical gradients, highly non-linear objectives and a limited function evaluation budget. Although a huge variety of different optimization algorithms is available, the development and selection of efficient algorithms for problems with these industrial relevant characteristics, remains a challenge. In this communication, a hybrid variant of Differential Evolution (DE) is introduced which combines aspects of Stochastic Quasi-Gradient (SQG) methods within the framework of DE, in order to improve optimization efficiency on problems with the previously mentioned characteristics. The performance of the resulting derivative-free algorithm is compared with other state-of-the-art DE variants on 25 commonly used benchmark functions, under tight function evaluation budget constraints of 1000 evaluations. The experimental results indicate that the new algorithm performs excellent on the 'difficult' (high dimensional, multi-modal, inseparable) test functions. The operations used in the proposed mutation scheme, are computationally inexpensive, and can be easily implemented in existing differential evolution variants or other population-based optimization algorithms by a few lines of program code as an non-invasive optional setting. Besides the applicability of the presented algorithm by itself, the described concepts can serve as a useful and interesting addition to the algorithmic operators in the frameworks of heuristics and evolutionary optimization and computing

A New Hybrid-Adaptive Differential Evolution for a Smart Grid Application Under Uncertainty

Power systems are showing a dynamic evolution in the last few years, caused in part by the adoption of smart grid technologies. The integration of new elements that represent a source of uncertainty, such as renewables generation, electric vehicles, variable loads and electricity markets, poses a higher degree of complexity causing that traditional mathematical formulations struggle in finding efficient solutions to problems in the smart grid context. In some situations, where traditional approaches fail, computational intelligence has demonstrated being a very powerful tool for solving optimization problems. In this paper, we analyze the application of Differential Evolution (DE) to address an energy resource management problem under uncertain environments. We perform a systematic parameter tuning to determine the best set of parameters of four state-of-the-art DE strategies. Having knowledge of the sensitivity of DE to the parameter selection, self-adaptive parameter control DE algorithms are also implemented, showing that competitive results can be achieved without the application of parameter tuning methodologies. Finally, a new hybrid-adaptive DE algorithm, HyDE, which uses a new “DE/target - to - perturbed_best/1” strategy and an adaptive control parameter mechanism, is proposed to solve the problem. Results show that DE strategies with fixed parameters, despite very sensitive to the setting, can find better solutions than some adaptive DE versions. Overall, our HyDE algorithm excelled all the other tested algorithms, proving its effectiveness solving a smart grid application under uncertainty.his work has received funding from the European Union's Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No. 641794 (project DREAM-GO) and from FEDER Funds through COMPETE program and from National Funds through FCT under the project UID/EEA/00760/2013info:eu-repo/semantics/publishedVersio

Limited Evaluation Cooperative Co-evolutionary Differential Evolution for Large-scale Neuroevolution

Many real-world control and classification tasks involve a large number of features. When artificial neural networks (ANNs) are used for modeling these tasks, the network architectures tend to be large. Neuroevolution is an effective approach for optimizing ANNs; however, there are two bottlenecks that make their application challenging in case of high-dimensional networks using direct encoding. First, classic evolutionary algorithms tend not to scale well for searching large parameter spaces; second, the network evaluation over a large number of training instances is in general time-consuming. In this work, we propose an approach called the Limited Evaluation Cooperative Co-evolutionary Differential Evolution algorithm (LECCDE) to optimize high-dimensional ANNs. The proposed method aims to optimize the pre-synaptic weights of each post-synaptic neuron in different subpopulations using a Cooperative Co-evolutionary Differential Evolution algorithm, and employs a limited evaluation scheme where fitness evaluation is performed on a relatively small number of training instances based on fitness inheritance. We test LECCDE on three datasets with various sizes, and our results show that cooperative co-evolution significantly improves the test error comparing to standard Differential Evolution, while the limited evaluation scheme facilitates a significant reduction in computing time

An Optimisation-Driven Prediction Method for Automated Diagnosis and Prognosis

open access articleThis article presents a novel hybrid classification paradigm for medical diagnoses and prognoses prediction. The core mechanism of the proposed method relies on a centroid classification algorithm whose logic is exploited to formulate the classification task as a real-valued optimisation problem. A novel metaheuristic combining the algorithmic structure of Swarm Intelligence optimisers with the probabilistic search models of Estimation of Distribution Algorithms is designed to optimise such a problem, thus leading to high-accuracy predictions. This method is tested over 11 medical datasets and compared against 14 cherry-picked classification algorithms. Results show that the proposed approach is competitive and superior to the state-of-the-art on several occasions