In the present study, a design of biologically inspired computing framework is presented for solving second-order two-point boundary value problems (BVPs) by differential evolution (DE) algorithm employing finite diff...
详细信息
In the present study, a design of biologically inspired computing framework is presented for solving second-order two-point boundary value problems (BVPs) by differential evolution (DE) algorithm employing finite difference-based cost function. The DE has been implemented to minimize the combined residue from all nodes in a least square sense. The proposed methodology has been evaluated using five numerical examples in linear and nonlinear regime of BVPs in order to demonstrate the process and check the efficacy of the implementation. The assessment and validation of the DE algorithm have been carried out by comparing the DE-computed results with exact solution as well as with the corresponding data obtained using continuous genetic algorithms. These benchmark comparisons clearly establish DE as a competitive solver in this domain in terms of computational competence and precision.
Context: To find the best sequence of refactorings to be applied in a software artifact is an optimization problem that can be solved using search techniques, in the field called Search-Based Refactoring (SBR). Over t...
详细信息
Context: To find the best sequence of refactorings to be applied in a software artifact is an optimization problem that can be solved using search techniques, in the field called Search-Based Refactoring (SBR). Over the last years, the field has gained importance, and many SBR approaches have appeared, arousing research interest. Objective: The objective of this paper is to provide an overview of existing SBR approaches, by presenting their common characteristics, and to identify trends and research opportunities. Method: A systematic review was conducted following a plan that includes the definition of research questions, selection criteria, a search string, and selection of search engines. 71 primary studies were selected, published in the last sixteen years. They were classified considering dimensions related to the main SBR elements, such as addressed artifacts, encoding, search technique, used metrics, available tools, and conducted evaluation. Results: Some results show that code is the most addressed artifact, and evolutionary algorithms are the most employed search technique. Furthermore, most times, the generated solution is a sequence of refactorings. In this respect, the refactorings considered are usually the ones of the Fowler's Catalog. Some trends and opportunities for future research include the use of models as artifacts, the use of many objectives, the study of the bad smells effect, and the use of hyper-heuristics. Conclusions: We have found many SBR approaches, most of them published recently. The approaches are presented, analyzed, and grouped following a classification scheme. The paper contributes to the SBR field as we identify a range of possibilities that serve as a basis to motivate future researches. (C) 2016 Elsevier B.V. All rights reserved.
In recent years sampling approaches have been used more widely than optimization algorithms to find parameters of conceptual rainfall-runoff models, but the difficulty of calibration of such models remains in dispute....
详细信息
In recent years sampling approaches have been used more widely than optimization algorithms to find parameters of conceptual rainfall-runoff models, but the difficulty of calibration of such models remains in dispute. The problem of finding a set of optimal parameters for conceptual rainfall-runoff models is interpreted differently in various studies, ranging from simple to relatively complex and difficult. In many papers, it is claimed that novel calibration approaches, so-called metaheuristics, outperform the older ones when applied to this task, but contradictory opinions are also plentiful. The present study aims at calibration of two simple lumped conceptual hydrological models, HBV and GR4J, by means of a large number of metaheuristic algorithms. The tests are performed on four catchments located in regions with relatively similar climatic conditions, but on different continents. The comparison shows that, although parameters found may somehow differ, the performance criteria achieved with simple lumped models calibrated by various metaheuristics are very similar and differences are insignificant from the hydrological point of view. However, occasionally some algorithms find slightly better solutions than those found by the vast majority of methods. This means that the problem of calibration of simple lumped HBV or GR4J models may be deceptive from the optimization perspective, as the vast majority of algorithms that follow a common evolutionary principle of survival of the fittest lead to sub-optimal solutions.
This paper presents a new method for the design, modelling and optimization of a uniform serpentine meander based MEMS shunt capacitive switch with perforation on upper beam. The new approach is proposed to improve th...
详细信息
This paper presents a new method for the design, modelling and optimization of a uniform serpentine meander based MEMS shunt capacitive switch with perforation on upper beam. The new approach is proposed to improve the Pull-in Voltage performance in a MEMS switch. First a new analytical model of the Pull-in Voltage is proposed using the modified Mejis-Fokkema capacitance model taking care of the nonlinear electrostatic force, the fringing field effect due to beam thickness and etched holes on the beam simultaneously followed by the validation of same with the simulated results of benchmark full 3D FEM solver CoventorWare in a wide range of structural parameter variations. It shows a good agreement with the simulated results. Secondly, an optimization method is presented to determine the optimum configuration of switch for achieving minimum Pull-in voltage considering the proposed analytical mode as objective function. Some high performance evolutionary Optimization algorithms have been utilized to obtain the optimum dimensions with less computational cost and complexity. Upon comparing the applied algorithms between each other, the Dragonfly Algorithm is found to be most suitable in terms of minimum Pull-in voltage and higher convergence speed. Optimized values are validated against the simulated results of CoventorWare which shows a very satisfactory results with a small deviation of 0.223 V. In addition to these, the paper proposes, for the first time, a novel algorithmic approach for uniform arrangement of square holes in a given beam area of RF MEMS switch for perforation. The algorithm dynamically accommodates all the square holes within a given beam area such that the maximum space is utilized. This automated arrangement of perforation holes will further improve the computational complexity and design accuracy of the complex design of perforated MEMS switch. (C) 2017 Elsevier Ltd. All rights reserved.
In this paper, a modified teaching-learning based optimization (TLBO) algorithm is introduced in order to solve the optimal power flow (OPF) considering the high voltage direct current (HVDC) link in power systems. In...
详细信息
In this paper, a modified teaching-learning based optimization (TLBO) algorithm is introduced in order to solve the optimal power flow (OPF) considering the high voltage direct current (HVDC) link in power systems. In TLBO, there is an improper diversity among search learners;therefore, its convergence speed is lower in comparison with some other evolutionary algorithms. Hence, in order to improve the quality of the solutions and speed up the velocity convergence, the teacher phase is modified. Moreover, to balance the global and local search capability of TLBO, one of the most common mutation operations of the differential evolution algorithm is incorporated into learner phases. With these modifications, the trapping to the local minima of traditional TLBO is vastly improved and the trade-off between the global searching ability and the convergence rate is retained. In order to demonstrate the efficiency of the proposed optimization method, it is applied to the OPF problem of two different two-terminal HVDC systems, including the modified 5-bus system and the modified WSCC 9-bus system. The behavior of some optimization methods such as the Genetic Algorithm, Backtracking Search Algorithm, and Artificial Bee Colony algorithm as well as the CPU running time for the objective function is presented. Comparison results indicate that the proposed optimization method is reliable with higher quality solutions among other applied evolutionary algorithms. Published by AIP Publishing.
The optimal allocation of multiple land uses constitutes a complex multi-objective optimization problem with unknown feasible objective space and optimal planning alternatives. Despite the effectiveness of evolutionar...
详细信息
The optimal allocation of multiple land uses constitutes a complex multi-objective optimization problem with unknown feasible objective space and optimal planning alternatives. Despite the effectiveness of evolutionary algorithms to capture the underlying Pareto set of optimum maps, land use planners are bound to pursue the best possible spatial allocation of each use within an enormous population of non-dominated solutions. This article presents a novel post-processing methodology enhancing the comparative evaluation of alternative planning approaches without making any assumptions about the (relative) importance of each objective function. The proposed consolidated post-processing module is applied in a land use planning paradigm, revealing: (a) the existence of substantial planning guidelines whose validity is not affected by the relative significance of each criterion and (b) the variable planning component emerging from the (varying) relative importance of objective functions. Such planning feedback could not be extracted by the exhaustive review of non-dominated maps.
Segmentation is considered the central part of an image processing system due to its high influence on the posterior image analysis. In recent years, the segmentation of magnetic resonance (MR) images has attracted th...
详细信息
Segmentation is considered the central part of an image processing system due to its high influence on the posterior image analysis. In recent years, the segmentation of magnetic resonance (MR) images has attracted the attention of the scientific community with the objective of assisting the diagnosis in different brain diseases. From several techniques, thresholding represents one of the most popular methods for image segmentation. Currently, an extensive amount of contributions has been proposed in the literature, where thresholding values are obtained by optimizing relevant criteria such as the cross entropy. However, most of such approaches are computationally expensive, since they conduct an exhaustive search strategy for obtaining the optimal thresholding values. This paper presents a general method for image segmentation. To estimate the thresholding values, the proposed approach uses the recently published evolutionary method called the Crow Search Algorithm (CSA) which is based on the behavior in flocks of crows. Different to other optimization techniques used for segmentation proposes, CSA presents a better performance, avoiding critical flaws such as the premature convergence to sub-optimal solutions and the limited exploration-exploitation balance in the search strategy. Although the proposed method can be used as a generic segmentation algorithm, its characteristics allow obtaining excellent results in the automatic segmentation of complex MR images. Under such circumstances, our approach has been evaluated using two sets of benchmark images;the first set is composed of general images commonly used in the image processing literature, while the second set corresponds to MR brain images. Experimental results, statistically validated, demonstrate that the proposed technique obtains better results in terms of quality and consistency. (c) 2017 Elsevier Ltd. All rights reserved.
Fossil fuels serve a substantial fraction of global energy demand, and one major energy consumer is the global building stock. In this work, we propose a framework to guide practitioners intending to develop advanced ...
详细信息
Fossil fuels serve a substantial fraction of global energy demand, and one major energy consumer is the global building stock. In this work, we propose a framework to guide practitioners intending to develop advanced predictive building control strategies. The framework provides the means to enhance legacy and modernized buildings regarding energy efficiency by integrating their available instrumentation into a data-driven predictive cyber-physical system. For this, the framework fuses two highly relevant approaches and embeds these into the building context: the generic model-based design methodology for cyber-physical systems and the cross-industry standard process for data mining. A Spanish school's heating system serves to validate the approach. Two different data-driven approaches to prediction and optimization are used to demonstrate the methodological flexibility: (i) a combination of Bayesian regularized neural networks with genetic algorithm based optimization, and (ii) a reinforcement learning based control logic using fitted Q-iteration are both successfully applied. Experiments lasting a total of 43 school days in winter 2015/2016 achieved positive effects on weather-normalized energy consumption and thermal comfort in day-to-day operation. A first experiment targeting comfort levels comparable to the reference period lowered consumption by one-third. Two additional experiments raised average indoor temperatures by 2 K. The better of these two experiments only consumed 5% more energy than the reference period. The prolonged experimentation period demonstrates the cyber-physical system based approach's suitability for improving building stock energy efficiency by developing and deploying predictive control strategies within routine operation of typical legacy buildings. (C) 2017 Elsevier B.V. All rights reserved.
evolutionary multi-objective optimization algorithms aim at finding an approximation of the Pareto set. For hard to solve problems with many conflicting objectives, the number of functions evaluations to represent the...
详细信息
evolutionary multi-objective optimization algorithms aim at finding an approximation of the Pareto set. For hard to solve problems with many conflicting objectives, the number of functions evaluations to represent the Pareto front can be large and time consuming. Parallel computing can reduce the wall-clock time of such algorithms. Previous studies tackled the parallelization of a particular evolutionary algorithm. In this research, we focus on improving one of the most time consuming procedures-the non-dominated sorting-, which is used in the state-of-the-art multi-objective genetic algorithms. Here, three parallel versions of the non-dominated sorting procedure are developed: (1) a multicore (based on Pthreads);(2) a Graphic Processing Unit (GPU) (based on CUDA interface);and (3) a hybrid (based on Pthreads and CUDA). The user can select the most suitable option to efficiently compute the non-dominated sorting procedure depending on the available hardware. Results show that the use of GPU computing provides a substantial improvement in terms of performance. The hybrid approach has the best performance when a good load balance is established among cores and GPU.
We consider a multicriterial optimization problem for volumes of buffers in a production line. We assume that the line has a series-parallel structure, and during its operation equipment stops occur due to failures, s...
详细信息
We consider a multicriterial optimization problem for volumes of buffers in a production line. We assume that the line has a series-parallel structure, and during its operation equipment stops occur due to failures, stops that are random in the moments when they arise and in their durations. The volumes of buffers are integer-valued and bounded from above. As criteria we consider the average production rate of the line, capital costs for installing buffers, and the inventory cost for intermediate products. To approximate the Pareto optimal set we use evolutionary algorithms SIBEA and SEMO. Problems with larger dimension experimentally support the advantage of the modified SEMO algorithm with respect to the hypervolume of the resulting set of points.
暂无评论