86,718 research outputs found
Nonlinear continuous global optimization by modified differential evolution
The task of global optimization is to find a point where the objective function obtains its most extreme value.
Differential evolution (DE) is a population-based heuristic approach that creates new candidate solutions by combining several
points of the same population. The algorithm has three parameters: amplification factor of the differential variation, crossover
control parameter and population size. It is reported that DE is sensitive to the choice of these parameters. To improve
the quality of the solution, in this paper, we propose a modified differential evolution introducing self-adaptive parameters,
modified mutation and the inversion operator. We test our method with a set of nonlinear continuous optimization problems
with simple bounds.Fundação para a Ciência e a Tecnologia (FCT
Modified differential evolution based on global competitive ranking for engineering design optimization problems
Engineering design optimization problems are formulated as large-scale mathematical programming problems with nonlinear objective function and constraints. Global optimization finds a solution while satisfying the constraints. Differential evolution is a population-based heuristic approach that is shown to be very efficient to solve global optimization problems with simple bounds. In this paper, we propose a modified differential evolution introducing self-adaptive control parameters, modified mutation, inversion operation and modified selection for obtaining global optimization. To handle constraints effectively, in modified selection we incorporate global competitive ranking which strikes the right balance between the objective function and the constraint violation. Sixteen well-known engineering design optimization problems are considered and the results compared with other solution methods. It is shown that our method is competitive when solving these problems.Fundação para a Ciência e a Tecnologia (FCT
Global competitive ranking for constraints handling with modified differential evolution
Constrained nonlinear programming problems involving a nonlinear objective function with inequality and/or equality constraints introduce the possibility of multiple local optima. The task of global optimization is to find a solution where the objective function obtains its most extreme value while satisfying the constraints. Depending on the nature of the involved functions many solution methods have been proposed. Most of the existing population-based stochastic methods try to make the solution feasible by using a penalty function method. However, to find the appropriate penalty parameter is not an easy task. Population-based differential evolution is shown to be very efficient to solve global optimization problems with simple bounds. To handle the constraints effectively, in this paper, we propose a modified constrained differential evolution that uses self-adaptive control parameters, a mixed modified mutation, the inversion operation, a modified selection and the elitism in order to progress efficiently towards a global solution. In the modified selection, we propose a fitness function based on the global competitive ranking technique for handling the constraints. We test 13 benchmark problems. We also compare the results with the results found in literature. It is shown that our method is rather effective when solving constrained problemsFundação para a Ciência e a Tecnologia (FCT
A self-adaptive artificial bee colony algorithm with local search for TSK-type neuro-fuzzy system training
© 2019 IEEE. In this paper, we introduce a self-adaptive artificial bee colony (ABC) algorithm for learning the parameters of a Takagi-Sugeno-Kang-type (TSK-type) neuro-fuzzy system (NFS). The proposed NFS learns fuzzy rules for the premise part of the fuzzy system using an adaptive clustering method according to the input-output data at hand for establishing the network structure. All the free parameters in the NFS, including the premise and the following TSK-type consequent parameters, are optimized by the modified ABC (MABC) algorithm. Experiments involve two parts, including numerical optimization problems and dynamic system identification problems. In the first part of investigations, the proposed MABC compares to the standard ABC on mathematical optimization problems. In the remaining experiments, the performance of the proposed method is verified with other metaheuristic methods, including differential evolution (DE), genetic algorithm (GA), particle swarm optimization (PSO) and standard ABC, to evaluate the effectiveness and feasibility of the system. The simulation results show that the proposed method provides better approximation results than those obtained by competitors methods
Freeze-drying modeling and monitoring using a new neuro-evolutive technique
This paper is focused on the design of a black-box model for the process of freeze-drying of pharmaceuticals. A new methodology based on a self-adaptive differential evolution scheme is combined with a back-propagation algorithm, as local search method, for the simultaneous structural and parametric optimization of the model represented by a neural network. Using the model of the freeze-drying process, both the temperature and the residual ice content in the product vs. time can be determine off-line, given the values of the operating conditions (the temperature of the heating shelf and the pressure in the drying chamber). This makes possible to understand if the maximum temperature allowed by the product is trespassed and when the sublimation drying is complete, thus providing a valuable tool for recipe design and optimization. Besides, the black box model can be applied to monitor the freeze-drying process: in this case, the measurement of product temperature is used as input variable of the neural network in order to provide in-line estimation of the state of the product (temperature and residual amount of ice). Various examples are presented and discussed, thus pointing out the strength of the too
Recommended from our members
Shuffled Complex-Self Adaptive Hybrid EvoLution (SC-SAHEL) optimization framework
Simplicity and flexibility of meta-heuristic optimization algorithms have attracted lots of attention in the field of optimization. Different optimization methods, however, hold algorithm-specific strengths and limitations, and selecting the best-performing algorithm for a specific problem is a tedious task. We introduce a new hybrid optimization framework, entitled Shuffled Complex-Self Adaptive Hybrid EvoLution (SC-SAHEL), which combines the strengths of different evolutionary algorithms (EAs) in a parallel computing scheme. SC-SAHEL explores performance of different EAs, such as the capability to escape local attractions, speed, convergence, etc., during population evolution as each individual EA suits differently to various response surfaces. The SC-SAHEL algorithm is benchmarked over 29 conceptual test functions, and a real-world hydropower reservoir model case study. Results show that the hybrid SC-SAHEL algorithm is rigorous and effective in finding global optimum for a majority of test cases, and that it is computationally efficient in comparison to algorithms with individual EA
- …