Search

Abstract In many engineering optimization problems, the number of function evaluations is severely limited by the time or cost constraints. These limitations present a significant challenge in the field of global optimization, because existing metaheuristic methods typically require a substantial number of function evaluations to find optimal solutions. This paper presents a new metaheuristic optimization algorithm that considers the information obtained by a radial basis function neural network (RBFNN) in terms of the objective function for guiding the search process. Initially, the algorithm uses the maximum design approach to strategically distribute a set of solutions across the entire search space. It then enters a cycle in which the RBFNN models the objective function values from the current solutions. The algorithm identifies and uses key neurons in the hidden layer that correspond to the highest objective function values to generate new solutions. The centroids and standard deviations of these neurons guide the sampling process, which continues until the desired number of solutions is reached. By focusing on the areas of the search space that yield high objective function values, the algorithm avoids exhaustive solution evaluations and significantly reduces the number of function evaluations. The effectiveness of the method is demonstrated through a comparison with popular metaheuristic algorithms across several test functions, where it consistently outperforms existing techniques, delivers higher-quality solutions, and improves convergence rates.

Graph-based methods, distinguished by their resilience to noise, have demonstrated efficacy in image segmentation compared to alternative techniques. Despite their notable capabilities, these methods present over- and under segmentation problems. This paper introduces a novel graph-based approach specially designed to solve these issues effectively. Unlike conventional graph-based methodologies, which predominantly favor either local or global features, our approach considers a combination of these two. Initially, the complete graph is partitioned into multiple subgraphs considering the similarities of the local features in the nodes. Subsequently, these subgraphs are evaluated and classified as either significant or irrelevant, based on the number of nodes they contain. To mitigate over segmentation, we merged the irrelevant subgraphs with the significant subgraphs considering their global features. These mechanisms allow our method to maintain integration between the local and global features, leading to a more precise and accurate representation of the objects in the image. The proposed method was evaluated using various complex images and was benchmarked against state-of-the-art segmentation techniques. The results confirm the superiority of our approach in delivering higher-quality and more dependable segmented images than existing methods.

Image contrast enhancement is an essential process that improves the visibility of many features that may remain hidden due to low-contrast conditions arising from environmental causes, limitations of the device, or the wrong setting of the camera. This paper introduces a new technique of image contrast enhancement that combines insights from social sciences and image processing. In this model, the intensity of each pixel represents the opinion of an individual, and all the neighboring pixels interact by influencing each other. The algorithm operates to first increase the similarity of those pixels in the regions where pixels maintain similar intensities and, second, to amplify the differences in regions where differences exist. This process increases the contrast in regions with significant differences and reduces variation in uniform regions, hence enhancing clarity in the visual information and details of the image. The effectiveness and high performance of the proposed method are evaluated by a variety of experiments conducted on different image datasets using different quality indexes. The results obtained after experimentation highlight the superiority of the approach with respect to the state-of-the-art techniques of contrast enhancement.

Diversity is crucial for metaheuristic algorithms. It prevents early convergence, balances exploration and exploitation, and helps to avoid local optima. Traditional metaheuristic algorithms tend to rely on a single strategy for generating new solutions, often resulting in a lack of diversity. In contrast, employing multiple strategies encourages a variety of search behaviors and a diverse pool of potential solutions, thereby improving the exploration of the search space. Evolutionary Game Theory (EGT) modifies agents’ strategies through competition, promoting successful strategies and eliminating weaker ones. Structured populations, as opposed to unstructured ones, preserve diverse strategies through localized competition, meaning that an individual’s strategy is influenced by only a subset or group of the population and not all elements. This paper presents a novel metaheuristic method based on EGT applied to structured populations. Initially, individuals are positioned near optimal regions using the Metropolis–Hastings algorithm. Subsequently, each individual is endowed with a unique search strategy. Considering a certain number of clusters, the complete population is segmented. Within these clusters, the method enhances search efficiency and solution quality by adapting all strategies through an intra-cluster competition. To assess the effectiveness of the proposed method, it has been compared against several well-known metaheuristic algorithms across a suite of 30 test functions. The results indicated that the new methodology outperformed the established techniques, delivering higher-quality solutions and faster convergence rates.

Image segmentation is a computer vision technique that involves dividing an image into distinct and meaningful regions or segments. The objective was to partition the image into areas that share similar visual characteristics. Noise and undesirable artifacts introduce inconsistencies and irregularities in image data. These inconsistencies severely affect the ability of most segmentation algorithms to distinguish between true image features, leading to less reliable and lower-quality results. Cellular Automata (CA) is a computational concept that consists of a grid of cells, each of which can be in a finite number of states. These cells evolve over discrete time steps based on a set of predefined rules that dictate how a cell's state changes according to its own state and the states of its neighboring cells. In this paper, a new segmentation approach based on the CA model was introduced. The proposed approach consisted of three phases. In the initial two phases of the process, the primary objective was to eliminate noise and undesirable artifacts that can interfere with the identification of regions exhibiting similar visual characteristics. To achieve this, a set of rules is designed to modify the state value of each cell or pixel based on the states of its neighboring elements. In the third phase, each element is assigned a state that is chosen from a set of predefined states. These states directly represent the final segmentation values for the corresponding elements. The proposed method was evaluated using different images, considering important quality indices. The experimental results indicated that the proposed approach produces better-segmented images in terms of quality and robustness.

The challenges associated with conventional methods of COVID-19 detection have prompted the exploration of alternative approaches, including the analysis of lung X-ray images. This paper introduces a novel algorithm designed to identify abnormalities in X-ray images indicative of COVID-19 by combining the maximally stable extremal regions (MSER) method with metaheuristic algorithms. The MSER method is efficient and effective under various adverse conditions, utilizing symmetry as a key property to detect regions despite changes in scaling or lighting. However, calibrating the MSER method is challenging. Our approach transforms this calibration into an optimization task, employing metaheuristic algorithms such as Particle Swarm Optimization (PSO), Grey Wolf Optimizer (GWO), Firefly (FF), and Genetic Algorithms (GA) to find the optimal parameters for MSER. By automating the calibration process through metaheuristic optimization, we overcome the primary disadvantage of the MSER method. This innovative combination enables precise detection of abnormal regions characteristic of COVID-19 without the need for extensive datasets of labeled training images, unlike deep learning methods. Our methodology was rigorously tested across multiple databases, and the detection quality was evaluated using various indices. The experimental results demonstrate the robust capability of our algorithm to support healthcare professionals in accurately detecting COVID-19, highlighting its significant potential and effectiveness as a practical and efficient alternative for medical diagnostics and precise image analysis.

Deepfake is a type of face manipulation technique using deep learning that allows for the replacement of faces in videos in a very realistic way. While this technology has many practical uses, if used maliciously, it can have a significant number of bad impacts on society, such as spreading fake news or cyberbullying. Therefore, the ability to detect deepfake has become a pressing need. This paper aims to address the problem of deepfake detection by identifying deepfake forgeries in video sequences. In this paper, a solution to the said problem is presented, which at first uses a stacking based ensemble approach, where features obtained from two popular deep learning models, namely Xception and EfficientNet-B7, are combined. Then by selecting a near-optimal subset of features using a ranking based approach, the final classification is performed to classify real and fake videos using a meta-learner, called multi-layer perceptron. In our experimentation, we have achieved an accuracy of 96.33% on Celeb-DF (V2) dataset and 98.00% on the FaceForensics++ dataset using the meta-learning model both of which are higher than the individual base models. Various types of experiments have been conducted to validate the robustness of the current method.

Breast cancer remains a critical global concern, underscoring the urgent need for early detection and accurate diagnosis to improve survival rates among women. Recent developments in deep learning have shown promising potential for computer-aided detection (CAD) systems to address this challenge. In this study, a novel segmentation method based on deep learning is designed to detect tumors in breast ultrasound images. Our proposed approach combines two powerful attention mechanisms: the novel Positional Convolutional Block Attention Module (PCBAM) and Shifted Window Attention (SWA), integrated into a Residual U-Net model. The PCBAM enhances the Convolutional Block Attention Module (CBAM) by incorporating the Positional Attention Module (PAM), thereby improving the contextual information captured by CBAM and enhancing the model's ability to capture spatial relationships within local features. Additionally, we employ SWA within the bottleneck layer of the Residual U-Net to further enhance the model's performance. To evaluate our approach, we perform experiments using two widely used datasets of breast ultrasound images and the obtained results demonstrate its capability in accurately detecting tumors. Our approach achieves state-of-the-art performance with dice score of 74.23% and 78.58% on BUSI and UDIAT datasets, respectively in segmenting the breast tumor region, showcasing its potential to help with precise tumor detection. By leveraging the power of deep learning and integrating innovative attention mechanisms, our study contributes to the ongoing efforts to improve breast cancer detection and ultimately enhance women's survival rates. The source code of our work can be found here: https://github.com/AyushRoy2001/DAUNet.

A metaheuristic method is an optimization technique that is generally inspired by natural or physical processes. The use of metaphors has created a tendency to reproduce existing algorithms with slight modifications or variations rather than encouraging the development of novel algorithmic techniques and principles. On the other hand, a complex network is a mathematical structure whose main characteristic is the ability to capture and analyze the intricate patterns and properties that emerge from the interactions between the elements that it connects. In this paper, a new metaphor-free metaheuristic algorithm based on complex networks and Bezier curves is presented. In this approach, candidate solutions are represented as nodes in a graph, whereas the connections between nodes or edges reflect the differences in their objective function values. Therefore, the graph provides a higher-level representation that captures the essential relationships and dependencies among the solutions. Once the graph is generated, the shortest path between each solution and the best solution is obtained. Then, the nodes obtained from this process are used as control points in the Bezier equation to generate the new agent position. Therefore, during the optimization process, the graph is continuously modified based on the evaluation of new candidate solutions and their objective function values, producing trajectories that allow the exploration and exploitation of the search space. The experimental results demonstrated the effectiveness of our approach by achieving competitive results compared to other well-known metaheuristic algorithms on various benchmark functions.

Homomorphic filtering (HF) is a methodology that separates an image into two components: illumination and reflectance. Through the processing of these components, it is possible to significantly improve the contrast of the low-frequency components while preserving the edges and sharp features of the image. The parameter values of the filter that produces the best possible contrast enhancement depends on the image conditions for each image. However, finding the optimal parameters for the filter can be challenging, often involves a trial-and-error process, and can be prone to errors due to human factors. In this paper, we consider the problem of identifying the filter parameters as an optimization problem. Under such conditions, the cluster chaotic optimization (CCO) method is used to efficiently explore the parameter space by evaluating an objective function that assesses the contrast quality of an enhanced image. The experimental results show that the proposed method produces competitive results in terms of quality, stability, and accuracy compared with other methods on various datasets. Different metrics were evaluated to demonstrate the quality of the results of our method compared with the other algorithms.

In recent years, statistical methods have been applied to the study of crime patterns. However, these schemes have several drawbacks that prevent accurate modeling of complex behaviors. Agent-based models (ABM) allow the modeling of human behavior by employing simple rules that consider each agent’s neighborhood. In this paper, a new agent-based model is proposed to emulate crime patterns produced by the interaction of different urban actors, such as offenders (criminals), citizens, and defenders (police officers). Using this approach, the simulation results provide escape trajectories and robbery frequencies that can be used to create or improve public security strategies. Although our scheme can be generically applied, we validated the model by considering different scenarios for the case of Guadalajara, Mexico. Experimental results show that the proposed scheme creates realistic offender behaviors that efficiently predict criminal patterns and provides essential data that allow the creation and improvement of public security strategies to reduce the number of crimes.

Image segmentation is the process of partitioning an image into multiple regions or objects, each representing a coherent and meaningful part of the image. Segmentation methods are highly sensitive to the lack of homogeneity in regions or objects owing to noise and intensity inconsistencies. Under such conditions, most approaches exhibit poor quality performance. This paper proposes an agent-based model approach for homogenization of images to reduce the presence of noisy pixels and undesirable artifacts. In our approach, each pixel in the image represents an agent, and a set of rules evaluates the states of neighboring agents to modify the intensity values of each pixel iteratively until different regions from the image assume homogeneous grayscale levels. The proposed method has been used in combination with the Otsu’s method to evaluate its performance in image segmentation. The approach was evaluated with different types of images considering their homogeneity. Experimental results indicated that the proposed approach produces better-segmented images in terms of quality and robustness.

Automatic circle detection is one of the most important construction elements to design more complex industrial image tasks such as target detection, manufacture inspection and process control. Most of the literature concerning multi-circle detection can be categorized under deterministic or stochastic perspectives. Deterministic approaches combine geometric and histogram information to identify circle shapes. However, deterministic techniques are unable to detect circles in presence of noise, shape variance, or occlusion. On the other hand, stochastic methodologies such as metaheuristic algorithms have been also proposed as alternatives to deterministic approaches for circle detection. Although these techniques are in general more robust, they allow detecting only one circle per execution, translating the detection problem into a unimodal optimization problem. Under such conditions, it is necessary to execute multiple times the algorithm to identify all the circles contained in the image. In this paper, the multi-circle detection problem has been reformulated as a multimodal optimization problem. The proposed approach adopts the Multimodal Flower Pollination Algorithm (MFPA) to detect all the circular instances contained in the image. Experimental results suggest that the proposed approach significantly improves the multi-circle detection problem.

One crucial step in several image processing and computer vision applications is Image Contrast Enhancement (ICE), whose main objective is to improve the quality of the information contained in the processed images. Most of the proposed schemes attack the problem by redistributing the pixel intensities in a histogram, leading to undesirable effects such as noise amplification, over-saturation, and lousy human perception. On the other hand, Agent-Based Models (ABM) are computational models that allow describing the behavior and interactions of autonomous agents when they operate cooperatively. These agents follow behavioral rules rather than mathematical formulations. This mechanism allows the implementation of complex behavioral patterns in agents through their interactions. This paper proposes a two-step method where pixels in the processed image are considered agents whose behavioral rules permit to enhance significatively the contrast. In our approach, the interactions among the agents are characterized by the differences in intensity values among the pixels or agents. In the first step, pixels or agents that present enough high differences in their intensity are modified to increase even more their differences. In the second step, pixels or agents that maintain a very small difference are altered to assume a homogeneous intensity value. The proposed approach has been tested considering different public datasets commonly used in the literature. Its results are also compared with those produced by other well-known ICE techniques. Evaluation of the experimental results demonstrates that the proposed approach highlights the important details of the image taking a lower computational execution time.

Since late 2019, most efforts to control the COVID-19 pandemic have focused on developing vaccines. By mid-2020, some vaccines fulfilled international regulations for their application. However, these vaccines have shown a decline in effectiveness several weeks after the last dose, highlighting the need to optimize vaccine administration due to supply chain limitations. While methods exist to prioritize population groups for vaccination, there is a lack of research on how to optimally define the time between doses when two-dose vaccines are administrated to such groups. Under such conditions, modeling the real effect of each vaccine on the population is critical. Even though several efforts have been made to characterize vaccine effectiveness profiles, none of these initiatives enable characterization of the individual effect of each dose. Thus, this paper presents a novel methodology for estimating the vaccine effectiveness profile. It addresses the vaccine characterization problem by considering a deconvolution of relevant data profiles, treating them as an optimization process. The results of this approach enabled the independent estimation of the effectiveness profiles for the first and second vaccine doses and their use to find sweet spots for designing efficient vaccination strategies. Our methodology can enable a more effective and efficient contemporary response against the COVID-19 pandemic, as well as for any other disease in the future.

Segmentation of pneumonia on lung radiographs is vital for the precise diagnosis and monitoring of the disease. It enables healthcare professionals to locate and quantify the extent of infection, guide treatment decisions, and improve patient care. One of the most-employed approaches to effectively segment pneumonia in lung radiographs is to treat it as an optimization task. By formulating the problem in this manner, it is possible to use the interesting capabilities of metaheuristic methods to determine the optimal segmentation solution. Although these methods produce interesting results, they frequently produce suboptimal solutions owing to the lack of exploration of the search space. In this paper, a new segmentation method for segmenting pneumonia in lung radiographs is introduced. The algorithm is based on the jellyfish search optimizer (JSO), which is characterized by its excellent global exploration capability and robustness. This method uses an energy curve based on cross-entropy as a cost function that penalizes misclassified pixels more heavily, leading to a sharper focus on regions where segmentation errors occur. This is particularly important because it allows for the accurate delineation of objects or regions of interest. To validate our proposed approach, we conducted extensive testing on the most widely available datasets. The results of our method were compared with those obtained using other established techniques. The results of our evaluation demonstrate that our approach consistently outperforms the other methods at levels 8, 16, and 32, with a difference of more than 10%.

A novel meta-heuristic nature-inspired optimization algorithm known as Groundwater Flow Algorithm (GWFA) is proposed in this paper. GWFA is inspired by the movement of groundwater from recharge areas to discharge areas. It follows a position update procedure guided by Darcy’s law which provides a mathematical framework of groundwater flow. The proposed optimization algorithm has been evaluated on 23 benchmark functions. The significance of the results is statistically validated using the Wilcoxon rank-sum, Friedman, and Kruskal-Walis tests. To prove the robustness of the algorithm, it has been further applied on several standard engineering problems. From these exhaustive experiments, it has been observed that the proposed GWFA can outperform many state-of-the-art optimization algorithms. Source code of this work is available at: https://github.com/Ritam-Guha/GWFA.

This article focuses on solving the order quantity allocation problem for retailers. It considers factors such as quality constraints, nonlinear quantity discounts, and price-dependent demand. By formulating it as a nonlinear maximization problem, the article aims to find the best combination of suppliers and order quantity out of infinite solutions to maximize the retailer’s profit. The main contribution of this research is a new mathematical model that can solve the problem of quality constraint and demand in a single step. This problem is complex due to the number of equations, their nonlinear nature, and the various trade-offs given by the market. Additionally, this research considers demand as output and includes price-dependent demand, which is more realistic for retailers. The proposed model was tested using an example from the recent literature and showed better results than the previously published best solution regarding profit maximization.

Economic Order Quantity (EOQ) is an important optimization problem for inventory management with an impact on various industries; however, their mathematical models may be complex with non-convex, non-linear, and non-differentiable objective functions. Metaheuristic algorithms have emerged as powerful tools for solving complex optimization problems (including EOQ). They are iterative search techniques that can efficiently explore large solution spaces and obtain near-optimal solutions. Simulated Annealing (SA) is a widely used metaheuristic method able to avoid local suboptimal solutions. The traditional SA algorithm is based on a single agent, which may result in a low convergence rate for complex problems. This article proposes a modified multiple-agent (population-based) adaptive SA algorithm; the adaptive algorithm imposes a slight attraction of all agents to the current best solution. As a proof of concept, the proposed algorithm was tested on a particular EOQ problem (recently studied in the literature and interesting by itself) in which the objective function is non-linear, non-convex, and non-differentiable. With these new mechanisms, the algorithm allows for the exploration of different regions of the solution space and determines the global optimum in a faster manner. The analysis showed that the proposed algorithm performed well in finding good solutions in a reasonably short amount of time.

Shape recognition in images represents one of the complex and hard-solving problems in computer vision due to its nonlinear, stochastic and incomplete nature. Classical image processing techniques have been normally used to solve this problem. Alternatively, shape recognition has also been conducted through metaheuristic algorithms. They have demonstrated to have a competitive performance in terms of robustness and accuracy. However, all of these schemes use old metaheuristic algorithms as the basis to identify geometrical structures in images. Original metaheuristic approaches experiment several limitations such as premature convergence and low diversity. Through the introduction of new models and evolutionary operators, recent metaheuristic methods have addressed these difficulties providing in general better results. This paper presents a comparative analysis on the application of five recent metaheuristic schemes to the shape recognition problem such as the Grey Wolf Optimizer (GWO), Whale Optimizer Algorithm (WOA), Crow Search Algorithm (CSA), Gravitational Search Algorithm (GSA) and Cuckoo Search (CS). Since such approaches have been successful in several new applications, the objective is to determine their efficiency when they face a complex problem such as shape detection. Numerical simulations, performed on a set of experiments composed of images with different difficulty levels, demonstrates the capacities of each approach.

As a mean to provide reactive power compensation to radial distribution networks, capacitor banks are commonly installed within these electrical distribution systems. When properly allocated, capacitor banks provide several benefits, including an improvement on the feeder’s voltage profile and significant reductions on power loss, which, in turn, leads to important amounts of energy savings and cost reductions. This formulation is known in the literature as optimal capacitor placement (OCP) problem. From an optimization perspective, OCP is considered remarkably complex due to its high multi-modality, discontinuity, and non-linearity. In this paper, the swarm optimization algorithm known as locust search (LS) is proposed for solving the OCP problem. The proposed approach has been tested by considering several IEEE’s radial distribution test systems, and its performance has also been compared against that of other techniques currently reported on the literature to solve the OCP problem. Our experimental results suggest that the proposed LS-based method is able to competitively solve the OCP problem in terms of accuracy and robustness.

This paper proposes an optimal methodology based on the Differential Evolution algorithm for obtaining the set of duty cycles of a recently proposed power electronics converter with input current ripple cancelation capability. The converter understudy was recently introduced to the state-of-the-art as the interleaved connection of two unequal converters to achieve low input current ripple. A latter contribution proposed a so-called proportional strategy. The strategy can be described as the equations to relate the duty cycles of the unequal power stages. This article proposes a third switching strategy that provides a lower input current ripple than the proportional strategy. This is made by considering duty cycles independently of each other instead of proportionally. The proposed method uses the Differential Evolution algorithm to determine the optimal switching pattern that allows high quality at the input current side, given the reactive components, the switching frequency, and power levels. The mathematical model of the converter is analyzed, and thus, the decision variables and the optimization problem are well set. The proposed methodology is validated through numerical experimentation, which shows that the proposed method achieves lower input current ripples than the proportional strategy.

Multiple applications of sensor devices in the form of a Wireless Sensor Network (WSN), such as those represented by the Internet of Things and monitoring dangerous geographical spaces, have attracted the attention by several scientific communities. Despite their interesting properties, sensors present an adverse characteristic: they manage very limited energy. Under such conditions, saving energy represents one of the most important concepts in designing effective protocols for WSNs. The objective of a protocol is to increase the network lifetime through the reduction of energy consumed by each sensor. In this paper, a robust clustering routing protocol for WSNs is introduced. The scheme uses the Locust Search (LS-II) method to determine the number of cluster heads and to identify the optimal cluster heads. Once the cluster heads are recognized, the other sensor elements are assigned to their nearest corresponding cluster head. Numerical simulations exhibit competitive results and demonstrate that the proposed protocol allows for the minimization of the energy consumption, extending the network lifetime in comparison with other popular clustering routing protocols.

Recently, several new metaheuristic schemes have been introduced in the literature. Although all these approaches consider very different phenomena as metaphors, the search patterns used to explore the search space are very similar. On the other hand, second-order systems are models that present different temporal behaviors depending on the value of their parameters. Such temporal behaviors can be conceived as search patterns with multiple behaviors and simple configurations. In this paper, a set of new search patterns are introduced to explore the search space efficiently. They emulate the response of a second-order system. The proposed set of search patterns have been integrated as a complete search strategy, called Second-Order Algorithm (SOA), to obtain the global solution of complex optimization problems. To analyze the performance of the proposed scheme, it has been compared in a set of representative optimization problems, including multimodal, unimodal, and hybrid benchmark formulations. Numerical results demonstrate that the proposed SOA method exhibits remarkable performance in terms of accuracy and high convergence rates.

This manuscript presents the numerical optimization (through a mathematical model and an evolutionary algorithm) of the voltage-doubler boost converter, also called the series-capacitor boost converter. The circuit is driven by two transistors, each of them activated according to a switching signal. In the former operation, switching signals have an algebraic dependence from each other. This article proposes a new method to operate the converter. The proposed process reduces the input current ripple without changing any converter model parameter, only the driving signals. In the proposed operation, switching signals of transistors are independent of each other, providing an extra degree of freedom, but on the other hand, this produces an infinite number of possible combinations of duty cycles (the main parameter of switching signals) to achieve the desired voltage gain. In other words, this leads to a problem with infinite possible solutions. The proposed method utilizes an evolutionary algorithm to determine the switching functions and, at the same time, to minimize the input current ripple of the converter. A comparison made between the former and the proposed operation shows that the proposed process achieves a lower input current ripple while achieving the desired voltage gain.

Power-electronics based converters are essential circuits in renewable energy applications such as electricity generated with photovoltaic panels. The research on the field is getting increasing attention due to climate change problems and their possible attenuation with the use of renewable energy. Mathematical models of the converters are being used to optimize several aspects of their operation. This article is dedicated to optimizing (through the mathematical model and an evolutionary algorithm) the operation of a state-of-the-art converter. The converter, which is composed of two parts or phases, is controlled by pulse width modulation with two switching signals (one for each phase). The converter provides by itself low switching ripple in both the output voltage and the input current, which is beneficial for renewable energy applications. In the traditional operation, one of the switching signals has an algebraic dependence on the other one. This article proposes a new way to select the duty cycle for both signals. In the proposed method, duty cycles of both phases are considered independent of each other; this provides an extra degree of freedom; on the other hand, this produce that the possible combinations of duty cycles which produce a certain voltage gain is infinite, it becomes a problem with infinite possible solutions. The proposed method utilizes the a linear success-history based adaptive differential evolution with linear population reduction, also called L-SHADE algorithm for simplicity, to find the two duty cycles that achieve the desired voltage gain and to minimize the converters switching ripple. The obtained results are compared with the former operation of the converter; the proposed operation achieves a lower output voltage ripple while achieving the desired operation (voltage gain).

The techniques of halftoning are widely used in marketing because they reduce the cost of impression and maintain the quality of graphics. Halftoning converts a digital image into a binary image conformed by dots. The output of the halftoning contains less visual information; a possible benefit of this task is the reduction of ink when graphics are printed. The human eye is not able to detect the absence of information, but the printed image stills have good quality. The most used method for halftoning is called Floyd-Steinberger, and it defines a specific matrix for the halftoning conversion. However, most of the proposed techniques in halftoning use predefined kernels that do not permit adaptation to different images. This article introduces the use of the harmony search algorithm (HSA) for halftoning. The HSA is a popular evolutionary algorithm inspired by the musical improvisation. The different operators of the HSA permit an efficient exploration of the search space. The HSA is applied to find the best configuration of the kernel in halftoning; meanwhile, as an objective function, the use of the structural similarity index (SSIM) is proposed. A set of rules are also introduced to reduce the regular patterns that could be created by non-appropriate kernels. The SSIM is used due to the fact that it is a perception model used as a metric that permits comparing images to interpret the differences between them numerically. The aim of combining the HSA with the SSIM for halftoning is to generate an adaptive method that permits estimating the best kernel for each image based on its intrinsic attributes. The graphical quality of the proposed algorithm has been compared with classical halftoning methodologies. Experimental results and comparisons provide evidence regarding the quality of the images obtained by the proposed optimization-based approach. In this context, classical algorithms have a lower graphical quality in comparison with our proposal. The results have been validated by a statistical analysis based on independent experiments over the set of benchmark images by using the mean and standard deviation.

Supplier selection and order quantity allocation have a strong influence on a company’s profitability and the total cost of finished products. From an optimization perspective, the processes of selecting the right suppliers and allocating orders are modeled through a cost function that considers different elements, such as the price of raw materials, ordering costs, and holding costs. Obtaining the optimal solution for these models represents a complex problem due to their discontinuity, non-linearity, and high multi-modality. Under such conditions, it is not possible to use classical optimization methods. On the other hand, metaheuristic schemes have been extensively employed as alternative optimization techniques to solve difficult problems. Among the metaheuristic computation algorithms, the Grey Wolf Optimization (GWO) algorithm corresponds to a relatively new technique based on the hunting behavior of wolves. Even though GWO allows obtaining satisfying results, its limited exploration reduces its performance significantly when it faces high multi-modal and discontinuous cost functions. In this paper, a modified version of the GWO scheme is introduced to solve the complex optimization problems of supplier selection and order quantity allocation. The improved GWO method called iGWO includes weighted factors and a displacement vector to promote the exploration of the search strategy, avoiding the use of unfeasible solutions. In order to evaluate its performance, the proposed algorithm has been tested on a number of instances of a difficult problem found in the literature. The results show that the proposed algorithm not only obtains the optimal cost solutions, but also maintains a better search strategy, finding feasible solutions in all instances.

The design of two-dimensional Infinite Impulse Response (2D-IIR) filters has recently attracted attention in several areas of engineering because of their wide range of applications. Synthesizing a user-defined filter in a 2D-IIR structure can be interpreted as an optimization problem. However, since 2D-IIR filters can easily produce unstable transfer functions, they tend to compose multimodal error surfaces, which are computationally difficult to optimize. On the other hand, Evolutionary Computation (EC) algorithms are well-known global optimization methods with the capacity to explore complex search spaces for a suitable solution. Every EC technique holds distinctive attributes to properly satisfy particular requirements of specific problems. Hence, a particular EC algorithm is not able to solve all problems adequately. To determine the advantages and flaws of EC techniques, their correct evaluation is a critical task in the computational intelligence community. Furthermore, EC algorithms are stochastic processes with random operations. Under such conditions, for obtaining significant conclusions, appropriate statistical methods must be considered. Although several comparisons among EC methods have been reported in the literature, their conclusions are based on a set of synthetic functions, without considering the context of the problem or appropriate statistical treatment. This paper presents a comparative study of various EC techniques currently in use employed for designing 2D-IIR digital filters. The results of several experiments are presented and statistically analyzed.

In the past years, the interest in direct current to direct current converters has increased because of their application in renewable energy systems. Consequently, the research community is working on improving its efficiency in providing the required voltage to electronic devices with the lowest input current ripple. Recently, a hybrid converter which combines the boost and the Cuk converter in an interleaved manner has been introduced. The converter has the advantage of providing a relatively low input current ripple by a former strategy. However, it has been proposed to operate with dependent duty cycles, limiting its capacity to further decrease the input current ripple. Independent duty cycles can significantly reduce the input current ripple if the same voltage gain is achieved by an appropriate duty cycle combination. Nevertheless, finding the optimal duty cycle combination is not an easy task. Therefore, this article proposes a new pulse-width-modulation strategy for the hybrid interleaved boost-Cuk converter. The strategy includes the development of a novel mathematical model to describe the relationship between independent duty cycles and the input current ripple. The model is introduced to minimize the input current ripple by finding the optimal duty cycle combination using the differential evolution algorithm. It is shown that the proposed method further reduces the input current ripple for an operating range. Compared to the former strategy, the proposed method provides a more balanced power-sharing among converters.

Evolutionary Computation Methods (ECMs) are proposed as stochastic search methods to solve complex optimization problems where classical optimization methods are not suitable. Most of the proposed ECMs aim to find the global optimum for a given function. However, from a practical point of view, in engineering, finding the global optimum may not always be useful, since it may represent solutions that are not physically, mechanically or even structurally realizable. Commonly, the evolutionary operators of ECMs are not designed to efficiently register multiple optima by executing them a single run. Under such circumstances, there is a need to incorporate certain mechanisms to allow ECMs to maintain and register multiple optima at each generation executed in a single run. On the other hand, the concept of dominance found in animal behavior indicates the level of social interaction among two animals in terms of aggressiveness. Such aggressiveness keeps two or more individuals as distant as possible from one another, where the most dominant individual prevails as the other withdraws. In this paper, the concept of dominance is computationally abstracted in terms of a data structure called “competitive memory” to incorporate multimodal capabilities into the evolutionary operators of the recently proposed Cluster-Chaotic-Optimization (CCO). Under CCO, the competitive memory is implemented as a memory mechanism to efficiently register and maintain all possible optimal values within a single execution of the algorithm. The performance of the proposed method is numerically compared against several multimodal schemes over a set of benchmark functions. The experimental study suggests that the proposed approach outperforms its competitors in terms of robustness, quality, and precision.

Classical methods often face great difficulties in solving image processing problems in images containing noise and distortions. Under such conditions, the use of bio-inspired optimization approaches has been extended. This paper explores the use of the Artificial Bee Colony (ABC) algorithm for digital image processing seen as an optimization problem. ABC is a heuristic algorithm motivated by the biological behaviour of honey-bees which has been successfully employed to solve complex optimization problems. In this paper, image segmentation and circle detection tasks are considered as examples, both issues approached as optimization problems. In segmentation, an image 1-D histogram is approximated through a Gaussian mixture model whose parameters are calculated by the ABC algorithm. On the other hand, the circle detector uses a combination of three edge points as parameters to construct candidate circles. A matching function determines is such candidate circles are actually present in the image. Experimental results show that the generated solutions are able to solve properly the considered problems.

This paper proposes a new algorithm called Multimodal Flower Pollination Algorithm (MFPA). Under MFPA, the original Flower Pollination Algorithm (FPA) is enhanced with multimodal capabilities in order to find all possible optima in an optimization problem. The performance of the proposed MFPA is compared to several multimodal approaches considering the evaluation in a set of well-known benchmark functions. Experimental data indicate that the proposed MFPA provides better results over other multimodal competitors in terms of accuracy and robustness.

The efficient use of energy in electrical systems has become a relevant topic due to its environmental impact. Parameter identification in induction motors and capacitor allocation in distribution networks are two representative problems that have strong implications in the massive use of energy. From an optimization perspective, both problems are considered extremely complex due to their non-linearity, discontinuity, and high multi-modality. These characteristics make difficult to solve them by using standard optimization techniques. On the other hand, metaheuristic methods have been widely used as alternative optimization algorithms to solve complex engineering problems. The Crow Search Algorithm (CSA) is a recent metaheuristic method based on the intelligent group behavior of crows. Although CSA presents interesting characteristics, its search strategy presents great difficulties when it faces high multi-modal formulations. In this paper, an improved version of the CSA method is presented to solve complex optimization problems of energy. In the new algorithm, two features of the original CSA are modified: (I) the awareness probability (AP) and (II) the random perturbation. With such adaptations, the new approach preserves solution diversity and improves the convergence to difficult high multi-modal optima. In order to evaluate its performance, the proposed algorithm has been tested in a set of four optimization problems which involve induction motors and distribution networks. The results demonstrate the high performance of the proposed method when it is compared with other popular approaches.

Solar energy is used worldwide to alleviate the daily increasing demands for electric power. Photovoltaic (PV) cells, which are used to convert solar energy into electricity, can be represented as equivalent circuit models, in which a series of electrical parameters must be identified in order to determine their operating characteristics under different test conditions. Intelligent approaches, like those based in population-based optimization algorithms like Particle Swarm Optimization (PSO), Genetic Algorithms (GAs), and Simulated Annealing (SA), have been demonstrated to be powerful methods for the accurate identification of such parameters. Recently, chaos theory have been highlighted as a promising alternative to increase the performance of such approaches; as a result, several chaos-based optimization methods have been devised to solve many different and complex engineering problems. In this paper, the Chaotic Gravitational Search Algorithm (CGSA) is proposed to solve the problem of accurate PV cell parameter estimation. To prove the feasibility of the proposed approach, a series of comparative experiments against other similar parameters extraction methods were performed. As shown by our experimental results, our proposed approach outperforms all other methods compared in this work, and proves to be an excellent alternative to tackle the challenging problem of solar cell parameters identification.

Recently, many researchers have proved that the electrification of the transport sector is a key for reducing both the emissions of green-house pollutants and the dependence on oil for transportation. As a result, Plug-in Hybrid Electric Vehicles (or PHEVs) are receiving never before seen increased attention. Consequently, large-scale penetration of PHEVs into the market is expected to take place in the near future, however, an unattended increase in the PHEVs needs may cause several technical problems which could potentially compromise the stability of power systems. As a result of the growing necessity for addressing such issues, topics related to the optimization of PHEVs’ charging infrastructures have captured the attention of many researchers. Related to this, several state-of-the-art swarm optimization methods (such as the well-known Particle Swarm Optimization (PSO) or the recently proposed Gravitational Search Algorithm (GSA) approach) have been successfully applied in the optimization of the average State of Charge (SoC), which represents one of the most important performance indicators in the context of PHEVs’ intelligent power allocation. Many of these swarm optimization methods, however, are known to be subject to several critical flaws, including premature convergence and a lack of balance between the exploration and exploitation of solutions. Such problems are usually related to the evolutionary operators employed by each of the methods on the exploration and exploitation of new solutions. In this paper, the recently proposed States of Matter Search (SMS) swarm optimization method is proposed for maximizing the average State of Charge of PHEVs within a charging station. In our experiments, several different scenarios consisting on different numbers of PHEVs were considered. To test the feasibility of the proposed approach, comparative experiments were performed against other popular PHEVs’ State of Charge maximization approaches based on swarm optimization methods. The results obtained on our experimental setup show that the proposed SMS-based SoC maximization approach has an outstanding performance in comparison to that of the other compared methods, and as such, proves to be superior for tackling the challenging problem of PHEVs’ smart charging.

Interest in multimodal optimization is expanding rapidly, since many practical engineering problems demand the localization of multiple optima within a search space. On the other hand, the cuckoo search (CS) algorithm is a simple and effective global optimization algorithm which can not be directly applied to solve multimodal optimization problems. This paper proposes a new multimodal optimization algorithm called the multimodal cuckoo search (MCS). Under MCS, the original CS is enhanced with multimodal capacities by means of (1) the incorporation of a memory mechanism to efficiently register potential local optima according to their fitness value and the distance to other potential solutions, (2) the modification of the original CS individual selection strategy to accelerate the detection process of new local minima, and (3) the inclusion of a depuration procedure to cyclically eliminate duplicated memory elements. The performance of the proposed approach is compared to several state-of-the-art multimodal optimization algorithms considering a benchmark suite of fourteen multimodal problems. Experimental results indicate that the proposed strategy is capable of providing better and even a more consistent performance over existing well-known multimodal algorithms for the majority of test problems yet avoiding any serious computational deterioration.

System identification is a complex optimization problem which has recently attracted the attention in the field of science and engineering. In particular, the use of infinite impulse response (IIR) models for identification is preferred over their equivalent FIR (finite impulse response) models since the former yield more accurate models of physical plants for real world applications. However, IIR structures tend to produce multimodal error surfaces whose cost functions are significantly difficult to minimize. Evolutionary computation techniques (ECT) are used to estimate the solution to complex optimization problems. They are often designed to meet the requirements of particular problems because no single optimization algorithm can solve all problems competitively. Therefore, when new algorithms are proposed, their relative efficacies must be appropriately evaluated. Several comparisons among ECT have been reported in the literature. Nevertheless, they suffer from one limitation: their conclusions are based on the performance of popular evolutionary approaches over a set of synthetic functions with exact solutions and well-known behaviors, without considering the application context or including recent developments. This study presents the comparison of various evolutionary computation optimization techniques applied to IIR model identification. Results over several models are presented and statistically validated.

In this paper, a multilevel thresholding (MT) algorithm based on the harmony search algorithm (HSA) is introduced. HSA is an evolutionary method which is inspired in musicians improvising new harmonies while playing. Different to other evolutionary algorithms, HSA exhibits interesting search capabilities still keeping a low computational overhead. The proposed algorithm encodes random samples from a feasible search space inside the image histogram as candidate solutions, whereas their quality is evaluated considering the objective functions that are employed by the Otsu’s or Kapur’s methods. Guided by these objective values, the set of candidate solutions are evolved through the HSA operators until an optimal solution is found. Experimental results demonstrate the high performance of the proposed method for the segmentation of digital images.