Search

In this paper, a novel model of an energy management system (EMS) for a microgrid (MG) under uncertain conditions is proposed. The MG consists of renewable photovoltaic and wind sources along with electric vehicle parking lots. Hence, the model incorporates the uncertainties of renewable DGs, parking lots, and also load. In this study, the MG operation cost and voltage stability index are considered objective functions. A novel combined algorithm (hMOPSO-HS) is proposed for microgrid energy management. The hMOPSO-HS algorithm is a combination of the mutant multiobjective particle swarm optimization (MOPSO) algorithm and the harmony search (HS) algorithm. The simulations are performed in two parts, with and without considering the uncertainty. The comparative analysis involves evaluating the optimization outcomes achieved by the hMOPSO-HS algorithm in contrast to various other metaheuristic algorithms for multiobjective optimization. The simulation findings validate the superior efficacy of the hMOPSO-HS algorithm compared to other approaches. Also, the simulation results showed that in the conditions of uncertainty, the operating cost is 6.1% higher and the microgrid stability index is 6.8% lower. Also, considering the uncertainty has caused the penalty for energy not supplied (ENS) and demand response program (DRP) costs to increase by 3% and 4%, respectively. [ABSTRACT FROM AUTHOR]

This paper devotes a new method in modeling and optimizing to handle the optimization of the XY positioning mechanism. The fitness functions and constraints of the mechanism are formulated via proposing a combination of artificial neural network (ANN) and particle swarm optimization (PSO) methods. Next, the PSO is hybridized with the grey wolf optimization, namely PSO-GWO, which is applied to three scenarios in handling the single objective function. In order to search the multiple functions for the mechanism, the multiobjective optimization genetic algorithm (MOGA) is applied to the last scenario. The achieved results showed that the fitness functions are well-formulated using the PSO-based ANN method. In the scenario 1, the stroke achieved by the PSO-GWO (1852.9842 μm) is better than that gained from the GWO (1802.8087 μm). In the scenarios 2, the stress gained from the PSO-GWO (243.3183 MPa) is lower than that achieved from the GWO (245.0401 MPa). In the scenario 3, the safety factor retrieved from the PSO-GWO (1.9767) is greater than that achieved from the GWO (1.9278). In the scenario 4, by using MOGA, the optimal results found that the stroke is about (1741.3 μm) and the safety factor is 1.8929. The prediction results are well-fitted with the numerical and experimental verifications. The results of this paper are expected to facilitate the synthesis and analysis of compliant mechanisms and related engineering designs. [ABSTRACT FROM AUTHOR]

The photovoltaic(PV) system's efficiency can be improved with the aid of effective solar PV cell modeling. However, flawed solar cell parameters affect PV cell modeling incorrectly. The manufacturers are usually not providing all the necessary data for the exact modeling of PV cells. It is therefore necessary to efficiently predict the parameters of the PV cell. The literature discusses various optimization algorithms, but the suboptimal outcomes are obtained by most of the algorithms due to their convergence toward local minima. This paper introduces a new stochastic optimization algorithm for the estimation of solar PV cell parameters. Therefore, for the evaluation of the solar cell, a new novel chaotic algorithm is introduced in this paper called the chaotic tunicate swarm algorithm (CTSA). The proposed algorithm has a new function called an outstanding mathematical model of adaptive weights to stimulate negative and positive inputs from the spreading wave in order to find the best way to connect food with an excellent exploitation tendency and exploratory ability. For the double‐diode model, the computation time of the chaotic variants (CTSA1‐1.1885, CTSA2‐1.2502, CTSA3‐1.2962, CTSA4‐1.1204, and CTSA5‐1.2214) is better than the rest of the compared algorithms (particle swarm optimization [PSO]‐17.4532, tunicate swarm algorithm (TSA)‐2.5278, Harris hawks optimization [HHO]‐10.8942, ant lion optimizer [ALO]‐15.0214, and atom search optimization [ASO]‐9.5214). For the triple‐diode model, the computation time of the chaotic variants (CTSA1‐1.2658, CTSA2‐1.3520, CTSA3‐1.3056, CTSA4‐1.2290, and CTSA5‐1.3859) is better than the rest of the compared algorithms (PSO‐18.5421, TSA‐3.2568, HHO‐9.8754, ALO‐13.5841, and ASO‐11.8412). The superiority of proposed algorithm is established using ranking test, statistical error analysis, and sensitivity temperature variation. [ABSTRACT FROM AUTHOR]

The reptile search algorithm (RSA) is a swarm-based metaheuristic algorithm inspired by the encirclement and hunt mechanisms of crocodiles. Compared with other algorithms, RSA is competitive but still suffers from low population diversity, unbalanced exploitation and exploration, and the tendency to fall into local optima. To overcome these shortcomings, a modified variant of RSA, named MRSA, is proposed in this paper. First, an adaptive chaotic reverse learning strategy is employed to enhance the population diversity. Second, an elite alternative pooling strategy is proposed to balance exploitation and exploration. Finally, a shifted distribution estimation strategy is used to correct the evolutionary direction and improve the algorithm performance. Subsequently, the superiority of MRSA is verified using 23 benchmark functions, IEEE CEC2017 benchmark functions, and robot path planning problems. The Friedman test, the Wilcoxon signed-rank test, and simulation results show that the proposed MRSA outperforms other comparative algorithms in terms of convergence accuracy, convergence speed, and stability. [ABSTRACT FROM AUTHOR]

The New Caledonian crow learning algorithm (NCCLA) is a novel metaheuristic algorithm inspired by the learning behavior of New Caledonian crows learning to make tools to obtain food. However, it suffers from the problems of easily falling into local optima and insufficient convergence accuracy and convergence precision. To further improve the convergence performance of NCCLA, an improved New Caledonian crow learning algorithm (INCCLA) is proposed in this paper. By determining the parent individuals based on the cosine similarity, the juveniles are guided to search toward different ranges to maintain the population diversity; a novel hybrid mechanism of complete and incomplete learning is proposed to balance the exploration and exploitation capabilities of the algorithm; the update strategy of juveniles and parent individuals is improved to enhance the convergence speed and precision of the algorithm. The test results of the CEC2013 and CEC2020 test suites show that, compared with the original NCCLA algorithm and four of the best metaheuristics to date, INCCLA has significant advantages in terms of convergence speed, convergence precision, and stability. [ABSTRACT FROM AUTHOR]

In recent years, an increasing number of population-based metaheuristic algorithms have been proposed to solve the flexible job-shop scheduling problem (FJSP) according to its practicality and complexity. Most of these algorithms are single-population-based and hence are very susceptible to becoming trapped in local optimal values. Thus, multipopulation methods are widely used to improve these algorithms, resulting in multipopulation algorithms. These multipopulation algorithms have been widely studied in the context of single-layer complex networks recently. However, coupled networks used to control two (or more) algorithms simultaneously to get a better algorithm are always ignored in literature. Therefore, in this paper, using coupled scale-free networks (with different scaling exponents) to control the genetic algorithm (GA) and the invasive weed optimization (IWO) simultaneously, a multipopulation GA/IWO with coupled scale-free networks (MPGAIWO-SF) is proposed to solve FJSP. Then, we study how some parameters (e.g., subpopulation size, subpopulation number, and scaling exponent) of MPGAIWO-SF affect its performance, which is also ignored in literature. The simulation results illustrate that (1) the performance of MPGAIWO-SF is significantly improved compared with that of GA and IWO; (2) as the subpopulation size increases, the performance of MPGAIWO-SF first becomes better and then remains almost unchanged; (3) as the subpopulation number increases, the performance of MPGAIWO-SF first becomes better and then decreases rapidly; and (4) the performance of MPGAIWO-SF becomes worse slightly as the scaling exponent decreases. Finally, solving more FJSP instances, the MPGAIWO-SF with optimized parameters is compared with other related algorithms to verify its effectiveness. [ABSTRACT FROM AUTHOR]

With the rapid development of the Internet of Things (IoT), the curse of dimensionality becomes increasingly common. Feature selection (FS) is to eliminate irrelevant and redundant features in the datasets. Particle swarm optimization (PSO) is an efficient metaheuristic algorithm that has been successfully applied to obtain the optimal feature subset with essential information in an acceptable time. However, it is easy to fall into the local optima when dealing with high-dimensional datasets due to constant parameter values and insufficient population diversity. In the paper, an FS method is proposed by utilizing adaptive PSO with leadership learning (APSOLL). An adaptive updating strategy for parameters is used to replace the constant parameters, and the leadership learning strategy is utilized to provide valid population diversity. Experimental results on 10 UCI datasets show that APSOLL has better exploration and exploitation capabilities through comparison with PSO, grey wolf optimizer (GWO), Harris hawks optimization (HHO), flower pollination algorithm (FPA), salp swarm algorithm (SSA), linear PSO (LPSO), and hybrid PSO and differential evolution (HPSO-DE). Moreover, less than 8% of features in the original datasets are selected on average, and the feature subsets are more effective in most cases compared to those generated by 6 traditional FS methods (analysis of variance (ANOVA), Chi-Squared (CHI2), Pearson, Spearman, Kendall, and Mutual Information (MI)). [ABSTRACT FROM AUTHOR]

A transition to solar energy systems is considered one of the most important alternatives to conventional fossil fuels. Until recently, solar air heaters (SAHs) were among the other solar energy systems that have been widely used in various households and industrial applications. However, the recent literature reveals that efficiencies of SAHs are still low. Some metaheuristic algorithms have been used to enhance the efficiencies of these SAH systems. In the paper, we do not only discuss the techniques used to enhance the performance of SAHs, but we also reviewed a majority of published papers on the applications of SAH optimization. The metaheuristic algorithms include simulated annealing (SA), particle swarm optimization (PSO), genetic algorithm (GA), artificial bee colony (ABC), teaching-learning-based optimization (TLBO), and elitist teaching-learning-based optimization (ETLBO). For this research, it should be noted that this study is mostly based on the literature published in the last ten years in good energy top journals. Therefore, this paper clearly shows that the use of all six proposed metaheuristic algorithms results in significant efficiency improvements through the selection of the optimal design set and operating parameters for SAHs. Based on the past literature and on the outcomes of this paper, ETLBO is unquestionably more competitive than ABC, GA, PSO, SA, and TLBO for the optimization of SAHs for the same considered problem. Finally, based on the covered six state-of-the-art metaheuristic techniques, some perspectives and recommendations for the future outlook of SAH optimization are proposed. This paper is the first-ever attempt to present the current developments to a large audience on the applications of metaheuristic methods in SAH optimization. Thus, researchers can use this paper for further research and for the advancement of the proposed and other recommended algorithms to generate the best performance for the various SAHs. [ABSTRACT FROM AUTHOR]

BBO is one of the new metaheuristic optimization algorithms, which is based on the science of biogeography. It can be used to solve optimization problems through the migration and drift of species between habitats. Many improved BBO algorithms have been proposed, but there were still many shortcomings in global optimization, convergence speed, and algorithm complexity. In response to the above problems, this paper proposes an improved BBO algorithm (DCGBBO) by hierarchical tissue-like P system with triggering ablation rules. Membrane computing is a branch of natural computing that aims to abstract computational models (P system) from the structure and function of biological cells and from the collaboration of cell groups such as organs and tissues. In this paper, firstly, a dynamic crossover migration operator is generated to improve the global search ability and also increase the species diversity. Secondly, a dynamic Gaussian mutation operator is introduced to speed up convergence and improve local search capabilities. To guarantee the correctness and feasibility of the mutation, a unified maximum mutation rate is designed. Finally, a hierarchical tissue-like P system with triggering ablation rules is combined with the DCGBBO algorithm, making use of evolution rules and communication rules to achieve migration and mutation of solutions and reduce computational complexity. In the experiments, eight classic benchmark functions and CEC 2017 benchmark functions are applied to demonstrate the effect of our algorithm. We apply the proposed algorithm to segment four colour pictures, and the results proved to be better compared to other algorithms. [ABSTRACT FROM AUTHOR]

The whale optimization algorithm (WOA) is a metaheuristic algorithm based on swarm intelligence and it mimics the hunting behavior of whales. It has the imperfection of premature convergence into local optima. In order to overcome this disadvantage, a multioperator WOA (MOWOA) is proposed. Four main strategies are introduced to the MOWOA to heighten the search capacity of WOA. The strategies include nonlinear adaptive parameter design, an exploration mechanism of honey badger, Cauchy factor strategy, and greedy strategy. This paper tests the versatility of MOWOA with three different types of benchmark functions, and a kind of seismic inversion problem are trialed run. From the experimental results, the performance of MOWOA outperforms the compared algorithms in global optimization. [ABSTRACT FROM AUTHOR]

Artificial neural networks have achieved a great success in simulating the information processing mechanism and process of neuron supervised learning, such as classification. However, traditional artificial neurons still have many problems such as slow and difficult training. This paper proposes a new dendrite neuron model (DNM), which combines metaheuristic algorithm and dendrite neuron model effectively. Eight learning algorithms including traditional backpropagation, classic evolutionary algorithms such as biogeography-based optimization, particle swarm optimization, genetic algorithm, population-based incremental learning, competitive swarm optimization, differential evolution, and state-of-the-art jSO algorithm are used for training of dendritic neuron model. The optimal combination of user-defined parameters of model has been systemically investigated, and four different datasets involving classification problem are investigated using proposed DNM. Compared with common machine learning methods such as decision tree, support vector machine, k-nearest neighbor, and artificial neural networks, dendritic neuron model trained by biogeography-based optimization has significant advantages. It has the characteristics of simple structure and low cost and can be used as a neuron model to solve practical problems with a high precision. [ABSTRACT FROM AUTHOR]

The hypercube optimization search (HOS) approach is a new efficient and robust metaheuristic algorithm that simulates the dove's movement in quest of new food sites in nature, utilizing hypercubes to depict the search zones. In medical informatics, the classification of medical data is one of the most challenging tasks because of the uncertainty and nature of healthcare data. This paper proposes the use of the HOS algorithm for training multilayer perceptrons (MLP), one of the most extensively used neural networks (NNs), to enhance its efficacy as a decision support tool for medical data classification. The proposed HOS-MLP model is tested on four significant medical datasets: orthopedic patients, diabetes, coronary heart disease, and breast cancer, to assess HOS's success in training MLP. For verification, the results are compared with eleven different classifiers and eight well-regarded MLP trainer metaheuristic algorithms: particle swarm optimization (PSO), biogeography-based optimizer (BBO), the firefly algorithm (FFA), artificial bee colony (ABC), genetic algorithm (GA), bat algorithm (BAT), monarch butterfly optimizer (MBO), and the flower pollination algorithm (FPA). The experimental results demonstrate that the MLP trained by HOS outperforms the other comparative models regarding mean square error (MSE), classification accuracy, and convergence rate. The findings also reveal that the HOS help the MLP to produce more accurate results than other classification algorithms for the prediction of diseases. [ABSTRACT FROM AUTHOR]

Biomedical image analysis based on metaheuristic algorithms is one of the most important research areas encountered in recent years. Due to the low contrast differences between the diseased areas and the image background in high-contrast biomedical images, effective methods are required to diagnose diseases with high accuracy. To overcome the difficulties encountered in this field, metaheuristic approaches may offer effective solutions due to their advantages such as the ability of converging to the global optimum, higher convergence rate, and having few control parameters. In this work, Jellyfish Search (JS), Marine Predators (MPA), Tunicate Swarm (TSA), Mayfly Optimization (MA), Chimp Optimization (ChOA), Slime Mould Optimization (SMA), Archimedes Optimization (AOA), and Equilibrium Optimizer (EO) algorithms, which are the most recently proposed metaheuristic algorithms in the literature, have been improved as clustering based in order to achieve vessel segmentation with high precision. Also, a detailed performance comparison of these algorithms has been realized for the rate of convergences, error values reached, CPU time, standard deviation, sensitivity, specificity, accuracy, F-score, and Wilcoxon rank sum-test. In order to present the compatibility of the results obtained with the literature, the performances of these novel algorithms have also been compared to that of Particle Swarm Optimization (PSO), Grey Wolf Optimization (GWO), and Differential Evolution (DE) algorithms. The simulation results represent that each algorithm produces similar convergence and error performance. Also, it can be emphasized from the statistical analyses that the stability and robustness of each metaheuristic approach are quite adequate in separating the vessel pixels and the background pixels of a retinal image. In general, this paper proves that although having fewer number of control parameters, the JS, MPA, TSA, MA, ChOA, SMA, AOA, and EO algorithms produce similar but a bit better results in terms of image segmentation when compared to PSO, GWO, and DE algorithms. [ABSTRACT FROM AUTHOR]

This paper presents an in-depth survey and performance evaluation of cat swarm optimization (CSO) algorithm. CSO is a robust and powerful metaheuristic swarm-based optimization approach that has received very positive feedback since its emergence. It has been tackling many optimization problems, and many variants of it have been introduced. However, the literature lacks a detailed survey or a performance evaluation in this regard. Therefore, this paper is an attempt to review all these works, including its developments and applications, and group them accordingly. In addition, CSO is tested on 23 classical benchmark functions and 10 modern benchmark functions (CEC 2019). The results are then compared against three novel and powerful optimization algorithms, namely, dragonfly algorithm (DA), butterfly optimization algorithm (BOA), and fitness dependent optimizer (FDO). These algorithms are then ranked according to Friedman test, and the results show that CSO ranks first on the whole. Finally, statistical approaches are employed to further confirm the outperformance of CSO algorithm. [ABSTRACT FROM AUTHOR]

A number of recent or novel metaheuristic algorithms have been explored in the subject of optimization; although now not all of these algorithms are as efficient as their creators claim, a few have been confirmed to be a pretty efficient and useful tool for addressing complex optimization problems. On the other aspect, LINGO is a software tool used for linear, nonlinear, optimization problems. This paper's objective is to study how well the LINGO optimizer performs as contrasted to metaheuristic optimization strategies for over current relay coordination. The operation of directional over current relay is demonstrated with the applicability of LINGO optimizer and metaheuristic strategies. In this study, two distinct case studies, which include a mixed overhead line‐underground cable and a DER primarily based IEC microgrid benchmark, are tested for comparative evaluation among the LINGO optimizer and metaheuristic strategies. During the first stage of case study I, the crow search algorithm (CSA), a novel metaheuristic technique, was proposed, and its results are contrasted with the most popular conventional techniques: Particle swarm optimization (PSO) and water cycle algorithm (WCA). It reveals that implementing the proposed CSA algorithms improved over all time setting concerning the most common traditional techniques such as PSO and WCA. And, after implementing the LINGO optimizer, it is proven that compared with other metaheuristic optimization techniques, the second one proposed LINGO optimizer provides advanced consequences. In a similar manner, both proposed methods were applied and determined their performances in case study II and once more LINGO proved its strength over the metaheuristic approach. [ABSTRACT FROM AUTHOR]

In this paper, a novel swarm-based metaheuristic algorithm is proposed, which is called tuna swarm optimization (TSO). The main inspiration for TSO is based on the cooperative foraging behavior of tuna swarm. The work mimics two foraging behaviors of tuna swarm, including spiral foraging and parabolic foraging, for developing an effective metaheuristic algorithm. The performance of TSO is evaluated by comparison with other metaheuristics on a set of benchmark functions and several real engineering problems. Sensitivity, scalability, robustness, and convergence analyses were used and combined with the Wilcoxon rank-sum test and Friedman test. The simulation results show that TSO performs better compared to other comparative algorithms. [ABSTRACT FROM AUTHOR]

Summary The reliability of the smart grid is adversely affected due to system uncertainties. Also, the steadily growing deployment of renewable distributed generation (DG) units increases the uncertainties of smart grids. Hence, it is essential to concern the uncertainties in the field of reliability evaluation of smart grids. Although the Monte Carlo simulation (MCS) has received a significant deal of consideration in the literature, there is a research gap in using the clustering algorithms to assess smart grids' reliability. This article aims to fill such a research gap by proposing a new reliability assessment method, using various clustering algorithms. The benefits from the proposed method's accuracy and fast computation are highlighted, while optimal operation, optimal short‐term planning, and repetitive problems should be studied. In this paper, the performance and accuracy of various classic (k‐means, fuzzy c‐means, and k‐medoids) and metaheuristic (genetic algorithm, particle swarm optimization, differential evolutionary, harmony search, and artificial bee colony) clustering algorithms are studied. Comparing different scenario reduction algorithms in the proposed reliability evaluation method is one of the most contributions. The proposed method is applied to two realistic test systems. Test results infer that the proposed method is adequately precise, while the required computation time is less than MCS‐based approaches. Test results for both test systems imply that the accurate expected energy not supplied (EENS) with less than 2.1% is achievable applying the proposed method. The fuzzy c‐means clustering algorithm results in the best accuracy among the studied classic and nonclassic (metaheuristic) algorithms. [ABSTRACT FROM AUTHOR]

Summary: In this paper, a new population‐based meta‐heuristic algorithm called Social Optimization Algorithm (SOA) is proposed. This algorithm has been inspired by the social behavior of human‐beings, and mimics an ideal justly‐established society where the two principles of justice, that is, equality of opportunity and community principles are meticulously followed. Reaching goals in such a society is optimally achieved. Although a real fully‐just society does not exist in the real world, we implement the principles in such ideal societies through simulations to introduce our new optimization algorithm. The advantage of the proposed method is that it does not have any algorithm‐specified parameters to be set. This is a great merit compared to similar meta‐heuristics. The algorithm has been simulated on 23 well‐known test functions, and the results have been compared with those produced by Particle Swarm Optimization (PSO), Whale Optimization Algorithm (WOA) and Differential Evolution (DE). In 57% of the 23 cases SOA yields superior results. The algorithm has also been tested on five other benchmark functions to be compared with Teaching‐Learning‐Based Optimization (TLBO) and Artificial Bee Colony (ABC).The results provide evidence for efficient performance with superior solution quality of the proposed algorithm in solving benchmark problems. To further illustrate the effectiveness of the proposed algorithm, it has been tested on the Economic Dispatch problem as a real‐world constrained optimization problem. The results have been compared with Biogeography‐Based Optimizer (BBO), Harmony Search (HS) and PSO. The results show that the SOA is able to produce very competitive results compared to other well‐known meta‐heuristic algorithms. Meta‐heuristic, SOA, Economic Dispatch. [ABSTRACT FROM AUTHOR]

Renewable energy (RE) systems play a key role in producing electricity worldwide. The integration of RE systems is carried out in a distributed aspect via an autonomous hybrid microgrid (A-HMG) system. The A-HMG concept provides a series of technological solutions that must be managed optimally. As a solution, this paper focuses on the application of a recent nature-inspired metaheuristic optimization algorithm named a multimodal delayed particle swarm optimization (MDPSO). The proposed algorithm is applied to an A-HMG to find the minimum levelized cost of energy (LCOE), the lowest loss of power supply probability (LPSP), and the maximum renewable factor (REF). Firstly, a smart energy management scheme (SEMS) is proposed to coordinate the power flow among the various system components that formed the A-HMG. Then, the MDPSO is integrated with the SEMS to perform the optimal sizing for the A-HMG of a fishing village that is located in the coastal city of Essaouira, Morocco. The proposed A-HMG comprises photovoltaic panels (PV), wind turbines (WTs), battery storage systems, and diesel generators (DGs). The results of the optimization in this location show that A-HMG system can be applied for this location with a high renewable factor that is equal to 90%. Moreover, the solution is very promising in terms of the LCOE and the LPSP indexes that are equal to 0.17$/kWh and 0.12%, respectively. Therefore, using renewable energy can be considered as a good alternative to enhance energy access in remote areas as the fishing village in the city of Essaouira, Morocco. Furthermore, a sensitivity analysis is applied to highlight the impact of varying each energy source in terms of the LCOE index. [ABSTRACT FROM AUTHOR]

Summary: Nonlinear load results in inferior power quality and a non‐uniform power demand curve. This gets aggravated due to the charging of electric vehicles. This paper presents a new control approach of integrating a photovoltaic (PV) cell with battery storage to a shunt active power filter (SAPF) for electric vehicle (EV) applications. The multifunctional PV‐Battery‐integrated SAPF (PV‐Battery‐SAPF) performs harmonic mitigation along with clean power generation, energy storage, uniform load demand curve, and battery swapping. It is achieved through a two‐stage topology. In the first stage, maximum power point (MPP) of a PV array is robustly tracked using metaheuristic algorithms like cuckoo search algorithm and particle swarm optimization. In the second stage, an ant colony optimization‐tuned controller is developed which adaptively controls the SAPF to improve the power quality. The suggested method provides efficient MPP tracking, lesser total harmonic distortion, better dynamic system performance, and appropriate charging/discharging of battery leading to increased system reliability. The proposed system is validated in real time on a hardware‐in‐the‐loop (HIL) testing platform. [ABSTRACT FROM AUTHOR]

This paper studies a supply chain network design model with price competition. The supply chain provides multiple products for a market area in multiple periods. The model considers the location of manufacturers and retailers and assumes a probabilistic customer behavior based on an attraction function depending on both the location and the quality of the retailers. We aim to design the supply chain under the capacity constraint and maximize the supply chain profit in the competitive environment. The problem is formulated as a mixed integer nonlinear programming model. To solve the problem, we propose two heuristic algorithms—Simulated Annealing Search (SA) and Particle Swarm Optimization (PSO)—and numerically demonstrate the effectiveness of the proposed algorithms. Through the sensitivity analysis, we give some management insights. [ABSTRACT FROM AUTHOR]

This paper studies the metaheuristic optimizer-based direct identification of a multiple-mode system consisting of a finite set of linear regression representations of subsystems. To this end, the concept of a multiple-mode linear regression model is first introduced, and its identification issues are established. A method for reducing the identification problem for multiple-mode models to an optimization problem is also described in detail. Then, to overcome the difficulties that arise because the formulated optimization problem is inherently ill-conditioned and nonconvex, the cyclic-network-topology-based constrained particle swarm optimizer (CNT-CPSO) is introduced, and a concrete procedure for the CNT-CPSO-based identification methodology is developed. This scheme requires no prior knowledge of the mode transitions between subsystems and, unlike some conventional methods, can handle a large amount of data without difficulty during the identification process. This is one of the distinguishing features of the proposed method. The paper also considers an extension of the CNT-CPSO-based identification scheme that makes it possible to simultaneously obtain both the optimal parameters of the multiple submodels and a certain decision parameter involved in the mode transition criteria. Finally, an experimental setup using a DC motor system is established to demonstrate the practical usability of the proposed metaheuristic optimizer-based identification scheme for developing a multiple-mode linear regression model. [ABSTRACT FROM AUTHOR]

Electromagnetic field optimization (EFO) is a relatively new physics-inspired population-based metaheuristic algorithm, which simulates the behavior of electromagnets with different polarities and takes advantage of a nature-inspired ratio, known as the golden ratio. In EFO, the population consists of electromagnetic particles made of electromagnets corresponding to variables of an optimization problem and is divided into three fields: positive, negative, and neutral. In each iteration, a new electromagnetic particle is generated based on the attraction-repulsion forces among these electromagnetic fields, where the repulsion force helps particle to avoid the local optimal point, and the attraction force leads to find global optimal. This paper introduces an improved version of the EFO called improved electromagnetic field optimization (iEFO). Distinct from the EFO, the iEFO has two novel modifications: new solution generation function for the electromagnets and adaptive control of algorithmic parameters. In addition to these major improvements, the boundary control and randomization procedures for the newly generated electromagnets are modified. In the computational studies, the performance of the proposed iEFO is tested against original EFO, existing physics-inspired algorithms, and state-of-the-art meta-heuristic algorithms as artificial bee colony algorithm, particle swarm optimization, and differential evolution. Obtained results are verified with statistical testing, and results reveal that proposed iEFO outperforms the EFO and other considered competitor algorithms by providing better results. [ABSTRACT FROM AUTHOR]

Multilayer feed-forward artificial neural networks are one of the most frequently used data mining methods for classification, recognition, and prediction problems. The classification accuracy of a multilayer feed-forward artificial neural networks is proportional to training. A well-trained multilayer feed-forward artificial neural networks can predict the class value of an unseen sample correctly if provided with the optimum weights. Determining the optimum weights is a nonlinear continuous optimization problem that can be solved with metaheuristic algorithms. In this paper, we propose a novel multimean particle swarm optimization algorithm for multilayer feed-forward artificial neural networks training. The proposed multimean particle swarm optimization algorithm searches the solution space more efficiently with multiple swarms and finds better solutions than particle swarm optimization. To evaluate the performance of the proposed multimean particle swarm optimization algorithm, experiments are conducted on ten benchmark datasets from the UCI repository and the obtained results are compared to the results of particle swarm optimization and other previous research in the literature. The analysis of the results demonstrated that the proposed multimean particle swarm optimization algorithm performed well and it can be adopted as a novel algorithm for multilayer feed-forward artificial neural networks training. [ABSTRACT FROM AUTHOR]

Air pollution monitoring has recently become an issue of utmost importance in our society. Despite the fact that crowd sensing approaches could be an adequate solution for urban areas, they cannot be implemented in rural environments. Instead, deploying a fleet of UAVs could be considered an acceptable alternative. Embracing this approach, this paper proposes the use of UAVs equipped with off-the-shelf sensors to perform air pollution monitoring tasks. These UAVs are guided by our proposed Pollution-driven UAV Control (PdUC) algorithm, which is based on a chemotaxis metaheuristic and a local particle swarm optimization strategy. Together, they allow automatically performing the monitoring of a specified area using UAVs. Experimental results show that, when using PdUC, an implicit priority guides the construction of pollution maps by focusing on areas where the pollutants' concentration is higher. This way, accurate maps can be constructed in a faster manner when compared to other strategies. The PdUC scheme is compared against various standard mobility models through simulation, showing that it achieves better performance. In particular, it is able to find the most polluted areas with more accuracy and provides a higher coverage within the time bounds defined by the UAV flight time. [ABSTRACT FROM AUTHOR]

The Machine-Part Cell Formation Problem (MPCFP) is a NP-Hard optimization problem that consists in grouping machines and parts in a set of cells, so that each cell can operate independently and the intercell movements are minimized. This problem has largely been tackled in the literature by using different techniques ranging from classic methods such as linear programming to more modern nature-inspired metaheuristics. In this paper, we present an efficient parallel version of the Migrating Birds Optimization metaheuristic for solving the MPCFP. Migrating Birds Optimization is a population metaheuristic based on the V-Flight formation of the migrating birds, which is proven to be an effective formation in energy saving. This approach is enhanced by the smart incorporation of parallel procedures that notably improve performance of the several sorting processes performed by the metaheuristic. We perform computational experiments on 1080 benchmarks resulting from the combination of 90 well-known MPCFP instances with 12 sorting configurations with and without threads. We illustrate promising results where the proposal is able to reach the global optimum in all instances, while the solving time with respect to a nonparallel approach is notably reduced. [ABSTRACT FROM AUTHOR]

Recently, bio-inspired metaheuristic algorithms have been widely used as powerful optimization tools to estimate crucial parameters of photovoltaic (PV) models. However, the computational cost involved in terms of the time increases as data size or the complexity of the applied PV electrical model increases. Hence, to overcome these limitations, this paper presents the parallel particle swarm optimization (PPSO) algorithm implemented in Open Computing Language ( Open CL) to solve the parameter estimation problem for a wide range of PV models. Experimental and simulation results demonstrate that the PPSO algorithm not only has the capability of obtaining all the parameters with extremely high accuracy but also dramatically improves the computational speed. This is possible and is shown in this work via the inherent capabilities of the parallel processing framework. Copyright © 2015 John Wiley & Sons, Ltd. [ABSTRACT FROM AUTHOR]

All equipment must be maintained during its lifetime to ensure normal operation. Maintenance is one of the critical roles in the success of manufacturing enterprises. This paper proposed a preventive maintenance period optimization model (PMPOM) to find an optimal preventive maintenance period. By making use of the advantages of particle swarm optimization (PSO) and cuckoo search (CS) algorithm, a hybrid optimization algorithm of PSO and CS is proposed to solve the PMPOM problem. The test functions show that the proposed algorithm exhibits more outstanding performance than particle swarm optimization and cuckoo search. Experiment results show that the proposed algorithm has advantages of strong optimization ability and fast convergence speed to solve the PMPOM problem. [ABSTRACT FROM AUTHOR]