Solving Incremental Optimization Problems via Cooperative Coevolution

Engineering designs can involve multiple stages, where at each stage, the design models are incrementally modified and optimized. In contrast to traditional dynamic optimization problems where the changes are caused by some objective factors, the changes in such incremental optimization problems are usually caused by the modifications made by the decision makers during the design process. While existing work in the literature is mainly focused on traditional dynamic optimization, little research has been dedicated to solving such incremental optimization problems. In this work, we study how to adopt cooperative coevolution to efficiently solve a specific type of incremental optimization problems, namely, those with increasing decision variables. First, we present a benchmark function generator on the basis of some basic formulations of incremental optimization problems with increasing decision variables and exploitable modular structure. Then, we propose a contribution based cooperative coevolutionary framework coupled with an incremental grouping method for dealing with them. On one hand, the benchmark function generator is capable of generating various benchmark functions with various characteristics. On the other hand, the proposed framework is promising in solving such problems in terms of both optimization accuracy and computational efficiency. In addition, the proposed method is further assessed using a real-world application, i.e., the design optimization of a stepped cantilever beam

Lightning search algorithm: a comprehensive survey

The lightning search algorithm (LSA) is a novel meta-heuristic optimization method, which is proposed in 2015 to solve constraint optimization problems. This paper presents a comprehensive survey of the applications, variants, and results of the so-called LSA. In LSA, the best-obtained solution is defined to improve the effectiveness of the fitness function through the optimization process by finding the minimum or maximum costs to solve a specific problem. Meta-heuristics have grown the focus of researches in the optimization domain, because of the foundation of decision-making and assessment in addressing various optimization problems. A review of LSA variants is displayed in this paper, such as the basic, binary, modification, hybridization, improved, and others. Moreover, the classes of the LSA’s applications include the benchmark functions, machine learning applications, network applications, engineering applications, and others. Finally, the results of the LSA is compared with other optimization algorithms published in the literature. Presenting a survey and reviewing the LSA applications is the chief aim of this survey paper

Optimum design of reinforced concrete retaining walls with the flower pollination algorithm

The flower pollination algorithm (FPA) is anefficient metaheuristicoptimizationalgorithm mimickingthe pollinationprocessof flowering species. In this study, FPA is applied, for first time, to the optimum design of reinforced concrete (RC) cantilever retaining walls. It is foundthat FPA offers important savings with respect to conventional design approachesand that it outperformsgenetic algorithm (GA)andthe particle swarm optimization (PSO) algorithm in this designproblem.Furthermore, parameter tuning reveals that the best FPA performance is achieved for switch probability values ranging between 0.4 and 0.7, a population size of 20 individualsand aLévy flightstep sizescale factor of 0.5. Finally, parametric optimum designs show that theoptimumcost of RC retaining walls increases rapidly with the wallheight and smoothly with the magnitude of surcharge loadin

Do evolutionary algorithms indeed require random numbers? Extended study

An inherent part of evolutionary algorithms, that are based on Darwin theory of evolution and Mendel theory of genetic heritage, are random processes. In this participation, we discuss whether are random processes really needed in evolutionary algorithms. We use n periodic deterministic processes instead of random number generators and compare performance of evolutionary algorithms powered by those processes and by pseudo-random number generators. Deterministic processes used in this participation are based on deterministic chaos and are used to generate periodical series with different length. Results presented here are numerical demonstration rather than mathematical proofs. We propose that a certain class of deterministic processes can be used instead of random number generators without lowering of evolutionary algorithms performance. © Springer International Publishing Switzerland 2013

Driving Innovation through Big Open Linked Data (BOLD): Exploring Antecedents using Interpretive Structural Modelling

YesInnovation is vital to find new solutions to problems, increase quality, and improve profitability. Big open linked data (BOLD) is a fledgling and rapidly evolving field that creates new opportunities for innovation. However, none of the existing literature has yet considered the interrelationships between antecedents of innovation through BOLD. This research contributes to knowledge building through utilising interpretive structural modelling to organise nineteen factors linked to innovation using BOLD identified by experts in the field. The findings show that almost all the variables fall within the linkage cluster, thus having high driving and dependence powers, demonstrating the volatility of the process. It was also found that technical infrastructure, data quality, and external pressure form the fundamental foundations for innovation through BOLD. Deriving a framework to encourage and manage innovation through BOLD offers important theoretical and practical contributions

High Performance Multicell Series Inverter-Fed Induction Motor Drive

This document is the Accepted Manuscript version of the following article: M. Khodja, D. Rahiel, M. B. Benabdallah, H. Merabet Boulouiha, A. Allali, A. Chaker, and M. Denai, ‘High-performance multicell series inverter-fed induction motor drive’, Electrical Engineering, Vol. 99 (3): 1121-1137, September 2017. The final publication is available at Springer via DOI: https://doi.org/10.1007/s00202-016-0472-4.The multilevel voltage-source inverter (VSI) topology of the series multicell converter developed in recent years has led to improved converter performance in terms of power density and efficiency. This converter reduces the voltage constraints between all cells, which results in a lower transmission losses, high switching frequencies and the improvement of the output voltage waveforms. This paper proposes an improved topology of the series multicell inverter which minimizes harmonics, reduces torque ripples and losses in a variable-speed induction motor drive. The flying capacitor multilevel inverter topology based on the classical and modified phase shift pulse width modulation (PSPWM, MPSPWM) techniques are applied in this paper to minimize harmonic distortion at the inverter output. Simulation results are presented for a 2-kW induction motor drive and the results obtained demonstrate reduced harmonics, improved transient responses and reference tracking performance of the voltage in the induction motor and consequently reduced torque ripplesPeer reviewe

Theoretical and practical convergence of a self-adaptive penalty algorithm for constrained global optimization

This paper proposes a self-adaptive penalty function and presents a penalty-based algorithm for solving nonsmooth and nonconvex constrained optimization problems. We prove that the general constrained optimization problem is equivalent to a bound constrained problem in the sense that they have the same global solutions. The global minimizer of the penalty function subject to a set of bound constraints may be obtained by a population-based meta-heuristic. Further, a hybrid self-adaptive penalty firefly algorithm, with a local intensification search, is designed, and its convergence analysis is established. The numerical experiments and a comparison with other penalty-based approaches show the effectiveness of the new self-adaptive penalty algorithm in solving constrained global optimization problems.The authors would like to thank the referees, the Associate Editor and the Editor-in-Chief for their valuable comments and suggestions to improve the paper. This work has been supported by COMPETE: POCI-01-0145-FEDER-007043 and FCT - Funda¸c˜ao para a Ciˆencia e Tecnologia within the projects UID/CEC/00319/2013 and UID/MAT/00013/2013.info:eu-repo/semantics/publishedVersio