Search

This paper presents a new algorithm to solve the optimal reconfiguration problem in distribution networks, using the algorithm called Improved Simulated Annealing combined with Hybrid Cooling (ISA-HC) and Selective Space Search, which leverages the capabilities of the Open Distribution System Simulator (OpenDSS) software and the selective space search concept to enhance performance and reduce the search space. The ISA-HC algorithm determines an adequate starting point for the temperature and initial solution according to the size of the system. For adequate cooling, a three-stage cooling approach was employed to achieve effective cooling, combining two methods widely used in the literature. Overall, the ISA-HC algorithm is a promising method for solving the optimal reconfiguration problem in distribution networks. The algorithm was tested on the systems of 5, 33, 69, and 94 buses and compared to other existing methods in the literature. The results show that the proposed method is more robust and efficient, providing better convergence and reliably achieving good quality global solutions. [ABSTRACT FROM AUTHOR]

This paper introduces an innovative approach to address the distribution network reconfiguration (DNR) challenge, aiming to reduce power loss through an advanced hyperbolic tangent particle swarm optimization (HT-PSO) method. This approach is distinguished by the adoption of a novel hyperbolic tangent function, which effectively limits the rate of change values, offering a significant improvement over traditional sigmoid function-based methods. A key feature of this new approach is the integration of a tunable parameter, δ , into the HT-PSO, enhancing the curve's adaptability. The careful optimization of δ ensures superior control over the rate of change across the entire operational range. This enhanced control mechanism substantially improves the efficiency of the search and convergence processes in DNR. Comparative simulations conducted on 33- and 94-bus systems show an improvement in convergence, demonstrating a more exhaustive exploration of the search space than existing methods documented in the literature based on PSO and variations where functions are proposed for the rate of change of values. [ABSTRACT FROM AUTHOR]

Differential evolution algorithm is a very powerful and recently proposed evolutionary algorithm. Generally, only a mutation operator and predefined parameter values of differential evolution algorithm are utilized to solve various optimization problems, which limits the performance of the algorithm. In this paper, six commonly used mutation operators are divided into three categories according to their own features. A mutation pool is established based on the three categories. A parameter pool with three predefined values is designed. During evolution, three mutation operators are randomly chosen from the three categories, and three parameter values are also randomly selected from the parameter pool. The three groups of mutation operators and parameter values are employed to produce trial vectors. The proposed algorithm makes good use of different mutation operators. Three recently proposed differential evolution variants and three non-differential evolution algorithms are used to make comparisons on the 29 testing functions from CEC. The experimental results have demonstrated that the proposed algorithm is very competitive. The proposed algorithm is utilized to solve three real applications, and the results are superior. [ABSTRACT FROM AUTHOR]

Inspired by the migration and reproduction of species in nature to explore suitable habitats, this paper proposed a new swarm intelligence algorithm called the Migration and Reproduction Algorithm (MARA). This new algorithm discusses how to transform the behavior of an organism looking for a suitable habitat into a mathematical model, which can solve optimization problems. MARA has some common features with other optimization methods such as particle swarm optimization (PSO) and the fireworks algorithm (FWA), which means MARA can also solve the optimization problems that PSO and FWA are used to, namely, high-dimensional optimization problems. MARA also has some unique features among biology-based optimization methods. In this paper, we articulated the structure of MARA by correlating it with natural biogeography; then, we demonstrated the performance of MARA on sets of 12 benchmark functions. In the end, we applied it to optimize a practical problem of power dispatching in a multi-microgrid system that proved it has certain value in practical applications. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) is the underlying technology that has enabled connecting daily apparatus to the Internet and enjoying the facilities of smart services. IoT marketing is experiencing an impressive 16.7% growth rate and is a nearly USD 300.3 billion market. These eye-catching figures have made it an attractive playground for cybercriminals. IoT devices are built using resource-constrained architecture to offer compact sizes and competitive prices. As a result, integrating sophisticated cybersecurity features is beyond the scope of the computational capabilities of IoT. All of these have contributed to a surge in IoT intrusion. This paper presents an LSTM-based Intrusion Detection System (IDS) with a Dynamic Access Control (DAC) algorithm that not only detects but also defends against intrusion. This novel approach has achieved an impressive 97.16% validation accuracy. Unlike most of the IDSs, the model of the proposed IDS has been selected and optimized through mathematical analysis. Additionally, it boasts the ability to identify a wider range of threats (14 to be exact) compared to other IDS solutions, translating to enhanced security. Furthermore, it has been fine-tuned to strike a balance between accurately flagging threats and minimizing false alarms. Its impressive performance metrics (precision, recall, and F1 score all hovering around 97%) showcase the potential of this innovative IDS to elevate IoT security. The proposed IDS boasts an impressive detection rate, exceeding 98%. This high accuracy instills confidence in its reliability. Furthermore, its lightning-fast response time, averaging under 1.2 s, positions it among the fastest intrusion detection systems available. [ABSTRACT FROM AUTHOR]

This paper proposes a new time-respecting graph (TRG) representation for contact sequence temporal graphs. Our representation is more memory-efficient than previously proposed representations and has run-time advantages over the ordered sequence of edges (OSE) representation, which is faster than other known representations. While our proposed representation clearly outperforms the OSE representation for shallow neighborhood search problems, it is not evident that it does so for different problems. We demonstrate the competitiveness of our TRG representation for the single-source all-destinations fastest, min-hop, shortest, and foremost paths problems. [ABSTRACT FROM AUTHOR]

In numerous scientific disciplines and practical applications, addressing optimization challenges is a common imperative. Nature-inspired optimization algorithms represent a highly valuable and pragmatic approach to tackling these complexities. This paper introduces Dendritic Growth Optimization (DGO), a novel algorithm inspired by natural branching patterns. DGO offers a novel solution for intricate optimization problems and demonstrates its efficiency in exploring diverse solution spaces. The algorithm has been extensively tested with a suite of machine learning algorithms, deep learning algorithms, and metaheuristic algorithms, and the results, both before and after optimization, unequivocally support the proposed algorithm's feasibility, effectiveness, and generalizability. Through empirical validation using established datasets like diabetes and breast cancer, the algorithm consistently enhances model performance across various domains. Beyond its working and experimental analysis, DGO's wide-ranging applications in machine learning, logistics, and engineering for solving real-world problems have been highlighted. The study also considers the challenges and practical implications of implementing DGO in multiple scenarios. As optimization remains crucial in research and industry, DGO emerges as a promising avenue for innovation and problem solving. [ABSTRACT FROM AUTHOR]

Population-based metaheuristics can be seen as a set of agents that smartly explore the space of solutions of a given optimization problem. These agents are commonly governed by movement operators that decide how the exploration is driven. Although metaheuristics have successfully been used for more than 20 years, performing rapid and high-quality parameter control is still a main concern. For instance, deciding the proper population size yielding a good balance between quality of results and computing time is constantly a hard task, even more so in the presence of an unexplored optimization problem. In this paper, we propose a self-adaptive strategy based on the on-line population balance, which aims for improvements in the performance and search process on population-based algorithms. The design behind the proposed approach relies on three different components. Firstly, an optimization-based component which defines all metaheuristic tasks related to carry out the resolution of the optimization problems. Secondly, a learning-based component focused on transforming dynamic data into knowledge in order to influence the search in the solution space. Thirdly, a probabilistic-based selector component is designed to dynamically adjust the population. We illustrate an extensive experimental process on large instance sets from three well-known discrete optimization problems: Manufacturing Cell Design Problem, Set covering Problem, and Multidimensional Knapsack Problem. The proposed approach is able to compete against classic, autonomous, as well as IRace-tuned metaheuristics, yielding interesting results and potential future work regarding dynamically adjusting the number of solutions interacting on different times within the search process. [ABSTRACT FROM AUTHOR]

Metaheuristic optimization algorithms (MHA) play a significant role in obtaining the best (optimal) values of the system's parameters to improve its performance. This role is significantly apparent when dealing with systems where the classical analytical methods fail. Fractional-order (FO) systems have not yet shown an easy procedure to deal with the determination of their optimal parameters through traditional methods. In this paper, a recent, systematic. And comprehensive review is presented to highlight the role of MHA in obtaining the best set of gains and orders for FO controllers. The systematic review starts by exploring the most relevant publications related to the MHA and the FO controllers. The study is focused on the most popular controllers such as the FO-PI, FO-PID, FO Type-1 fuzzy-PID, and FO Type-2 fuzzy-PID. The time domain is restricted in the articles published through the last decade (2014:2023) in the most reputed databases such as Scopus, Web of Science, Science Direct, and Google Scholar. The identified number of papers, from the entire databases, has reached 850 articles. A Preferred Reporting Items for Systematic Reviews and Meta-Analyses (PRISMA) methodology was applied to the initial set of articles to be screened and filtered to end up with a final list that contains 82 articles. Then, a thorough and comprehensive study was applied to the final list. The results showed that Particle Swarm Optimization (PSO) is the most attractive optimizer to the researchers to be used in the optimal parameters identification of the FO controllers as it attains about 25% of the published papers. In addition, the papers that used PSO as an optimizer have gained a high citation number despite the fact that the Chaotic Atom Search Optimization (ChASO) is the highest one, but it is used only once. Furthermore, the Integral of the Time-Weighted Absolute Error (ITAE) is the best nominated cost function. Based on our comprehensive literature review, this appears to be the first review paper that systematically and comprehensively addresses the optimization of the parameters of the fractional-order PI, PID, Type-1, and Type-2 fuzzy controllers with the use of MHAs. Therefore, the work in this paper can be used as a guide for researchers who are interested in working in this field. [ABSTRACT FROM AUTHOR]

The slime mould algorithm (SMA) is a new swarm intelligence algorithm inspired by the oscillatory behavior of slime moulds during foraging. Numerous researchers have widely applied the SMA and its variants in various domains in the field and proved its value by conducting various literatures. In this paper, a comprehensive review of the SMA is introduced, which is based on 130 articles obtained from Google Scholar between 2022 and 2023. In this study, firstly, the SMA theory is described. Secondly, the improved SMA variants are provided and categorized according to the approach used to apply them. Finally, we also discuss the main applications domains of the SMA, such as engineering optimization, energy optimization, machine learning, network, scheduling optimization, and image segmentation. This review presents some research suggestions for researchers interested in this algorithm, such as conducting additional research on multi-objective and discrete SMAs and extending this to neural networks and extreme learning machining. [ABSTRACT FROM AUTHOR]

Clean and renewable energy is the only way to achieve sustainable energy development, with considerable social and economic benefits. As a key technology for clean and renewable energy, it is very important to research the reliability optimization of microgrids. This paper reviews the research progress in microgrid reliability optimization. This paper first classifies and summarizes the existing research on microgrid control strategies and reliability assessment. Then, the system reliability optimization framework is summarized in terms of both microgrid systems and optimization objectives. Next, we summarize the most commonly used optimization algorithms for microgrid reliability for different microgrid systems. Finally, we provide a bibliometric analysis of the literature on the reliability research of microgrids. In addition, we propose some research challenges in the future for the reliability of microgrids. [ABSTRACT FROM AUTHOR]

The Internet of Things (IoT) has been an area of growing research interest for decades. Task allocation is an important problem for the optimized operation of Internet-of-Things networks. This paper provides an overview of recent research in the field of Internet-of-Things task allocation optimization. First, the task allocation problem for the IoT itself is analyzed and divided into distinct sub-problem categories, such as deployment optimization, static or dynamic optimization as well as single- or multi-objective optimization. Following that, the commonly used optimization objectives are explained. Various recent works in the field of task allocation optimization are then summarized and catalogued according to the problem categories. Finally, the paper concludes with a qualitative analysis of the categorized approaches and a description of open problems and highlights promising directions for future research. [ABSTRACT FROM AUTHOR]

Many analog neural network approaches for sparse recovery were based on using ℓ 1 -norm as the surrogate of ℓ 0 -norm. This paper proposes an analog neural network model, namely the Lagrange programming neural network with ℓ p objective and quadratic constraint (LPNN-LPQC), with an ℓ 0 -norm sparsity measurement for solving the constrained basis pursuit denoise (CBPDN) problem. As the ℓ 0 -norm is non-differentiable, we first use a differentiable ℓ p -norm-like function to approximate the ℓ 0 -norm. However, this ℓ p -norm-like function does not have an explicit expression and, thus, we use the locally competitive algorithm (LCA) concept to handle the nonexistence of the explicit expression. With the LCA approach, the dynamics are defined by the internal state vector. In the proposed model, the thresholding elements are not conventional analog elements in analog optimization. This paper also proposes a circuit realization for the thresholding elements. In the theoretical side, we prove that the equilibrium points of our proposed method satisfy Karush Kuhn Tucker (KKT) conditions of the approximated CBPDN problem, and that the equilibrium points of our proposed method are asymptotically stable. We perform a large scale simulation on various algorithms and analog models. Simulation results show that the proposed algorithm is better than or comparable to several state-of-art numerical algorithms, and that it is better than state-of-art analog neural models. [ABSTRACT FROM AUTHOR]

Differential evolution (DE) is a proficient optimizer and has been broadly implemented in real life applications of various fields. Several mutation based adaptive approaches have been suggested to improve the algorithm efficiency in recent years. In this paper, a novel self-adaptive method called SaMDE has been designed and implemented on the mutation-based modified DE variants such as modified randomized localization-based DE (MRLDE), donor mutation based DE (DNDE), and sequential parabolic interpolation based DE (SPIDE), which were proposed by the authors in previous research. Using the proposed adaptive technique, an appropriate mutation strategy from DNDE and SPIDE can be selected automatically for the MRLDE algorithm. The experimental results on 50 benchmark problems taken of various test suits and a real-world application of minimization of the potential molecular energy problem validate the superiority of SaMDE over other DE variations. [ABSTRACT FROM AUTHOR]

The popularity of video services such as video call or video on-demand has made it impossible for people to live without them in their daily lives. It can be anticipated that the explosive growth of vehicular communication owing to the widespread use of in-vehicle video infotainment applications in the future will result in increasing fragmentation and congestion of the wireless transmission spectrum. Accordingly, effective bandwidth management algorithms are demanded to achieve efficient communication and stable scalability in next-generation vehicular networks. To the best of our current knowledge, a noticeable gap remains in the existing literature regarding the application of the latest advancements in network communication technologies. Specifically, this gap is evident in the lack of exploration regarding how cutting-edge technologies can be effectively employed to optimize bandwidth allocation, especially in the realm of video service applications within the forthcoming vehicular networks. In light of this void, this paper presents a seamless integration of cutting-edge 6G communication technologies, such as terahertz (THz) and visible light communication (VLC), with the existing 5G millimeter-wave and sub-6 GHz base stations. This integration facilitates the creation of a network environment characterized by high transmission rates and extensive coverage. Our primary aim is to ensure the uninterrupted playback of real-time video applications for vehicle users. These video applications encompass video conferencing, live video, and on-demand video services. The outcomes of our simulations convincingly indicate that the proposed strategy adeptly addresses the challenge of bandwidth competition among vehicle users. Moreover, it notably boosts the efficient utilization of bandwidth from less crowded base stations, optimizes the fulfillment of bandwidth prerequisites for various video applications, and elevates the overall video quality experienced by users. Consequently, our findings serve as a successful validation of the practicality and effectiveness of the proposed methodology. [ABSTRACT FROM AUTHOR]

In this paper, a hybrid nature-inspired metaheuristic algorithm based on the Genetic Algorithm and the African Buffalo Optimization is proposed. The hybrid approach adaptively switches between the Genetic Algorithm and the African Buffalo Optimization during the optimization process, leveraging their respective strengths to improve performance. To improve randomness, the hybrid approach uses two high-quality pseudorandom number generators—the 64-bit and 32-bit versions of the SIMD-Oriented Fast Mersenne Twister. The effectiveness of the hybrid algorithm is evaluated on the NP-hard Container Relocation Problem, focusing on a test set of restricted Container Relocation Problems with higher complexity. The results show that the hybrid algorithm outperforms the individual Genetic Algorithm and the African Buffalo Optimization, which use standard pseudorandom number generators. The adaptive switch method allows the algorithm to adapt to different optimization problems and mitigate problems such as premature convergence and local optima. Moreover, the importance of pseudorandom number generator selection in metaheuristic algorithms is highlighted, as it directly affects the optimization results. The use of powerful pseudorandom number generators reduces the probability of premature convergence and local optima, leading to better optimization results. Overall, the research demonstrates the potential of hybrid metaheuristic approaches for solving complex optimization problems, which makes them relevant for scientific research and practical applications. [ABSTRACT FROM AUTHOR]

This paper presents the minimization of total harmonic distortion in a seven-level cascaded H-bridge multilevel inverter with resistive load using the teaching–learning-based optimization algorithm. The minimization of Total Harmonic Distortion (THD)is a challenging optimization problem due to the fact that nonlinear equations are involved. Recently, bio-inspired algorithms have become very popular approaches to solving various optimization problems in different areas of engineering. For this reason, the results obtained with the Teaching–Learning-Based Optimization (TLBO)algorithm were compared with three other popular bio-inspired algorithms, the genetic algorithm, differential evolution, and particle swarm optimization. The comparative analysis, conducted by sweeping the modulation index, made it possible to obtain graphs and data on the behavior of the four analyzed algorithms. Finally, it was concluded that the TLBO algorithm is very effective and is able to solve the THD-minimization problem. Its main advantage over the other algorithms is the fact that it does not require control parameters for its correct operation in the solution of the problem. [ABSTRACT FROM AUTHOR]

This article considers a box-constrained global optimization problem for Lipschitz continuous functions with an unknown Lipschitz constant. The well-known derivative-free global search algorithm DIRECT (DIvide RECTangle) is a promising approach for such problems. Several studies have shown that recent two-step (global and local) Pareto selection-based algorithms are very efficient among all DIRECT-type approaches. However, despite its encouraging performance, it was also observed that the candidate selection procedure has two possible shortcomings. First, there is no limit on how small the size of selected candidates can be. Secondly, a balancing strategy between global and local candidate selection is missing. Therefore, it may waste function evaluations by over-exploring the current local minimum and delaying finding the global one. This paper reviews and employs different strategies in a two-step Pareto selection framework (1-DTC-GL) to overcome these limitations. A detailed experimental study has revealed that existing strategies do not always improve and sometimes even worsen results. Since 1-DTC-GL is a DIRECT-type algorithm, the results of this paper provide general guidance for all DIRECT-type algorithms on how to deal with excessive local refinement more efficiently. [ABSTRACT FROM AUTHOR]

In many disciplines, including pattern recognition, data mining, machine learning, image analysis, and bioinformatics, data clustering is a common analytical tool for data statistics. The majority of conventional clustering techniques are slow to converge and frequently get stuck in local optima. In this regard, population-based meta-heuristic algorithms are used to overcome the problem of getting trapped in local optima and increase the convergence speed. An asymmetric approach to clustering the asymmetric self-organizing map is proposed in this paper. The Interactive Autodidactic School (IAS) is one of these population-based metaheuristic and asymmetry algorithms used to solve the clustering problem. The chaotic IAS algorithm also increases exploitation and generates a better population. In the proposed model, ten different chaotic maps and the intra-cluster summation fitness function have been used to improve the results of the IAS. According to the simulation findings, the IAS based on the Chebyshev chaotic function outperformed other chaotic IAS iterations and other metaheuristic algorithms. The efficacy of the proposed model is finally highlighted by comparing its performance with optimization algorithms in terms of fitness function and convergence rate. This algorithm can be used in different engineering problems as well. Moreover, the Binary IAS (BIAS) detects coronavirus disease 2019 (COVID-19). The results demonstrate that the accuracy of BIAS for the COVID-19 dataset is 96.25%. [ABSTRACT FROM AUTHOR]

According to the World Health Organization, cancer is a worldwide health problem. Its high mortality rate motivates scientists to study new treatments. One of these new treatments is hyperthermia using magnetic nanoparticles. This treatment consists in submitting the target region with a low-frequency magnetic field to increase its temperature over 43 °C, as the threshold for tissue damage and leading the cells to necrosis. This paper uses an in silico three-dimensional Pennes' model described by a set of partial differential equations (PDEs) to estimate the percentage of tissue damage due to hyperthermia. Differential evolution, an optimization method, suggests the best locations to inject the nanoparticles to maximize tumor cell death and minimize damage to healthy tissue. Three different scenarios were performed to evaluate the suggestions obtained by the optimization method. The results indicate the positive impact of the proposed technique: a reduction in the percentage of healthy tissue damage and the complete damage of the tumors were observed. In the best scenario, the optimization method was responsible for decreasing the healthy tissue damage by 59 % when the nanoparticles injection sites were located in the non-intuitive points indicated by the optimization method. The numerical solution of the PDEs is computationally expensive. This work also describes the implemented parallel strategy based on CUDA to reduce the computational costs involved in the PDEs resolution. Compared to the sequential version executed on the CPU, the proposed parallel implementation was able to speed the execution time up to 84.4 times. [ABSTRACT FROM AUTHOR]

Simple Summary: Breast Cancer Detection being an area of importance in detecting it in early stages and to assist the Oncologists in analyzing the stage and mode of further treatment, it gains equal importance to all types of cancer detection. Using the proposed optimization based machine learning model in detection process is supposed to help the patients and the oncologists in deciding further process. In recent years, breast cancer detection is an important area of concentration towards curative image dispensation and exploration. Detection of a disease at an early stage is an important factor in taking it to the next level of treatment. Accuracy plays an important role in the detection of disease. COA-T2FCM (Chimp Optimization Algorithm Based Type-2 Intuitionistic Fuzzy C-Means Clustering) is constructed for detection of such malignancy with the highest accuracy in this paper. The proposed detection process is designed with the combination of type-2 intuitionistic fuzzy c-means clustering in addition to oppositional function. In the type-2 intuitionistic fuzzy c-means clustering, the efficient cluster center can be preferred using the chimp optimization algorithm. Initially, the objective function of the type-2 intuitionistic fuzzy c-means clustering is considered. The chimp optimization algorithm is utilized to optimize the cluster center and fuzzifier in the clustering method. The projected technique is implemented, and in addition, performance metrics such as specificity, sensitivity, accuracy, Jaccard Similarity Index (JSI), and Dice Similarity Coefficient (DSC) are assessed. The projected technique is compared with the conventional technique such as fuzzy c means clustering and k mean clustering methods. The resulting method was also compared with existing methods to ensure the accuracy in the proposed method. The proposed algorithm is tested for its effectiveness on the mammogram images of the three different datasets collected from the Mini–Mammographic Image Analysis Society (Mini–MIAS), the Digital Database for Screening Mammography (DDSM), and Inbreast. The accuracy and Jaccard index score are generally used to measure the similarity between the proposed output and the actual cancer affected regions from the image considered. On an average the proposed method achieved an accuracy of 97.29% and JSI of 95% [ABSTRACT FROM AUTHOR]

Optimization problems are prevalent in almost all areas and hence optimization algorithms are crucial for a myriad of real-world applications. Deterministic optimization algorithms tend to be computationally costly and time-consuming. Hence, heuristic and metaheuristic algorithms are more favoured as they provide near-optimal solutions in an acceptable amount of time. Swarm intelligence algorithms are being increasingly used for optimization problems owing to their simplicity and good performance. The Dragonfly Algorithm (DA) is one which is inspired by the swarming behaviours of dragonflies, and it has been proven to have a superior performance than other algorithms in multiple applications. Hence, it is worth considering its application to the traveling salesman problem which is a predominant discrete optimization problem. The original DA is only suitable for solving continuous optimization problems and, although there is a binary version of the algorithm, it is not easily adapted for solving discrete optimization problems like TSP. We have previously proposed a discrete adapted DA algorithm suitable for TSP. However, it has low effectiveness, and it has not been used for large TSP problems. In this paper, we propose an optimized discrete adapted DA by using the steepest ascent hill climbing algorithm as a local search. The algorithm is applied to a TSP problem modelling a package delivery system in the Kuala Lumpur area and to benchmark TSP problems, and it is found to have a higher effectiveness than the discrete adapted DA and some other swarm intelligence algorithms. It also has a higher efficiency than the discrete adapted DA. [ABSTRACT FROM AUTHOR]

This paper presents the application of heterogeneous transfer learning (HetTL) methods which consider hybrid feature selection to reduce the training calibration effort and the noise generated by fingerprint duplicates obtained from multiple Wi-Fi access points. The Cramer–Rao Lower Bound analysis (CRLB) was also applied to evaluate and estimate a lower limit for the variance of a parameter estimator used to analyze positioning performance. We developed two novel algorithms for feature selection in fingerprint-based indoor positioning problems (IPP) to enhance positioning performance in the target domain with the HetTL. The algorithms comprised two scenarios: (i) a principal component analysis-based approach (PCA-based) and (ii) a hybrid approach that takes both PCA and correlation effect analysis into account (hybrid scenario). Accordingly, a new feature vector was constructed by retaining only the most significant predictors, and the most efficient feature dimensions were also determined by using a hybrid-based approach. Experimental results showed that the hybrid-based proposed algorithm has the minimum mean absolute error. The CRLB analysis also showed that the number of Wi-Fi access points could affect the lower bound location estimation error; however, identifying the most significant predictors is an effective approach to improve positioning performance. [ABSTRACT FROM AUTHOR]

Impedance spectroscopy has became an essential non-invasive tool for quality assessment measurements of the biochemical and biophysical changes in plant tissues. The electrical behaviour of biological tissues can be captured by fitting its bio-impedance data to a suitable circuit model. This paper investigates the use of power-law filters in circuit modelling of bio-impedance. The proposed models are fitted to experimental data obtained from eight different fruit types using a meta-heuristic optimization method (the Water Cycle Algorithm (WCA)). Impedance measurements are obtained using a Biologic SP150 electrochemical station, and the percentage error between the actual impedance and the fitted models' impedance are reported. It is found that a circuit model consisting of a combination of two second-order power-law low-pass filters shows the least fitting error. [ABSTRACT FROM AUTHOR]

In this paper, we present a design method for a wideband non-uniformly spaced linear array (NUSLA), with both symmetric and asymmetric geometries, using the modified reinforcement learning algorithm (MORELA). We designed a cost function that provided freedom to the beam pattern by setting limits only on the beam width (BW) and side-lobe level (SLL) in order to satisfy the desired BW and SLL in the wide band. We added the scan angle condition to the cost function to design the scanned beam pattern, as the ability to scan a beam in the desired direction is important in various applications. In order to prevent possible pointing angle errors for asymmetric NUSLA, we employed a penalty function to ensure the peak at the desired direction. Modified reinforcement learning algorithm (MORELA), which is a reinforcement learning-based algorithm used to determine a global optimum of the cost function, is applied to optimize the spacing and weights of the NUSLA by minimizing the proposed cost function. The performance of the proposed scheme was verified by comparing it with that of existing heuristic optimization algorithms via computer simulations. [ABSTRACT FROM AUTHOR]

The optimal allocation of protective devices is a serious issue in an electrical power system; in order to reduce the possibility of faults, the protection devices should be optimally placed. The paper presents a continuous genetic algorithm (CGA) for the optimal allocation of directional relays for the efficient energy minimization in a radial distribution system (DG). The algorithm is flexible to use for the changes and improvements in the optimal location for a DG unit and can optimize the energy consumption in the radial distribution system. The proposed algorithm has been implemented on IEEE 33 and 69-bus system using MATLAB (R2014b, MathWorks). Low energy consumption is a common design objective in an energy-constrained distribution system. Engineers, power utilities, and network operators can profit from the proposed methodology to enhance the use of DG in distribution networks. [ABSTRACT FROM AUTHOR]

Many metaheuristic approaches are inherently stochastic. In order to compare such methods, statistical tests are needed. However, choosing an appropriate test is not trivial, given that each test has some assumptions about the distribution of the underlying data that must be true before it can be used. Permutation tests (P-Tests) are statistical tests with minimal number of assumptions. These tests are simple, intuitive and nonparametric. In this paper, we argue researchers in the field of metaheuristics to adopt P-Tests to compare their algorithms. We define two statistic tests and then present an algorithm that uses them to compute the p-value. The proposed process is used to compare 5 metaheuristic algorithms on 10 benchmark functions. The resulting p-values are compared with the p-values of two widely used statistical tests. The results show that the proposed P-test is generally consistent with the classical tests, but more conservative in few cases. [ABSTRACT FROM AUTHOR]

Cell-free massive Multi-input Multi-output (MIMO) can offer higher spectral efficiency compared with cellular massive MIMO by providing services to users through the collaboration of distributed APs, and cell-free massive MIMO systems with distributed operations are attracting a great deal of industry attention due to their simplicity and ease of deployment. This paper aims to find an optimal solution for energy efficiency in the downlink operation in the Industrial Internet based on cell-free massive MIMO systems with distributed operations. A system model is proposed, and a theoretical analysis on energy efficiency is presented. The optimization problem of efficient downlink operation is formulated as a mixed-integer nonlinear programming (MINLP) problem, which is further decomposed into two sub-problems, i.e., maximizing the sum-rate of the downlink transmission and optimizing the total energy consumption. The two sub-problems are addressed via AP selection and power allocation, respectively. The simulation results demonstrate that our algorithms can significantly improve the energy efficiency with low computational complexity in comparison with traditional distributed cell-free massive MIMO. Even in the presence of pilot contamination, the proposed algorithms can still provide significant energy efficiency when a large number of IoTDs are connected. [ABSTRACT FROM AUTHOR]

Data clustering is a complex data mining problem that clusters a massive amount of data objects into a predefined number of clusters; in other words, it finds symmetric and asymmetric objects. Various optimization methods have been used to solve different machine learning problems. They usually suffer from local optimal problems and unbalance between the search mechanisms. This paper proposes a novel hybrid optimization method for solving various optimization problems. The proposed method is called HRSA, which combines the original Reptile Search Algorithm (RSA) and Remora Optimization Algorithm (ROA) and handles these mechanisms' search processes by a novel transition method. The proposed HRSA method aims to avoid the main weaknesses raised by the original methods and find better solutions. The proposed HRSA is tested on solving various complicated optimization problems—twenty-three benchmark test functions and eight data clustering problems. The obtained results illustrate that the proposed HRSA method performs significantly better than the original and comparative state-of-the-art methods. The proposed method overwhelmed all the comparative methods according to the mathematical problems. It obtained promising results in solving the clustering problems. Thus, HRSA has a remarkable efficacy when employed for various clustering problems. [ABSTRACT FROM AUTHOR]

Currently, wireless body area networks (WBANs) are effectively used for health monitoring services. However, in cases where WBANs are densely deployed, interference among WBANs can cause serious degradation of network performance and reliability. Inter-WBAN interference can be reduced by scheduling the communication links of interfering WBANs. In this paper, we propose an interference-aware traffic-priority-based link scheduling (ITLS) algorithm to overcome inter-WBAN interference in densely deployed WBANs. First, we model a network with multiple WBANs as an interference graph where node-level interference and traffic priority are taken into account. Second, we formulate link scheduling for multiple WBANs as an optimization model where the objective is to maximize the throughput of the entire network while ensuring the traffic priority of sensor nodes. Finally, we propose the ITLS algorithm for multiple WBANs on the basis of the optimization model. High spatial reuse is also achieved in the proposed ITLS algorithm. The proposed ITLS achieves high spatial reuse while considering traffic priority, packet length, and the number of interfered sensor nodes. Our simulation results show that the proposed ITLS significantly increases spatial reuse and network throughput with lower delay by mitigating inter-WBAN interference. [ABSTRACT FROM AUTHOR]

As higher performance is demanded in 5G networks, energy consumption in wireless networks increases along with the advances of various technologies, so enhancing energy efficiency also becomes an important goal to implement 5G wireless networks. In this paper, we study the energy efficiency maximization problem focused on finding a suitable set of turned-on small cell access points (APs). Finding the suitable on/off states of APs is challenging since the APs can be deployed by users while centralized network planning is not always possible. Therefore, when APs in small cells are randomly deployed and thus redundant in many cases, a mechanism of dynamic AP turning-on/off is required. We propose a device-assisted framework that exploits feedback messages from the user equipment (UE). To solve the problem, we apply an optimization method using belief propagation (BP) on a factor graph. Then, we propose a family of online algorithms inspired by BP, called DANCE, that requires low computational complexity. We perform numerical simulations, and the extensive simulations confirm that BP enhances energy efficiency significantly. Furthermore, simple, but practical DANCE exhibits close performance to BP and also better performance than other popular existing methods. Specifically, in a small-sized network, BP enhances energy efficiency 129%. Furthermore, in ultra-dense networks, DANCE algorithms successfully achieve orders of magnitude higher energy efficiency than that of the baseline. [ABSTRACT FROM AUTHOR]

Many installed solar thermally driven cooling systems suffer from high auxiliary electric energy consumption which makes them not more efficient than conventional compression cooling systems. A main reason for this is the use of non-efficient controls with constant set points that do not allow a chiller power modulation at partial-load and therefore lead to unnecessary high power consumption of the parasitics. The aims of this paper are to present a method to control efficiently solar thermally driven chillers, to demonstrate experimentally its applicability and to quantify the benefits. It has been shown that the cooling capacity of a diffusion absorption chiller can be modulated very effectively by adjusting both the temperature and the flow rate of the cooling water. With the developed approach and the use of optimization algorithms, both the temperature and the flow rate can be controlled simultaneously in a way that the cooling load is matched and the electricity consumption is minimized. Depending on the weather and operating conditions, electricity savings between 20% and 60% can be achieved compared to other tested control approaches. The highest savings are obtained when the chiller is operated at partial load. The presented method is not restricted to solar cooling systems and can also be applied to other conventional heating ventilation and air conditioning (HVAC) systems. [ABSTRACT FROM AUTHOR]

In recent years, many researchers have utilized metaheuristic optimization algorithms along with fuzzy logic theory in their studies for various purposes. The harmony search (HS) algorithm is one of the metaheuristic optimization algorithms that is widely employed in different studies along with fuzzy logic (FL) theory. FL theory is a mathematical approach to expressing uncertainty by applying the conceptualization of fuzziness in a system. This review paper presents an extensive review of published papers based on the combination of HS and FL systems. In this regard, the functional characteristics of models obtained from integration of FL and HS have been reported in various articles, and the performance of each study is investigated. The basic concept of the FL approach and its derived models are introduced to familiarize readers with the principal mechanisms of FL models. Moreover, appropriate descriptions of the primary classifications acquired from the coexistence of FL and HS methods for specific purposes are reviewed. The results show that the high efficiency of HS to improve the exploration of FL in achieving the optimal solution on the one hand, and the capability of fuzzy inference systems to provide more flexible and dynamic adaptation of the HS parameters based on human perception on the other hand, can be a powerful combination for solving optimization problems. This review paper is believed to be a useful resource for students, engineers, and professionals. [ABSTRACT FROM AUTHOR]

Service-oriented architecture (SOA) has emerged as a flexible software design style. SOA focuses on the development, use, and reuse of small, self-contained, independent blocks of code called web services that communicate over the network to perform a certain set of simple tasks. Web services are integrated as composite services to offer complex tasks and to provide the expected services and behavior in addition to fulfilling the clients' requests according to the service-level agreement (SLA). Web service selection and composition problems have been a significant area of research to provide the expected quality of service (QoS) and to meet the clients' expectations. This research paper presents a hybrid web service composition model to solve web service selection and composition problems and to optimize web services' resource utilization using k-means clustering and knapsack algorithms. The proposed model aims to maximize the service compositions' QoS and minimize the number of web services integrated within the service composition using the knapsack algorithm. Additionally, this paper aims to track the service compositions' QoS attributes by evaluating and tracking the web services' QoS using the reward function and, accordingly, use the k-means algorithm to decide to which cluster the web service belongs. The experimental results on a real dataset show the superiority and effectiveness of the proposed algorithm in comparison with the results of the state–action–reward–state–action (SARSA) and multistage forward search (MFS) algorithms. The experimental results show that the proposed model reduces the average time of the web service selection and composition processes to 37.02 s in comparison to 47.03 s for the SARSA algorithm and 42.72 s for the MFS algorithm. Furthermore, the average of web services' resource utilization results increased by 4.68% using the proposed model in comparison to the resource utilization by the SARSA and MFS algorithms. In addition, the experimental results showed that the average number of service compositions using the proposed model improved by 26.04% compared with the SARSA and MFS algorithms. [ABSTRACT FROM AUTHOR]

Fuzzy goal programming has important applications in many areas of supply chain, logistics, transportation and shipping business. Business management has complications, and there exist many interactions between the factors of its components. The locomotive of world trade is maritime transport and approximately 90% of the products in the world are transported by sea. Optimization of maritime operations is a challenge in order to provide technical, operational and financial benefits. Fuzzy goal programming models attract interests of many scholars, therefore the objective of this paper is to investigate the problem of minimization of total cost and minimization of loss or damage of containers returned from destination port. There are various types of fuzzy goal programming problems based on models and solution methods. This paper employs fuzzy goal programming with triangular fuzzy numbers, membership functions, constraints, assumptions as well as the variables and parameters for optimizing the solution of the model problem. The proposed model presents the mathematical algorithm, and reveals the optimal solution according to satisfaction rank from 0 to 1. Providing a theoretical background, this study offers novel ideas to researchers, decision makers and authorities. [ABSTRACT FROM AUTHOR]

This paper considers the contribution of independent owners (IOs) operating within microgrids (MGs) toward green power generation in deregulated energy markets. An optimization scheme is introduced for sizing distributed renewable generation (DRG) and a distributed energy storage system (DESS) based on a novel energy management system (EMS) that accounts for demand response (DR), DESS dispatch and performance degradation, dynamic pricing environments, power distribution loss and irregular renewable generation. The proposed EMS utilizes an iterative Newton-Raphson linear programming algorithm that schedules resources in order to minimize the objective function, to deal with the complicated nonlinear nature of the problem and to enable efficient long-term assessments. The EMS is used to evaluate candidate solutions that are generated by a genetic algorithm (GA) to determine the optimal combination of DRG and DESS. A case study for IEEE 34-bus distribution MG in Okinawa, Japan, is used for testing the algorithm and analyzing the potential for IO/MG investments and their strategies. [ABSTRACT FROM AUTHOR]

Wireless sensor networks (WSNs) can gather in situ real data measurements and work unattended for long periods, even in remote, rough places. A critical aspect of WSN design is node placement, as this determines sensing capacities, network connectivity, network lifetime and, in short, the whole operational capabilities of the WSN. This paper proposes and studies a new node placement algorithm that focus on these aspects. As a motivating example, we consider a network designed to describe the distribution of helium-3 (³He), a potential enabling element for fusion reactors, on the Moon. ³He is abundant on the Moon's surface, and knowledge of its distribution is essential for future harvesting purposes. Previous data are inconclusive, and there is general agreement that on-site measurements, obtained over a long time period, are necessary to better understand the mechanisms involved in the distribution of this element on the Moon. Although a mission of this type is extremely complex, it allows us to illustrate the main challenges involved in a multi-objective WSN placement problem, i.e., selection of optimal observation sites and maximization of the lifetime of the network. To tackle optimization, we use a recent adaptation of the ant colony optimization (ACOℝ) metaheuristic, extended to continuous domains. Solutions are provided in the form of a Pareto frontier that shows the optimal equilibria. Moreover, we compared our scheme with the four-directional placement (FDP) heuristic, which was outperformed in all cases. [ABSTRACT FROM AUTHOR]

Temperature sensors with a communication capability can help monitor and report temperature values to a control station, which enables dynamic and real-time evacuation paths in fire emergencies. As compared to traditional approaches that identify a one-shot fire evacuation path, in this paper, we develop an intelligent algorithm that can identify time-aware and temperature-aware fire evacuation paths by considering temperature changes at different time slots in multi-story and multi-exit buildings. We first propose a method that can map three-dimensional multi-story multi-exit buildings into a two-dimensional graph. Then, a mathematical optimization model is proposed to capture this time-aware and temperature-aware evacuation path problem in multi-story multi-exit buildings. Six fire evacuation algorithms (BFS, SP, DBFS, TABFS, TASP and TADBFS) are proposed to identify the efficient evacuation path. The first three algorithms that do not address human temperature limit constraints can be used by rescue robots or firemen with fire-proof suits. The last three algorithms that address human temperature limit constraints can be used by evacuees in terms of total time slots and total temperature on the evacuation path. In the computational experiments, the open space building and the Taipei 101 Shopping Mall are all tested to verify the solution quality of these six algorithms. From the computational results, TABFS, TASP and TADBF identify almost the same evacuation path in open space building and the Taipei 101 Shopping Mall. BFS, SP DBFS can locate marginally better results in terms of evacuation time and total temperature on the evacuation path. When considering evacuating a group of evacuees, the computational time of the evacuation algorithm is very important in a time-limited evacuation process. Considering the extreme case of seven fires in eight emergency exits in the Taipei 101 Shopping Mall, the golden window for evacuation is 15 time slots. Only TABFS and TADBFS are applicable to evacuate 1200 people in the Taipei 101 Shopping Mall when one time slot is setting as one minute. The computational results show that the capacity limit for the Taipei 101 Shopping Mall is 800 people in the extreme case of seven fires. In this case, when the number of people in the building is less than 700, TADBFS should be adopted. When the number of people in the building is greater than 700, TABFS can evacuate more people than TADBFS. Besides identifying an efficient evacuation path, another significant contribution of this paper is to identify the best sensor density deployment at large buildings like the Taipei 101 Shopping Mall in considering the fire evacuation. [ABSTRACT FROM AUTHOR]

The property of nonlinearity has high importance for the design of strong substitution boxes. Therefore, the development of new techniques to produce substitution boxes with high values of nonlinearity is essential. Many research papers have shown that optimization algorithms are an efficient technique to obtain good solutions. However, there is no reference in the public literature showing that a heuristic method obtains optimal nonlinearity unless seeded with optimal initial solutions. Moreover, the majority of papers with the best nonlinearity reported for pseudo-random seeding of the algorithm(s) often achieve their results with the help of some cost function(s) over the Walsh–Hadamard spectrum of the substitution. In the sense, we proposed to present, in this paper, a novel external parameter independent cost function for evolving bijective s-boxes of high nonlinearity, which is highly correlated to this property. Several heuristic approaches including GaT (genetic and tree), LSA (local search algorithm), and the Hill Climbing algorithm have been investigated to assess the performance of evolved s-boxes. A performance comparison has been done to show the advantages of our new cost function, with respect to cost functions for s-boxes like Clark's and Picek's cost functions. [ABSTRACT FROM AUTHOR]

The main advantage of hybrid powertrains is based on the efficient transfer of power and torque from power sources to the powertrain as well as recapturing of reversible energies without effecting the vehicle performance. The benefits of hybrid hydraulic powertrains can be better utilized with an appropriate power management. In this paper, different types of power management algorithms like off-line and on-line methods are briefly reviewed and classified. Finally, the algorithms are evaluated and compared. Therefore, different related criteria are evaluated and applied. [ABSTRACT FROM AUTHOR]

Nowadays, Unmanned Aerial Vehicles (UAV) are frequently present in the civilian environment. However, proper implementations of different solutions based on these aircraft still face important challenges. This article deals with multi-UAV systems, forming aerial networks, mainly employed to provide Internet connectivity and different network services to ground users. However, the mission duration (hours) is longer than the limited UAVs' battery life-time (minutes). This paper introduces the UAV replacement procedure as a way to guarantee ground users' connectivity over time. This article also formulates the practical UAV replacements problem in moderately large multi-UAV swarms and proves it to be an NP-hard problem in which an optimal solution has exponential complexity. In this regard, the main objective of this article is to evaluate the suitability of heuristic approaches for different scenarios. This paper proposes betweenness centrality heuristic algorithm (BETA), a graph theory-based heuristic algorithm. BETA not only generates solutions close to the optimal (even with 99% similarity to the exact result) but also improves two ground-truth solutions, especially in low-resource scenarios. [ABSTRACT FROM AUTHOR]

The paper introduces a new approach to enhance optimization algorithms when solving the piecewise linearization problem of a given function. Eight swarm intelligence algorithms were selected to be experimentally compared. The problem is represented by the calculation of the distance between the original function and the estimation from the piecewise linear function. Here, the piecewise linearization of 2D functions is studied. Each of the employed swarm intelligence algorithms is enhanced by a newly proposed automatic detection of the number of piecewise linear parts that determine the discretization points to calculate the distance between the original and piecewise linear function. The original algorithms and their enhanced variants are compared on several examples of piecewise linearization problems. The results show that the enhanced approach performs sufficiently better when it creates a very promising approximation of functions. Moreover, the degree of precision is slightly decreased by the focus on the speed of the optimization process. [ABSTRACT FROM AUTHOR]

Nature-inspired metaheuristic algorithms remain a strong trend in optimization. Human-inspired optimization algorithms should be more intuitive and relatable. This paper proposes a novel optimization algorithm inspired by a human search party. We hypothesize the behavioral model of a search party searching for a treasure. Motivated by the search party's behavior, we abstract the "Divide, Conquer, Assemble" (DCA) approach. The DCA approach allows us to parallelize the traditional gradient descent algorithm in a strikingly simple manner. Essentially, multiple gradient descent instances with different learning rates are run parallelly, periodically sharing information. We call it the search party gradient descent (SPGD) algorithm. Experiments performed on a diverse set of classical benchmark functions show that our algorithm is good at optimizing. We believe our algorithm's apparent lack of complexity will equip researchers to solve problems efficiently. We compare the proposed algorithm with SciPy's optimize library and it is found to be competent with it. [ABSTRACT FROM AUTHOR]

Optimization is an important and fundamental challenge to solve optimization problems in different scientific disciplines. In this paper, a new stochastic nature-inspired optimization algorithm called Pelican Optimization Algorithm (POA) is introduced. The main idea in designing the proposed POA is simulation of the natural behavior of pelicans during hunting. In POA, search agents are pelicans that search for food sources. The mathematical model of the POA is presented for use in solving optimization issues. The performance of POA is evaluated on twenty-three objective functions of different unimodal and multimodal types. The optimization results of unimodal functions show the high exploitation ability of POA to approach the optimal solution while the optimization results of multimodal functions indicate the high ability of POA exploration to find the main optimal area of the search space. Moreover, four engineering design issues are employed for estimating the efficacy of the POA in optimizing real-world applications. The findings of POA are compared with eight well-known metaheuristic algorithms to assess its competence in optimization. The simulation results and their analysis show that POA has a better and more competitive performance via striking a proportional balance between exploration and exploitation compared to eight competitor algorithms in providing optimal solutions for optimization problems. [ABSTRACT FROM AUTHOR]

This paper addresses the problem of monocular Simultaneous Localization And Mapping on Lie groups using fiducial patterns. For that purpose, we propose a reformulation of the classical camera model as a model on matrix Lie groups. Thus, we define an original-state vector containing the camera pose and the set of transformations from the world frame to each pattern, which constitutes the map's state. Each element of the map's state, as well as the camera pose, are intrinsically constrained to evolve on the matrix Lie group S E (3) . Filtering is then performed by an extended Kalman filter dedicated to matrix Lie groups to solve the visual SLAM process (LG-EKF-VSLAM). This algorithm has been evaluated in different scenarios based on simulated data as well as real data. The results show that the LG-EKF-VSLAM can improve the absolute position and orientation accuracy, compared to a classical EKF visual SLAM (EKF-VSLAM). [ABSTRACT FROM AUTHOR]

This paper presents a benchmark for peak detection algorithms employed in fiber Bragg grating spectrometric interrogation systems. The accuracy, precision, and computational performance of currently used algorithms and those of a new proposed artificial neural network algorithm are compared. Centroid and gaussian fitting algorithms are shown to have the highest precision but produce systematic errors that depend on the FBG refractive index modulation profile. The proposed neural network displays relatively good precision with reduced systematic errors and improved computational performance when compared to other networks. Additionally, suitable algorithms may be chosen with the general guidelines presented. [ABSTRACT FROM AUTHOR]

One of the biggest challenge in the field of deep learning is the parameter selection and optimization process. In recent years different algorithms have been proposed including bio-inspired solutions to solve this problem, however, there are many challenges including local minima, saddle points, and vanishing gradients. In this paper, we introduce the Whale Optimisation Algorithm (WOA) based on the swarm foraging behavior of humpback whales to optimise neural network hyperparameters. We wish to stress that to the best of our knowledge this is the first attempt that uses Whale Optimisation Algorithm for the optimisation task of hyperparameters. After a detailed description of the WOA algorithm we formulate and explain the application in deep learning, present the implementation, and compare the proposed algorithm with other well-known algorithms including widely used Grid and Random Search methods. Additionally, we have implemented a third dimension feature analysis to the original WOA algorithm to utilize 3D search space (3D-WOA). Simulations show that the proposed algorithm can be successfully used for hyperparameters optimization, achieving accuracy of 89.85% and 80.60% for Fashion MNIST and Reuters datasets, respectively. [ABSTRACT FROM AUTHOR]

This paper introduces a novel population-based bio-inspired meta-heuristic optimization algorithm, called Blood Coagulation Algorithm (BCA). BCA derives inspiration from the process of blood coagulation in the human body. The underlying concepts and ideas behind the proposed algorithm are the cooperative behavior of thrombocytes and their intelligent strategy of clot formation. These behaviors are modeled and utilized to underscore intensification and diversification in a given search space. A comparison with various state-of-the-art meta-heuristic algorithms over a test suite of 23 renowned benchmark functions reflects the efficiency of BCA. An extensive investigation is conducted to analyze the performance, convergence behavior and computational complexity of BCA. The comparative study and statistical test analysis demonstrate that BCA offers very competitive and statistically significant results compared to other eminent meta-heuristic algorithms. Experimental results also show the consistent performance of BCA in high dimensional search spaces. Furthermore, we demonstrate the applicability of BCA on real-world applications by solving several real-life engineering problems. [ABSTRACT FROM AUTHOR]

Swarm intelligence is a discipline which makes use of a number of agents for solving optimization problems by producing low cost, fast and robust solutions. The dragonfly algorithm (DA), a recently proposed swarm intelligence algorithm, is inspired by the dynamic and static swarming behaviors of dragonflies, and it has been found to have a higher performance in comparison to other swarm intelligence and evolutionary algorithms in numerous applications. There are only a few surveys about the dragonfly algorithm, and we have found that they are limited in certain aspects. Hence, in this paper, we present a more comprehensive survey about DA, its applications in various domains, and its performance as compared to other swarm intelligence algorithms. We also analyze the hybrids of DA, the methods they employ to enhance the original DA, their performance as compared to the original DA, and their limitations. Moreover, we categorize the hybrids of DA according to the type of problem that they have been applied to, their objectives, and the methods that they utilize. [ABSTRACT FROM AUTHOR]

This paper focusses on a hybrid approach based on genetic algorithm (GA) and an adaptive neuro fuzzy inference system (ANFIS) for modeling the correlation between plasma arc cutting (PAC) parameters and the response characteristics of machined Monel 400 alloy sheets. PAC experiments are performed based on box-behnken design methodology by considering cutting speed, gas pressure, arc current, and stand-off distance as input parameters, and surface roughness (Ra), kerf width (kw), and micro hardness (mh) as response characteristics. GA is efficaciously utilized as the training algorithm to optimize the ANFIS parameters. The training, testing errors, and statistical validation parameter results indicated that the ANFIS learned by GA outperforms in the forecasting of PAC responses compared with the results of multiple linear regression models. Besides that, to obtain the optimal combination PAC parameters, multi-response optimization was performed using a trained ANFIS network coupled with an artificial bee colony algorithm (ABC). The superlative responses, such as Ra of 1.5387 µm, kw of 1.2034 mm, and mh of 176.08, are used to forecast the optimum cutting conditions, such as a cutting speed of 2330.39 mm/min, gas pressure of 3.84 bar, arc current of 45 A, and stand-off distance of 2.01 mm, respectively. Furthermore, the ABC predicted results are validated by conducting confirmatory experiments, and it was found that the error between the predicted and the actual results are lower than 6.38%, indicating the adoptability of the proposed ABC in optimizing real-world complex machining processes. [ABSTRACT FROM AUTHOR]