Search

This paper proposes a novel nature-inspired meta-heuristic algorithm, named Snow Geese Algorithm. It is inspired by the migratory behavior of snow geese and emulates the distinctive "Herringbone" and "Straight Line" shaped flight patterns observed during their migration. The algorithm is structured into three main phases for benchmark testing. In the first phase, the Snow Geese Algorithm's numerical results are compared with those of several classical meta-heuristic algorithms using the same test functions and original data from these algorithms. In the second phase, in order to minimize potential variations during the comparison, all algorithms undergo evaluation on a standardized testing platform. In the third phase, this paper applies the Snow Geese Algorithm to solve four widely recognized engineering optimization problems: the tubular column design, piston lever optimization design, reinforced concrete beam design and car side impact design. These real-world engineering problems serve as test cases to assess Snow Geese Algorithm problem-solving capabilities. The primary objective of the Snow Geese Algorithm is to provide an alternative perspective for tackling complex optimization problems. Please note that the complete source code for the Snow Geese Algorithm is publicly available at https://github.com/stones3421/SGA-project. • Snow Geese Algorithm: A novel meta-heuristic approach inspired by snow geese flight behavior, tackling optimization problems. • Two-stage Strategy: Mimics snow geese exploration and exploitation patterns, setting it apart from traditional methods. • Performance Evaluation: Multiple algorithms are assessed on different problems. • Algorithm Features: Experimental results validate the effectiveness of the Snow Geese Algorithm. • Practical Applications: Snow Geese Algorithm shows potential in engineering optimization, aiding accurate decision-making. [ABSTRACT FROM AUTHOR]

This comprehensive review focuses on the Autonomous Driving System (ADS), which aims to reduce human errors that are the reason for about 95% of car accidents. The ADS consists of six stages: sensors, perception, localization, assessment, path planning, and control. We explain the main state-of-the-art techniques used in each stage, analyzing 275 papers, with 162 specifically on path planning due to its complexity, NP-hard optimization nature, and pivotal role in ADS. This paper categorizes path planning techniques into three primary groups: traditional (graph-based, sampling-based, gradient-based, optimization-based, interpolation curve algorithms), machine and deep learning, and meta-heuristic optimization, detailing their advantages and drawbacks. Findings show that meta-heuristic optimization methods, representing 23% of our study, are preferred for being general problem solvers capable of handling complex problems. In addition, they have faster convergence and reduced risk of local minima. Machine and deep learning techniques, accounting for 25%, are favored for their learning capabilities and fast responses to known scenarios. The trend towards hybrid algorithms (27%) combines various methods, merging each algorithm's benefits and overcoming the other's drawbacks. Moreover, adaptive parameter tuning is crucial to enhance efficiency, applicability, and balancing the search capability. This review sheds light on the future of path planning in autonomous driving systems, helping to tackle current challenges and unlock the full capabilities of autonomous vehicles. [ABSTRACT FROM AUTHOR]

• A feature selection method based on binary dandelion algorithm is proposed. • The algorithm applies a sine-cosine operator and a restart strategy. • Mutual information and quick bit mutation improve the performance of the algorithm. • The algorithm performs well on datasets with larger dimensions. Feature selection (FS) is an important data preprocessing technology for machine learning and data mining. Metaheuristic algorithm (MH) has been widely used in feature selection because of its powerful search function. This paper presents an improved Binary Dandelion Algorithm using Sine Cosine operator and Restart strategy (SCRBDA) for feature selection. First, the sine cosine operator is used in the radius formula of the core dandelions (CD), which significantly enhances the ability of algorithm development and exploration. Secondly, the algorithm uses a restart strategy to increase its ability to get rid of local optimum. Thirdly, mutual information is used to guide the generation of some dandelions, which pays more attention to the correlation between the selected features and categories. Finally, quick bit mutation is used as the mutation strategy to improve the diversity of the population. The SCRBDA proposed in this paper was tested on 18 datasets of different sizes from UCI machine learning database. The SCRBDA was compared with 8 other classical feature selection algorithms, and the performance of the proposed algorithm was evaluated through feature subset size, classification accuracy, fitness value, and F1-score. The experimental results show that SCRBDA achieves the best performance, which has stronger feature reduction ability and achieves better overall performance on most datasets. Especially on large-scale datasets, SCRBDA can obtain extremely smaller feature subsets while maintaining much higher classification accuracy, and satisfactory F1-score. [ABSTRACT FROM AUTHOR]

This paper introduces an improved differential evolution algorithm based on cooperative multi-population (CMp-DE for short), which combines diverse population collaboration mechanisms and catalytic factors into an improved differential evolution framework. By harnessing various population collaboration mechanisms, the algorithm enhances the diversity of individuals within populations during initial iterations and reduces it during later iterations, thereby harmonizing the algorithm's exploratory and exploitative capabilities. Furthermore, a novel mutation operator is proposed that divides the iterative process into exploration and exploitation phases, thereby augmenting the algorithm's global exploration prowess. Lastly, a catalytic operator is introduced to generate new individuals near post-crossover individuals based on a specified rule, which enhances the algorithm's ability to escape local optima and increasing stability. The proposed CMp-DE is benchmarked against the CEC2017 benchmark test functions and compared against 13 algorithms, including five differential evolution algorithms and their variants, as well as eight state-of-the-art metaheuristic optimization algorithms. This evaluation assesses the CMp-DE's solution accuracy, convergence, stability, and scalability. Finally, the applicability of CMp-DE is validated by addressing six practical optimization problems. The experimental results show that CMp-DE surpasses other algorithms in terms of both convergence accuracy and robustness. Moreover, integrating a catalytic operator with other optimization algorithms notably boosts performance in convergence accuracy and stability. The inclusion of the catalytic operator has significantly enhanced the performance of algorithms compared to their performance before its addition. This underscores the potential of the catalytic operator in improving the performance of various algorithms, particularly in terms of convergence accuracy and robustness. [ABSTRACT FROM AUTHOR]

This paper introduces an improved differential evolution algorithm based on cooperative multi-population (CMp-DE for short), which combines diverse population collaboration mechanisms and catalytic factors into an improved differential evolution framework. By harnessing various population collaboration mechanisms, the algorithm enhances the diversity of individuals within populations during initial iterations and reduces it during later iterations, thereby harmonizing the algorithm's exploratory and exploitative capabilities. Furthermore, a novel mutation operator is proposed that divides the iterative process into exploration and exploitation phases, thereby augmenting the algorithm's global exploration prowess. Lastly, a catalytic operator is introduced to generate new individuals near post-crossover individuals based on a specified rule, which enhances the algorithm's ability to escape local optima and increasing stability. The proposed CMp-DE is benchmarked against the CEC2017 benchmark test functions and compared against 13 algorithms, including five differential evolution algorithms and their variants, as well as eight state-of-the-art metaheuristic optimization algorithms. This evaluation assesses the CMp-DE's solution accuracy, convergence, stability, and scalability. Finally, the applicability of CMp-DE is validated by addressing six practical optimization problems. The experimental results show that CMp-DE surpasses other algorithms in terms of both convergence accuracy and robustness. Moreover, integrating a catalytic operator with other optimization algorithms notably boosts performance in convergence accuracy and stability. The inclusion of the catalytic operator has significantly enhanced the performance of algorithms compared to their performance before its addition. This underscores the potential of the catalytic operator in improving the performance of various algorithms, particularly in terms of convergence accuracy and robustness. [ABSTRACT FROM AUTHOR]

Most metaheuristic methods employ a strategy designed to be generical and fixed. As a result, these methods often lack the capability to adaptively modify their performance in response to different scenarios or challenges encountered during the search process. This paper presents a new metaheuristic algorithm designed to dynamically adjust its search strategy throughout the optimization process for increased efficiency. This algorithm is based on Evolutionary Strategies (ES) due to their notable self-adaptive features. To further enhance its efficiency, we have incorporated elements from Evolutionary Game Theory (EGT). This integration ensures a more comprehensive strategy adaptation process, taking into account not only the information from the specific agent but also insights from other population members. Additionally, our approach alters the conventional EGT mechanism by including not just pairwise evaluations but also data from the top-performing individuals in the population, based on their outcomes. This broader adaptation strategy allows for a faster convergence to the most effective dominant strategy. To demonstrate the effectiveness of our method, we compared it against several established metaheuristic algorithms using 28 diverse test functions. Our findings reveal that this approach produces competitive results, delivering higher-quality solutions and faster convergence rates. [ABSTRACT FROM AUTHOR]

Fractional order filters offer greater freedom of design and a precise control over stopband attenuation in electronic circuits and systems. This paper presents the design of a fractional order low pass Chebyshev filter (FOLCF) that achieves near-ideal response characteristics. The methodology introduced utilizes metaheuristic optimization methods, including particle swarm optimization, firefly algorithm, and grey wolf optimization. These techniques are employed to precisely adjust the filter coefficients for the orders (1+α), (2+α), and (3+α). The adjustment is carried out by comparing the desired behaviour of the FOLCF with generalized fractional order low pass transfer functions. Throughout these instances, the parameter α is varied within the range of (0, 1). The designed filters are then tested and compared on the basis of various factors. Simulation results demonstrate that the designed filters closely follow the behaviour of an ideal Chebyshev filter with maximum passband and stopband magnitude errors being −31.93 dB and −52.74 dB respectively for (1+α) order filters. These values for (2+α) and (3+α) order FOLCF have been observed to be −30.04 dB and −55.91 dB; −17.72 dB and −49.52 dB respectively. Furthermore, it has been observed that the proposed work outperforms existing state-of-the-art approaches in various aspects, including magnitude error, stopband attenuation, and cut-off frequency. The stability of the designed filters has been verified through stability analysis. Additionally, practical feasibility of the proposed FOLCF is demonstrated through SPICE simulations for α = [0.2,0.5,0.8] using second generation current conveyor (CCII) and operational transconductance amplifier (OTA) based topologies while approximating the constant phase element using fifth order continued fraction expansion. The SPICE implementations closely follow the behaviour of ideal filter with −48.67 dB and −62.8 dB as mean square errors for CCII and OTA circuits respectively, showcasing the proposed filters' superiority and practical applicability in advanced electronic design. • A generalized design of Fractional order low Pass Chebyshev filters having near idle response has been proposed. • Nature inspired Algorithms: particle swarm optimization (PSO), firefly algorithm (FA) & grey wolf optimization (GWO) are used. • Comparisons with existing literature on basis of magnitude errors, stopband attenuation and cut off frequencies has been made. • Stability analysis for all the designed filters has been done by converting s-plane to W-plane. • Realization of proposed filters has been done by using CCII and OTA based circuits to test feasibility. [ABSTRACT FROM AUTHOR]

Aiming at the problem that Ant Colony Optimization (ACO) is subject primarily to the parameters, we propose a hybrid algorithm SOA-ACO-2Opt to optimize the ACO parameter combination through Seagull Optimization Algorithm (SOA) to strengthen ACO's search capability. To obtain a uniform initial distribution of the ACO parameter combination, we incorporated the Kent Chaos Map (KCM) to randomly initialize the seagull's position, reducing the tendency of SOA to fall into the local optimum. To avoid slow calculation speed and premature convergence of ACO, we improved the adaptive multi-population mechanism to reduce repeated redundant calculations and used the ϵ − g r e e d y and default strategy, respectively, to update the ants' position. 2Opt is applied to find shorter paths in each iteration. In addition, when AUV navigates on the planned path, it may encounter obstacles. Therefore, this paper proposes an autonomous obstacle avoidance algorithm based on forward-looking sonar to ensure safety during tasks. SOA-ACO-2Opt is verified against twelve different problems extracted from TSPLIB and compared with some state-of-the-art algorithms. Furthermore, sea trials were carried out for several representative marine engineering applications of TSP and obstacle avoidance. Experimental results show that this work can significantly improve AUV's work efficiency and intelligence and protect the AUV's safety. [Display omitted] • A hybrid algorithm SOA-ACO-2Opt is proposed to solve TSP. • A multi-population mechanism is used to reduce redundant computation and avoid early convergence. • The desired-path-based avoidance strategy is efficient and of low complexity. • The proposed algorithm is practical and efficient for AUV engineering applications. [ABSTRACT FROM AUTHOR]

• Moisture affects microbial succession and volatiles generation by mediated with Lactobacillus. • The ratio of ethyl acetate to ethyl lactate and content of acid, alcohol positively relate to moisture. • Increase moisture accelerate formation of Lactobacillus -dominated fermentation microbiota. • Increase moisture enhance complexity and stability of baijiu fermentation ecological networks. Today, image segmentation methods are widely used for various applications, including object detection. Multilevel Thresholding Image Segmentation (MTIS) methods are among the efficient methods for image segmentation. In MTIS methods, it is very important to find the thresholds that gives the best performance for the MTIS and better separate and detect the objects on the image from the image background. Meta-Heuristic (MH) algorithms are among the strategies that can achieve good results in obtaining optimal thresholds to solve this problem. In this paper, we use the combination of Arithmetic Optimization Algorithm (AOA) and Harris Hawks Optimizer (HHO) to improve AOA in exploitation phase, and achieve an optimal threshold vector for MTIS. Therefore, our new hybrid AOA-HHO algorithm solves the MTIS problem with better quality than both AOA and HHO algorithms and some other MH algorithms, and can obtain better thresholds that increase the performance of the MTIS system than AOA and HHO. AOA is powerful in the exploration, and HHO in exploitation phase is powerful. Therefore, AOA-HHO uses the features of both algorithms to search the entire search space locally and globally to find the best find the solution, the high power of the AOA exploration phase, and the high power of the HHO exploitation phase. Also, we use a mathematical equation as the fitness function, that is obtained by using image features. A series of experiments were performed using seven different threshold levels on the test images. Experiments show that AOA-HHO method is better than the compared algorithms and even HHO and AOA in terms of image segmentation accuracy, fitness function value, Peak Signal-to-Noise Ratio (PSNR), Structural Similarity Index Measure (SSIM), and execution time. [ABSTRACT FROM AUTHOR]

Today, intelligent optimization has become a science that few researchers have not used in dealing with problems in their field. Diversity and flexibility have made the use, efficiency, and usefulness of various nature-inspired optimization methods, such as evolutionary and meta-heuristic algorithms, more evident in such problems. This work first provides a comprehensive overview of all considerations governing various optimization problems with detailed corresponding categories. Then, the most comprehensive review and recent methods (during 1965–2022) are presented in evolution-based, swarm-based, physics-based, human-based, and hybrid-based categories. More than 320 new algorithms have been reviewed. All specifications including authors, year, abbreviation, inspired source, controls, and their application are considered in this regard. Statistical analyzes of papers and publishers, annually and for 57 years, along with their ranking, are also examined in detail. Among the key achievements of the paper include: the most number of algorithms with 47.71% (156 methods) have been from the swarm category, and most of them were published in the five years of 2021 (72, 22.02%), 2020 (39, 11.93%), 2022 (31, 9.48%), 2019 (26, 7.95%), and 2016 (21, 6.42%) respectively; the top five rankings of publishers of reviewed algorithms/papers were also: "Proceedings of the Congress" (33, 10.09%), "Applied Soft Computing" (19, 5.81%), "Expert Systems with Applications" (18, 5.51%), "Knowledge-Based Systems" (12, 3.67%), "Engineering Applications of Artificial Intelligence" (12, 3.67%), "Advances in Engineering Software" (12, 3.67%), " Neural Computing and Applications " (12, 3.67%), and " Information Sciences " (11, 3.36%). The paper's data is available at: https://github.com/ali-ece. [Display omitted] • A detailed overview of optimization and its variants. • A literature review on state-of-the-art algorithms from 1965 to 2022. • Statistical analyzes and explanations in each year and during the 57 years. [ABSTRACT FROM AUTHOR]

• Conversion time and failure rate are crucial factors for online optimization problems. • Control parameters of the swarm optimization techniques influence the performance of optimization. • The novel musical chairs algorithm (MCA) descriptions. • The simulation of the MCA compared to nine optimization algorithms. • Single-diode and double-diode models of the PV solar cells. • Parameters estimation for different operating conditions. Solar photovoltaic (PV) energy systems are representing the most attractive source of energy, especially with the continuous reduction of manufacturing costs. The new systems' sizing and cost estimation depend mainly on the accurate modeling of the PV cells. The modeling of the PV cells is based on one-diode modeling with five unknown parameters or the more accurate modeling based on two-diode modeling that have seven unknown parameters, or with a higher number of shunt diodes modeling with a higher number of unknown parameters. An accurate and fast estimation of the PV cell parameters will help designers to build their decision based on accurate results, where any small variation of these parameters can spoil the results obtained from the modeling and can produce an unwise decision. A high number of studies are introduced in the literature to estimate these parameters. These studies are different in the accuracy of results and the time consumed to get these results. Some of these studies used metaheuristic algorithms which are characterized by slow convergence and may cause inaccurate results. For this reason, a recent optimization algorithm called the musical chairs algorithm (MCA) is introduced in this paper to estimate these parameters faster and more accurately than many metaheuristic algorithms. The idea behind the use of MCA is to have a high number of search agents in the beginning to enhance the exploration and continuously reduce this number to enhance exploitation at the end of optimization and reduce the convergence time. The results obtained from using 10 optimization algorithms showed that the error associated with MCA is 20% of the average error of the other optimization algorithms. Moreover, the MCA never misses the global minimum of error which was not the case in other optimization algorithms. The MCA obtained these results in 40% of the time consumed by other optimization algorithms. These results of the MCA showed its superiority compared to other optimization algorithms. [ABSTRACT FROM AUTHOR]

The motivation of this paper follows strictly from industrial needs to improve competitiveness in railway companies by the efficient rolling stock utilization affected by the obligatory preventive maintenances of vehicles, which cause their temporary unavailability. Nevertheless, it is economically essential to minimize the total time on maintenances of vehicles, which can be achieved in a certain range by the scheduling of transport tasks taking into account maintenance policies of the vehicles, their mileage and date since the last maintenance, and the workload related to the tasks. Therefore, to face the problem, we model the consider issue as the job scheduling problem to maximize the availability of railway vehicles under preventive maintenances. We prove that the problem is strongly NP-hard and we propose efficient heuristic and metaheuristic algorithms that are characterized by a low computational complexity and they are able to find solutions satisfying from the perspective of industrial practice. The simulations based on real-life data reveal that our approach can provide schedules, which significantly improve availability of locomotives resulting in high potential financial benefits for railway companies. • The total time of maintenance can be minimized by the scheduling of transport tasks • The railway vehicle availability problem under preventive maintenance is formulated • The considered problem is proved to be strongly NP-hard • The proposed scheduling algorithms improve availability of railway vehicles • The results obtained on real-life data are satisfying for the industrial practice. [ABSTRACT FROM AUTHOR]

This paper proposes a novel hybrid algorithm which is mathematically modelled by amalgamating the superior features of recently developed Grey Wolf Optimizer (GWO), Sine Cosine Algorithm (SCA), and Crow Search Algorithm (CSA). Researchers have already implemented the aforementioned three algorithms and obtained superior quality results for solving diverse optimization problems. The novel hybrid Variegated GWO Algorithm (VGWO) developed in this proposed research work is initially realized and validated for solving IEEE CEC-C06 2019 benchmark functions. Thereafter, the proposed VGWO is utilized as an optimization tool to solve three emerging and complex power system optimization problems which includes energy management of microgrid systems operated in both islanded and grid-connected mode, dynamic economic emission dispatch and reactive power planning (RPP) problem. A comparative analysis of the proposed VGWO approach with other established metaheuristics is undertaken for each optimization problem. Numerical results show that the novel hybrid VGWO algorithm outperformed an ample number of optimization techniques in providing better quality solutions. The proposed hybrid algorithm yielded a 36.93% reduction in active power loss and 36.80% reduction in operating cost with respect to base case condition for RPP problem. Likewise while solving microgrid energy management problems 9–30% savings was realized in the generation cost compared to the ones mentioned in literature. The capability of handling many complex constraints within a minimum amount of computational time to provide consistently best solutions prioritize the proposed hybrid algorithm among its kinds. Statistical analysis validates the authenticity and viability of the proposed algorithm. [ABSTRACT FROM AUTHOR]

In this paper, a trust region optimization algorithm integrated with a co-kriging surrogate-model is newly formulated to optimize compact ultrathin wideband metamaterial absorbers with high absorption. The reported algorithm is linked with the full vectorial finite element method to simulate and optimize the studied absorbers. In order to show the power of the suggested algorithm, the geometrical parameters of a previous metamaterial absorber (MA) with L-shaped resonators are optimized to achieve high absorption (over 90 %) over a frequency band from 13.8 GHz to 24.5 GHz covering most of KU and K bands. Then, a novel design of L-shaped MA with triangular resonators is optimized, analyzed and fabricated with high absorption (above 90 %) through a large frequency band from 11.9 GHz to 22 GHz covering the entire KU-band and most of the K-band. The reported design is also robust against the variations of the incident angle (above 80 % up to 50 °) for both transverse electric (TE) and transverse magnetic (TM) polarized modes. Therefore, the proposed algorithm could be used efficiently for the design and optimization of metamaterial absorbers. • Compact ultrathin wideband polarization insensitive metamaterial absorber is reported. • A novel trust region algorithm integrated with co-kriging surrogate-model is introduced to optimize the suggested design. • The reported absorber has high absorption (over 90 %) over a bandwidth of 10.1 GHz for TE and TM polarizations. • A metamaterial absorber prototype is fabricated to verify the accuracy of the simulated results. • The reported metamaterial absorber has strong potential for KU- and K-bands applications. [ABSTRACT FROM AUTHOR]

Artificial bee colony (ABC) is a prominent algorithm that offers great exploration capabilities among various meta-heuristic algorithms. However, its monotonous and one-dimensional search strategy limits its searching performance in the solving process. Thus, to address this issue, a Q-learning based multi-strategy integrated ABC algorithm (QMABC) is proposed. In the QMABC, multiple search strategies are proposed to utilize different individual experiences and search approaches for solution updates. Then, Q-learning is employed for strategy selection. In comparison to previous studies, this paper introduces more effective state and action configurations within the framework of Q-learning. To evaluate the performance of the QMABC, CEC 2017 benchmark functions are adopted to compare it to different meta-heuristic algorithms including ABC based and non-ABC based algorithms. Moreover, applications in path planning are implemented to further verify the effectiveness of the QMABC. Overall, it should be highlighted that the proposed QMABC demonstrates superiority in both numerical and practical experiments. • A Q-learning based multi-strategy integrated ABC algorithm is proposed. • Multiple strategies are introduced to the onlooker bee phase. • Q-learning is utilized to adaptively determine the most suitable strategy. • Novel state and action settings are designed in Q-learning framework. • Proposed algorithm shows superiority in numerical and practical experiments. [ABSTRACT FROM AUTHOR]

• The 0-1 knapsack problem (KP01) is one of the classic variants of knapsack problems in which the aim is to select the items with the total profit to be in the knapsack. • In this paper, a comprehensive survey on the recent advances in 0-1 knapsack problem is presented. • Literature survey reveals some interesting challenges and future research directions. 0-1 knapsack problem (KP01) is one of the classic variants of knapsack problems in which the aim is to select the items with the total profit to be in the knapsack. In contrast, the constraint of the maximum capacity of the knapsack is satisfied. KP01 has many applications in real-world complex problems such as resource distribution, portfolio optimization, etc. This study reviews the basic theory and main algorithms of 0-1 knapsack, proposes many different types of nature-inspired metaheuristic algorithms, and divides existing 0-1 knapsack problems into 6 types according to the different coding methods of the algorithms, for a comprehensive overview of it. In this paper, a comprehensive survey on the recent advances in 0-1 knapsack problem is presented. Literature survey reveals some interesting challenges and future research directions. [ABSTRACT FROM AUTHOR]

• Transform the max-bisection problem to a linearly constrained optimization problem. • Propose a deterministic annealing neural network algorithm by introducing a barrier function in square-root form. • Prove the existence of the integral minimum solution of the max-bisection problem in theory and the proof is simpler than other algorithms. • Experimental results show that the proposed method outperforms other methods. The max-bisection problem has extensive applications in network engineering, making it imperative to develop effective methods to solve this problem. However, the efficient computation on this problem remains challenging due to its NP-hard computational complexity. To address this question, in this paper, we transform the max-bisection problem to an artificial linearly constrained optimization problem and develop a modified deterministic annealing neural network algorithm by introducing a barrier function. The barrier parameter of this function acts as the temperature in the annealing process and decreases from a large positive number to zero. The initial value of the barrier parameter promises that the artificial problem is convex and can be easily solved at the beginning of the descending process. The solution to the original max-bisection problem is finally obtained through a descent algorithm, in which the bound limit of the solution is always satisfied as long as the iteration step length is less than one. We have proved the theoretical convergence of the proposed algorithm. Numerical results demonstrate that the proposed algorithm has several advantages over both the approximation algorithms and metaheuristic methods. [ABSTRACT FROM AUTHOR]

Graphical abstract Highlights • The paper proposes an efficient SSA-based approach to extract the PV cell parameters. • SSA is firstly compared to the novel SCA and VCS optimizers not used before. • SSA is then compared with well-established optimizers such as ALO, GSA, and WOA. • Experimental tests are also performed to ensure the effectiveness of SSA. • Comparisons and metrics support the experimental results and show SSA efficacy. Abstract Solar Photovoltaic systems (SPVSs) are becoming one of the most popular renewable energy technology for generating significant share of electric power. With the consistent growth of SPVSs applications, the challenge of parameters estimation of photovoltaic cells has drawn the attention of researchers and industrialists and gained immense momentum for SPVSs modeling. This paper proposes an efficient approach based on Salp Swarm Algorithm (SSA) for extracting the parameters of the electrical equivalent circuit of PV cell based double-diode model. The experimental and comparative results demonstrate that SSA is highly competitive with the results of two algorithms that have never been used before for the PV cell parameter extraction namely Sine Cosine Algorithm (SCA) and Virus Colony Search Algorithm (VCS). SSA is also significantly better than three well-established parameter extraction algorithms namely Ant Lion Optimizer (ALO), Gravitational Search Algorithm (GSA) and Whale Optimization Algorithm (WOA). Several evaluation criteria including Mean Square Error (MSE), Absolute Error (AE) and statistical criterion show that the SSA algorithm provides the highest value of accuracy and has merits in designing SPVSs. [ABSTRACT FROM AUTHOR]

Cloud data center comprises various physical and virtual machines, alongside storage datacenter services provided by cloud providers. Effectively mapping tasks to optimize resource utilization and load balance is essential for efficient task scheduling. This process, referred to as scheduling constraints, can significantly enhance overall efficiency. However, to harness the benefits of this scheduling, one must address the challenges arising during task execution. The interdependencies between tasks and the diverse resources available in the datacenter pose significant hurdles to efficient resource allocation. To address these challenges, this paper introduces the Hybrid HEFT-PSO-GA algorithm (HEPGA), aiming to efficiently allocate tasks to available resources across the datacenter. The HEPGA algorithm builds upon prior research by integrating the strengths of PSO (Particle Swarm Optimization) and GA (Genetic Algorithm) to optimize task scheduling in cloud computing environments. Through the fusion of PSO, GA, and HEFT-based Initialization, the algorithm strives to efficiently allocate tasks to processors, thereby minimizing the makespan. This approach capitalizes on parallel processing capabilities to further enhance resource utilization in the cloud environment. By varying the weights of the fitness function and considering the resources within the datacenter, we meticulously analyze the algorithm's performance concerning both makespan and Resource Utilization (RU). The results of these tests underscore the algorithm's consistent and robust resource utilization across diverse weight configurations, highlighting its adaptability to varying priorities. Moreover, the observed variations in makespan performance based on different weights emphasize the algorithm's potential for excellence when tailored to specific optimization goals. [ABSTRACT FROM AUTHOR]

One driving application for multi-robots is source seeking, especially in the hazardous environment. It consists of two essential subtasks: source location and path search. Nature inspired meta-heuristic is preferable in addressing the source location subtask which is an inversion problem, while the Astar algorithm and its variants are widely used for the path search subtask. In this paper, we present a multi-robot team simulator as a container which contains both algorithms as components. The simulator takes the constraints into consideration, including the size and the speed bound of each robot, the obstacle and collision avoidance. We provide a python implementation and example problems for research and test purposes. The well-structured code with object-oriented design can be conveniently upgraded by adding new excellent nature inspired metaheuristics, or extended to other source seeking problems in various field applications. The python code can be downloaded from the website: https://github.com/buctlab/source-seeking-multi-robot-team-simulator. • We developed a source-seeking multi-robot simulator containing many metaheuristics. • We implemented the multimodal version of metaheuristics in the simulator. • The simulator closely combines the metaheuristics with the Astar algorithm. [ABSTRACT FROM AUTHOR]

In this paper, a metaheuristic algorithm called PID-based search algorithm (PSA) is proposed for global optimization. The algorithm is based on an incremental PID algorithm that converges the entire population to an optimal state by continuously adjusting the system deviations. PSA is mathematically modeled and implemented to achieve optimization in a wide range of search spaces. PSA is used to solve CEC2017 benchmark test functions and six constrained problems. The optimization performance of PSA is verified by comparing it with seven metaheuristics proposed in recent years. The Kruskal-Wallis, Holm and Friedman tests verified the superiority of PSA in terms of statistical significance. The results show that PSA can be better balanced exploration and exploitation with strong optimization capability. Source codes of PSA are publicly available at https://ww2.mathworks.cn/matlabcentral/fileexchange/131534-pid-based-search-algorithm. [ABSTRACT FROM AUTHOR]

The last few years have seen an increasing demand for high-capacity Internet services, and this need has intensified in the years 2020 and 2021. In 2020 and 2021, Internet usage grew by 50% in several European countries, mainly due to home office, video streaming, hybrid teaching, and others. High-capacity optical networks usually meet this growing demand for Internet services. Thus, investigations that can improve the quality of optical networks are highly relevant in the current context. One of the research problems in this area is related to the physical topology design (PTD) of optical networks, which is classified as NP-hard. Several studies on PTD consider the application of meta-heuristics that obtain suboptimal solutions in a time compatible with engineering applications. However, meta-heuristics and local search techniques have been combined in several other optimization problems, which is not typical for the PTD problem. This paper proposes a solution to the PTD problem that combines a known multipurpose optimization algorithm, the NSGA-III, with operators considering the domain-specific knowledge of the problem to provide superior-quality networks. According to our results, the new proposal presents quality up to 8% higher than previous proposals concerning the hypervolume metrics (HV), maintaining a similar computational cost. • Proposal of pivot rules for local search in many objective algorithms for PTD. • Provide a method for efficient exploration of neighborhood for network optimization. • Proposal of a new local search that considers both convergence and diversity. • Hybridization of NSGA-III with the proposed LS, providing superior quality solutions. [ABSTRACT FROM AUTHOR]

Portfolio optimization is an essential issue in quantitative investing, which aims to find the best set of portfolios by allocating the proportion of assets. One of the most widely studied portfolio optimization models is the cardinality constrained mean–variance model, which incorporates real-world constraints on the number of selected assets and lower and upper bounds on the proportion of each asset. This paper presents a novel metaheuristic algorithm based on the Mayfly algorithm to solve the cardinality constrained mean–variance portfolio optimization problem. To better adapt to this problem, we design and introduce some new features to the proposed algorithm, including (1) a new cardinality constraint handling strategy; (2) a new local search strategy; and (3) changes to the crossover operator. We have designed comparison experiments for the proposed metaheuristic and evaluated its performance using five commonly used performance metrics. The experimental results show that the proposed approach achieves competitive performance on datasets of different sizes. The results also demonstrate the feasibility of this approach in solving the cardinality constrained mean–variance portfolio optimization problem. • The proposed algorithm is used for Cardinality Constrained Portfolio Optimization. • A fast cardinality constraint handling strategy. • A nuptial dance and bi-direction-based local search strategy. • Excellent comparison experimental results on benchmark from OR-Lib. [ABSTRACT FROM AUTHOR]

When planning maintenance tasks involving the switching off of parts of the network, electricity transmission operators must evaluate and take into account the associated risks. The French operator, RTE, has developed a three-step approach in which they first calculate the risks in every possible scenario, then plan the maintenance tasks by optimizing some risk measures, and finally validate the plan. In this paper, we have addressed the second step, developing mathematical models that approximate the original problem as well as a matheuristic algorithm. It is composed of three phases, combining integer linear models in the first phase with metaheuristics such as Variable Neighbourhood Descent and Path Relinking in the second and third phases. The computational results obtained on the benchmarks provided by the company show that our algorithm improves on the best reported solutions for most of the test instances. • We have developed a matheuristic algorithm for a real maintenance planning problem. • The algorithm combines integer linear models with GRASP, VND, and Path Relinking. • The solutions are refined in a final intensification phase. • Our algorithm improves on the best reported solutions for most of the instances. [ABSTRACT FROM AUTHOR]

In this paper we solve a practical variant of an arc routing problem. We target the close enough model in which clients can be served from relatively close arcs. This variant, known as the profitable close-enough arc routing problem, models real situations, such as inventory management or automated meter reading. We propose a heuristic based on the variable neighborhood search methodology to maximize the sum of profits of the clients served (penalized with the distance traveled). Our method incorporates efficient search strategies to speed up the optimization process, as required in practical applications. We present extensive experimentation over a benchmark of previously reported instances. Specifically, we first set the key search parameters of our method, and then compare it with the state-of-the-art heuristics for this problem. Our heuristic outperforms the previous algorithms published for this problem, as confirmed by the statistical analysis, which permits to draw significant conclusions. • A literature overview on close-enough is carried out. • A MultiStart-VNS algorithm is proposed and adapted to solve the PCEARP. • The experimental results proved the efficiency of the proposed algorithm. • The metaheuristic algorithm outperforms other existing methods for the problem. • The method has a great potential to be applied in emerging real-life problems. [ABSTRACT FROM AUTHOR]

In this study, an energy efficiency study has been carried out through the moment values of a quadrotor applied in the position control with the differential evolution algorithm (DE), which is under the evolutionary algorithms among meta-heuristic algorithms particle swarm optimization (PSO) which is among swarm-based algorithms and gravity search algorithm (GSA) among physics-based algorithms and charged system search (CSS) algorithm, which are all well-known in the literature. The efficient use of energy in electrically powered flying mechanisms is important in terms of completing its task. The aim of this study is to obtain proportional–integral–derivative (PID) coefficients that minimize the energy consumption caused by quadrotor moments. First of all, 12 PID coefficients calculated with traditional Ziegler Nicholes, and trying-error methods for the control of the quadrotor have been trained with DE, PSO, GSA and CSS algorithms and their cost values have been found for this problem. In the study, optimum PID coefficients have been found separately with each algorithm and torque data giving energy efficiency have been obtained by applying them to the state equations. Although the cost minimization convergence value obtained from DE does not look good compared to other algorithms, it has been observed that the moment values of the obtained PID coefficients in the control program are lower. In the study, it has been shown that the PID coefficients obtained from DE reach the target with approximately less energy than the maximum-moment value of the PSO, which provides the closest moment value. It can be thought that this value contributes to energy consumption in each orbital movement of the quadrotor. The simulation results show that the coefficients obtained from DE provide better energy efficiency and are superior to other algorithms compared in terms of energy efficiency. • PID coefficients for quadrotor control are optimized with DE,PSO,CSS,GSA algorithms • The torque values to be applied to each motor were adjusted with these coefficients • The total force applied with DEPID in the z direction is smaller than others • DEPID consumes less energy than the other algorithms in the paper [ABSTRACT FROM AUTHOR]

The optimization of multi-objective dynamic economic-grid fluctuation dispatch (MODEGD) involves simultaneous optimization of two competing objectives, fuel cost and grid fluctuation, while fulfilling constraints. In this paper, an improved version of the multi-objective marine predator algorithm (IMOMPA), is proposed for solving MODEGD considering plug-in electric vehicles. The IMOMPA algorithm improves upon the existing multi-objective marine predator algorithm in three key ways. Firstly, the initial population's diversity is enhanced using opposition learning combined with chaotic mapping. Secondly, a nonlinear convergence factor is introduced to speed up the convergence. Finally, the spiral search mechanism from the whale optimization algorithm (WOA) is incorporated to improve the algorithm's global search ability. By testing the performance of IMOMPA on ZDT series and DTLZ series multi-objective benchmark functions, IMOMPA shows strong local search capability, better robustness, and better convergence speed and convergence accuracy. Moreover, connecting plug-in electric vehicles (PEVs) to the grid (V2G), can mitigate grid fluctuations and balance peak demand periods. To validate the feasibility of the proposed IMOMPA, numerical experiments are performed on multi-objective benchmark functions and generation units of varying scales. The results demonstrate the superiority of the IMOMPA algorithm compared to other alternatives. • The improved multi-objective marine predator algorithm has stronger local search capability and higher solution accuracy. • Multi-objective dynamic economic dispatch is a new model that considers grid fluctuation. • A series of non-dominated solutions are gained instead of a single solution. • The diversity of solutions is essentially improved. [ABSTRACT FROM AUTHOR]

A discernible correlation emerged between global bridge disasters and bridge deterioration in recent years. To assist bridge inspectors in conducting deterioration identification, this paper presents a Pilgrimage Walk Optimization (PWO) algorithm inspired by Taiwan's unique Matsu bobee custom. The search behavior of the PWO algorithm simulates the gathering of devotees following Matsu's palanquin and their collective movements based on folk belief activities, including divination block casting, pilgrimage, the leisure ceremony, crawling beneath the palanquin, palanquin robbing, and the return palanquin ceremony. Analysis results show that the PWO outperformed contemporary metaheuristic algorithms on various multidimensional benchmark functions and was effectively applied to image segmentation for multiple types of bridge deterioration collected by an unmanned aerial vehicle. In the increasing number of engineering problems requiring edge computing to process big data, the proposed PWO algorithm is a low-cost and robust method with fault tolerance. • Presenting the innovative Pilgrimage Walk Optimization (PWO) algorithm, a revolutionary metaheuristic approach. • The new algorithm is tested on benchmark functions and applied to optimize image segmentation. • PWO algorithm outperforms contemporary metaheuristic algorithms in terms of achieving optimal solutions. • Exploring diverse bridge deterioration patterns auto-segmented using metaheuristic clustering algorithms. • PWO algorithm holds potential applications in AIoT technology and automation within the construction industry. [ABSTRACT FROM AUTHOR]

In this study, an energy efficiency study has been carried out through the moment values of a quadrotor applied in the position control with the differential evolution algorithm (DE), which is under the evolutionary algorithms among meta-heuristic algorithms particle swarm optimization (PSO) which is among swarm-based algorithms and gravity search algorithm (GSA) among physics-based algorithms and charged system search (CSS) algorithm, which are all well-known in the literature. The efficient use of energy in electrically powered flying mechanisms is important in terms of completing its task. The aim of this study is to obtain proportional–integral–derivative (PID) coefficients that minimize the energy consumption caused by quadrotor moments. First of all, 12 PID coefficients calculated with traditional Ziegler Nicholes, and trying-error methods for the control of the quadrotor have been trained with DE, PSO, GSA and CSS algorithms and their cost values have been found for this problem. In the study, optimum PID coefficients have been found separately with each algorithm and torque data giving energy efficiency have been obtained by applying them to the state equations. Although the cost minimization convergence value obtained from DE does not look good compared to other algorithms, it has been observed that the moment values of the obtained PID coefficients in the control program are lower. In the study, it has been shown that the PID coefficients obtained from DE reach the target with approximately less energy than the maximum-moment value of the PSO, which provides the closest moment value. It can be thought that this value contributes to energy consumption in each orbital movement of the quadrotor. The simulation results show that the coefficients obtained from DE provide better energy efficiency and are superior to other algorithms compared in terms of energy efficiency. • PID coefficients for quadrotor control are optimized with DE,PSO,CSS,GSA algorithms • The torque values to be applied to each motor were adjusted with these coefficients • The total force applied with DEPID in the z direction is smaller than others • DEPID consumes less energy than the other algorithms in the paper [ABSTRACT FROM AUTHOR]

• A novel cooperative hybrid evolutionary algorithm is designed for large scale MMSP. • Hybrid assignment and selection strategies are proposed based on the CC framework. • New evolutionary operations are adopted for the unit assignment and order sequence. As an important part of batch chemical industry scheduling problems, the multi-stage multi-product batch plant scheduling problem (MMSP) has been widely studied for decades. This problem is characterized by multiple stages with non-identical parallel units and operate based on customer orders. In this paper, we focus on the large scale MMSP and treat the minimization of make-span as the objective function. An efficient cooperative hybrid evolutionary algorithm is proposed based on the framework of cooperative co-evolution. First, a novel two-line encoding scheme is developed to represent the unit assignment and sequencing for orders respectively. Second, modified estimation of distribution algorithm (EDA) and differential evolutionary (DE) operations are proposed according to the feature of MMSP. EDA operation with a novel population-based incremental learning strategy is applied to handle the unit assignment variables. And novel DE operation based on a novel encoding method is adopted to deal with sequence variables. Then, two selection strategies are applied to preserve optimal and sub-optimal solutions for the proposed algorithm. The critical path based local search algorithm is adopted to further improve the efficiency of local optimization. The proposed algorithm has been tested by several instances with different sizes and characteristics. The numerical results and comparisons show that the proposed work is very competitive in solving large scale MMSP. [ABSTRACT FROM AUTHOR]

• An inertia weight is presented to balance exploration and exploitation better. • The neighbor learning component is adopted to enhance local search ability. • The updating mechanism is used to avoid getting stuck in local optima. • The proposed algorithm is verified on the classical functions, CEC2017 and four engineering design problems. Atom search optimization is a newly developed metaheuristic algorithm inspired by molecular basis dynamics. The main changes of premature convergence and poor balance between exploration and exploitation still persist, which cannot yet do well in solving some complex optimization problems. To solve the above problems and get better performance, an improved atom search optimization with nonlinear inertia weight factor, neighbor learning component and updating mechanisms is proposed in this paper. First, to balance exploration and exploitation better, a nonlinear inertia weight factor is proposed to determine how much the previous velocity and acceleration is preserved. Second, to effectively increase the exchange of information among atoms, a neighbor learning component is integrated into the velocity updating equation, which is beneficial to enhance the exploitation ability. Thirdly, to help atoms jump out from the local optima, an updating mechanism of the best and worst atoms of the current population is proposed, and a greedy selection strategy is employed to boost the probability of finding the optimal solution. Finally, the well-known CEC2017 benchmark functions and four real-world engineering design problems were employed to demonstrate the performance of our algorithm. The experimental results and statistical analysis show that the performance of our algorithm is better than the comparison algorithms. [ABSTRACT FROM AUTHOR]

• This paper proposes an enhanced SCA algorithm variant, called ARSCA. • ARSCA improves the convergence accuracy and avoids premature convergence. • This paper compares ARSCA with classical algorithms, variations of other algorithms. • ARSCA is applied to six engineering design problems and its results are satisfactory. The sine cosine algorithm (SCA) is a well-known meta-heuristic optimization algorithm. SCA has received much attention in various optimization fields due to its simple structure and excellent optimization capabilities. However, the dimension of objective function also increases with the increasing complexity of optimization tasks. This makes the original SCA appear to have insufficient optimization capability and likely to fall into premature convergence. A multi-mechanism acting variant of SCA, called ARSCA, is proposed to address the above deficiencies. ARSCA is an enhanced SCA algorithm based on the adaptive quadratic interpolation mechanism (AQIM) and Rounding mechanism (RM). RM enables a more balanced state between exploration and exploitation of the ARSCA. AQIM enhances local exploitation capabilities. To verify the performance of ARSCA, we compared ARSCA with some advanced traditional optimization algorithms and variants of algorithms for 30 consecutive benchmark functions of IEEE CEC2014. In addition, ARSCA was applied to 6 constrained engineering optimization problems. These six algorithms include the tension–compression spring design problem, the welded beam design problem, the pressure vessel design problem, the I-beam design problem, the speed reducer design problem, and the three-bar design problem. Experimental results show that ARSCA outperforms its competitors in both the solution quality and the ability to jump out of the local optimum. The relevant codes for the paper are publicly available at https://github.com/YangXiao9799/paper_ARSCA. [ABSTRACT FROM AUTHOR]

• This paper proposes an enhanced SCA algorithm variant, called ARSCA. • ARSCA improves the convergence accuracy and avoids premature convergence. • This paper compares ARSCA with classical algorithms, variations of other algorithms. • ARSCA is applied to six engineering design problems and its results are satisfactory. The sine cosine algorithm (SCA) is a well-known meta-heuristic optimization algorithm. SCA has received much attention in various optimization fields due to its simple structure and excellent optimization capabilities. However, the dimension of objective function also increases with the increasing complexity of optimization tasks. This makes the original SCA appear to have insufficient optimization capability and likely to fall into premature convergence. A multi-mechanism acting variant of SCA, called ARSCA, is proposed to address the above deficiencies. ARSCA is an enhanced SCA algorithm based on the adaptive quadratic interpolation mechanism (AQIM) and Rounding mechanism (RM). RM enables a more balanced state between exploration and exploitation of the ARSCA. AQIM enhances local exploitation capabilities. To verify the performance of ARSCA, we compared ARSCA with some advanced traditional optimization algorithms and variants of algorithms for 30 consecutive benchmark functions of IEEE CEC2014. In addition, ARSCA was applied to 6 constrained engineering optimization problems. These six algorithms include the tension–compression spring design problem, the welded beam design problem, the pressure vessel design problem, the I-beam design problem, the speed reducer design problem, and the three-bar design problem. Experimental results show that ARSCA outperforms its competitors in both the solution quality and the ability to jump out of the local optimum. The relevant codes for the paper are publicly available at https://github.com/YangXiao9799/paper_ARSCA. [ABSTRACT FROM AUTHOR]

New metaheuristic algorithms have soared over the past ten years. A common practice in proposing a new algorithm is validating it on several benchmark functions and engineering problems. Although CEC benchmark problems are specifically designed to validate the performance of new meta-heuristics, engineering design problems from pressure vessels to springs have been used in hundreds of papers to prove algorithm efficiency. To date, no benchmark practices have been established yet, i.e., researchers design their own benchmark to validate their algorithm. Thus, the high number of new algorithms combined with the high number of different benchmarking setups complicates the comparing and validating processes. In this paper, we study benchmark practices related to engineering applications. In particular, our exhaustive qualitative systematic review focuses on metaheuristics applied to the tension/compression spring design problem (TCSDP). The aim of this study is threefold: (i) evaluate where the field stands in regards of algorithm performance on the TCSDP, (ii) evaluate benchmarking practices, and (iii) facilitate future algorithm comparison. For these purposes, we first review all the existing metaheuristics applied to the TCSDP in their first publication. For each paper, we gather the data regarding the problem definition, the simulation setup, and the optimized design. We evaluated the data through several metrics to find the best-optimized design so far. Our findings and analysis concluded that the field of metaheuristics and its benchmarking practice have not reached maturity yet. Thus, we recommend some actions to address the issues and provide future research directions. [ABSTRACT FROM AUTHOR]

• We introduce an RVRP where the last-mile delivery of some demands can be outsourced. • We propose construction and improvement heuristics handling outsourcing decisions. • The routes include the driving and rest periods according to European regulations. • We solve 60 artificial instances using our algorithms in classic metaheuristics. • The impact of the construction procedure and the outsourcing decisions are evaluated. This paper addresses a Rich Vehicle Routing Problem (RVRP) characterized by the following attributes: long-haul transport, driver hours regulation, incompatibility among goods, multiple depots and pickup locations, heterogeneous vehicles, time windows, and outsourcing decisions for last-mile delivery. Addressing the latter aspect is especially challenging, since it requires substantial changes in the algorithms for generating initial feasible solutions (construction heuristic) and for modifying existing solutions (improvement heuristics). Our work develops new heuristics adapted to the above attributes, and evaluates their performance in combination with common solving metaheuristics. We also assess the impact and the cost-effectiveness of the outsourcing attribute. [ABSTRACT FROM AUTHOR]

Highlights • Decomposition based controlled variable selection is proposed. • Metaheuristic algorithms for controlled variable selection is proposed. • Different levels of partitioning/decomposition are examined for optimality. • The techniques reduce computational time greatly with little loss of optimality. Abstract Selection of primary controlled variables (CVs) with due consideration of economic loss and ease of control is an important step for achieving optimal plant operation under design and off-design conditions. However, the computational expense of the combinatorial optimization step that is undertaken for CV selection renders the existing approaches unaffordable for fast selection of optimal CVs. Two approaches are proposed in this paper for improving the computational efficiency of the optimization step. Typically, the CV selection process is typically executed by considering the entire plant together. Opposed to that, the first approach proposed here seeks to decompose the process plant into multiple partitions based on the connectivity strength. Then the CV selection algorithm can be executed on each partition independently. The decomposition algorithm is biomimetic and has been developed, in analogy to neuroscience, mimicking how the information about the connectivity information is extracted using a dynamic casual model. This approach can significantly decrease the number of combinatorial optimization problems that needs to be solved and facilitates parallelization of the solution. In the second approach, a multiagent optimization framework is proposed that utilizes metaheuristic optimization strategies such as the efficient ant colony algorithm, simulated annealing and the genetic algorithm. These two approaches can be used by themselves or in combination. This framework enables cooperative search by a group of algorithmic agents facilitated through an information sharing protocol. These two approaches are applied to a toy problem and an acid gas removal unit as part of an integrated gasification combined cycle. The study shows how the computational time and economic and control performance of the optimal CV sets vary as the number of partitions are changed. [ABSTRACT FROM AUTHOR]

• The snake optimization algorithm (SOA) and the Improved snake optimization algorithm (ISOA) are proposed to extract the parameters for photovoltaic cells. • The performance of SOA and ISOA is compared with the ones of the best algorithms from specialized literature. • ISOA proved their performance in comparison with the algorithms considered for the three photovoltaic cells analyzed. The accurate extraction of photovoltaic cells and panels parameters is very important in order to precisely forecast their generated energy, to rapidly identify the maximum power point, both for the manufacturer in order to verify the quality control during the production process, and for the researchers to improve their quality, efficiency and also study the photovoltaic cells degradation. This paper is the first to propose the usage of the Snake optimization metaheuristic algorithms to extract the parameters of three photovoltaic cells: monocrystalline commercial silicon, amorphous silicon, and RTC France. The Snake algorithms are used for the one diode and two diode models to extract five and seven parameters respectively. The root mean square error statistical test has been performed in order to prove the algorithm performance. The comparison with the algorithms published in specialized literature reveals that the Snake algorithm outperforms several others, but is not the best. An improved version is developed and the results show that it gives better results than, or at least the same as the best ones. The improvement in root mean square error, when the improved snake algorithm is used, is 16% in the case of the monocrystalline silicon photovoltaic cell for the two diode model, 5.3% in the case of the amorphous silicon photovoltaic cell for the two diode model, and it is slightly better for the RTC France photovoltaic cell, from 0.002 to 0.11% when the best algorithms are considered. The Snake algorithms give very good results, especially the improved one, even for a small population size and a limited number of iterations. Thus, for the improved snake algorithm, the iterations number and the population size are 100 and 80, in the case of the monocrystalline photovoltaic cells, for one diode model, and 200 and 40 respectively for two diode model, 100 and 120 in the case of the amorphous silicon photovoltaic cell for one diode model and 120 and 120 respectively for two diode model, 150 and 100 in the case of RTC photovoltaic cell for one diode model and 150 and 80 respectively for two diode model. This reduces the computational time for the extraction of the photovoltaic cell parameters. The computational time for the improved snake algorithm is half of the necessary one for one of the best algorithms, the hybrid successive discretization algorithm. Therefore, the snake optimization algorithm, especially the improved one is one of the best algorithms that can be used for the parameters extraction of the photovoltaic cells. [ABSTRACT FROM AUTHOR]

A large number of metaheuristic algorithms have been proposed in the last three decades, but no metaheuristic algorithm is superior to the others for all the optimization problems. It is laborious to select an appropriate metaheuristic algorithm to solve a problem, especially for laymen. In this paper, a framework for co-evolutionary algorithm using Q-learning with the meme is proposed, which is called as QLMA. The solution generation method in the metaheuristic algorithm is named meme, which is also viewed as the action for an agent in Q-learning, and multiple memes form the action set. In the initial stage, the tent map and opposition based learning are employed to obtain the initial population. In updating stage, a new population is generated by an action that is chosen from the action set by the agent in Q-learning, then the disruption operation is applied, avoiding excessive aggregation of solutions around the current global optimal solution and improving the balance between exploration and exploitation. QLMA is compared to sixteen algorithms on 23 classical benchmark functions, CEC 2017, and CEC 2019 benchmark functions. The experimental results demonstrate that QLMA is superior to the peer algorithms and has a good balance between exploration and exploitation. [ABSTRACT FROM AUTHOR]

Metaheuristics, providing high level guidelines for heuristic optimisation, have successfully been applied to many complex problems over the past decades. However, their performances often vary depending on the choice of the initial settings for their parameters and operators along with the characteristics of the given problem instance handled. Hence, there is a growing interest into designing adaptive search methods that automate the selection of efficient operators and setting of their parameters during the search process. In this study, an adaptive binary parallel evolutionary algorithm, referred to as ABPEA, is introduced for solving the uncapacitated facility location problem which is proven to be an NP-hard optimisation problem. The approach uses a unary and two other binary operators. A reinforcement learning mechanism is used for assigning credits to operators considering their recent impact on generating improved solutions to the problem instance in hand. An operator is selected adaptively with a greedy policy for perturbing a solution. The performance of the proposed approach is evaluated on a set of well-known benchmark instances using ORLib and M*, and its scaling capacity by running it with different starting points on an increasing number of threads. Parameters are adjusted to derive the best configuration of three different rewarding schemes, which are instant, average and extreme. A performance comparison to the other state-of-the-art algorithms illustrates the superiority of ABPEA. Moreover, ABPEA provides up to a factor of 3.9 times acceleration when compared to the sequential algorithm based on a single-operator. • This paper proposes a multi-threaded adaptive evolutionary algorithm. • The proposed approach (ABPEA) is tested on the well-known binary-encoded problem UFLP. • An operator is selected adaptively with a greedy policy for perturbing a solution. • Three rewarding schemes, which are instant, average and extreme, are discussed. • Effect of varying the number of threads on the performance of ABPEA is investigated. [ABSTRACT FROM AUTHOR]

• An improved metaheuristic algorithm named the Elite Marine Predators Algorithm (EMPA) is designed. • The proposed algorithm is used to solve the directional overcurrent relay coordination problem. • The EMPA algorithm is used to find the optimal relays settings and operating times in four different power systems (3-bus, 8-bus, 9-bus and 15-bus). • The results using EMPA algorithm were compared against those of well-regarded and recent published algorithms and proved to have superior performance. The integration of renewable energy sources in the distribution network (DN) has had a significant influence by reducing power loss and enhancing network dependability. Aside from that, the protection system has met coordination issues as a result of bidirectional power flow and variations in fault levels. Therefore, an optimal coordination strategy is required to deal with relays coordination problem. The coordination problem of the directional overcurrent relays (DOCRs) is a restricted optimization issue that involves determining appropriate time dial settings (TDS) and plug setting (PS) to reduce relays operating time. Currently, a various nontraditional optimization strategies have been presented to overcome this challenge. In this paper, a modified version of the marine predators algorithm (MPA) referred to as Elite marine predator (EMPA) is developed for the optimal coordination of DOCRs. Therefore, the EMPA method is used to find out the optimal settings for the DOCRs problem. The suggested algorithm's performance is evaluated using standard test systems, including 3-bus, 8-bus, 9-bus, and 15-bus. The findings are compared with the traditional MPA and with other recent optimization methods presented in the literature to prove the efficiency and superiority of the proposed EMPA in reducing relay operation time for optimal DOCRs coordination. [ABSTRACT FROM AUTHOR]

The Whale Optimization Algorithm (WOA) is a new advanced algorithm that is based on the humpback whale chasing process. The main problem addressed by Whale Optimization Algorithm, similar to other metaheuristic algorithms, is premature convergence. This paper introduces the Sine Cosine Algorithm in the Whale Optimization Algorithm optimization process to enhance global convergence and to improve enactment. The proposed algorithm, called WOA-SCA, has local optima evasion of Whale Optimization Algorithm and high capability to increase the exploration. The implementation of the proposed WOA-SCA algorithm is investigated through a series of tests on common benchmark test functions, with the results compared to those of six alternative algorithms. The results of the investigations show that the proposed WOA-SCA algorithm works better in concert with the outputs of the benchmark functions. Also, to validate the proficiencies of the WOA-SCA, it has been used to resolve the real-world problem of Facial Emotion Recognition (FER). The field of facial emotion recognition is a fascinating new area of research that gives us the ability to identify the human face's expression in natural settings. A large part of the standard methodologies certainly does not indicate the looks because the attitudes depend on the human face sections' behaviors. The paper proposes the efficient Facial Emotion Recognition method using MultiSVNNN based on WOA-SCA (the proposed WOA-SCA based Multi-Support Vector Neural Network). Using the ADFES dataset for the disgust expression, our results demonstrate that the proposed work yields average emotion recognition accuracy of 98% associated to 80% and 96% based on BBPSO and MFOPSO, respectively. Investigational consequences indicate the virtuous enactment of the proposed scheme resolutions regarding precision. [ABSTRACT FROM AUTHOR]

• Three powerful metaheuristic algorithms are developed for optimum seismic design of steel frames. • The optimization algorithms tested on three benchmark problems including large-scale spatial steel frames. • Hybrid learning based jaya algorithm is the best optimizer in terms of minimum structural weight and computational cost. • The performance of proposed algorithms is insensitive to randomly generated initial populations. In this paper, three powerful metaheuristic algorithms, modified teaching learning based optimization, modified jaya algorithm and hybrid learning based jaya algorithm are presented for optimized seismic design of planar/spatial steel frames. The hybrid learning based jaya algorithm combines the learning phase of teaching learning based optimization and jaya algorithm. The goal is to design steel frames of minimum weight under strength, interstory drift and geometric-size constraints. One planar and two spatial steel frames previously designed for minimum weight by different metaheuristic optimization methods are taken as design examples to test the proposed methods. The methods presented in this paper are compared with other referenced algorithms in terms of optimized weight and computational cost. It is found that the hybrid learning based jaya algorithm outperforms modified teaching learning based optimization, modified jaya algorithm and its other competitors in all test problems. [ABSTRACT FROM AUTHOR]

We are interested in the solution of the maximum k -balanced subgraph problem. Let G = (V , E , s) be a signed graph and k a positive scalar. A signed graph is k -balanced if V can be partitioned into at most k sets in such a way that positive edges are found only within the sets and negative edges go between sets. The maximum k -balanced subgraph problem is the problem of finding a subgraph of G that is k -balanced and maximum according to the number of vertices. This problem has applications in clustering problems appearing in collaborative v s conflicting environments. The particular case k = 2 yields the problem of finding a maximum balanced subgraph in a signed graph and its exact solution has been addressed before in the literature. In this paper, we provide a representatives formulation for the general problem and present a partial description of the associated polytope, including the introduction of strengthening families of valid inequalities. A branch-and-cut algorithm is described for finding an optimal solution to the problem. An ILS metaheuristic is implemented for providing primal bounds for this exact method and a branching rule strategy is proposed for the representatives formulation. Computational experiments, carried out over a set of random instances and on a set of instances from an application, show the effectiveness of the valid inequalities and strategies adopted in this work. [ABSTRACT FROM AUTHOR]

Research highlights • A destination-based model for subloop-based shipping network alteration is proposed. • Optimization problem of port rotation directions is proved to belong to NP-hard class. • The model is transformed to an equivalent mixed-integer linear programming model. • A Benders decomposition method incorporating three acceleration strategies is developed. Abstract Container liner shipping network alteration is a practical manner of shipping network design, which aims to make minor modifications to ameliorate the existing network. In a generic liner shipping network with butterfly ports, each ship route is separated into a set of subloops on the basis of its structure and internal butterfly ports. Reversing the subloop directions has an impact on the network-wide cost including inventory cost, transshipment cost, and slot-purchasing cost. This paper proposes a new destination-based nonlinear model for the subloop-based reversal of port rotation directions with the objective of minimizing the overall network-wide cost. We prove that the addressed problem is NP-hard. Next, the model is transformed to an equivalent mixed-integer linear programming model. Based on the structure of the reformulated model, we develop a Benders decomposition (BD) algorithm and a metaheuristic method to solve practical-size instances. Three acceleration strategies are incorporated into the BD algorithm, which are adding Pareto-optimal cuts, updating big-M coefficients and generating combinatorial Benders cuts. Case studies based on three small examples and an Asia-Europe-Oceania liner shipping network with a total of 46 ports are conducted. Results show that the problem could be efficiently solved by the accelerated BD algorithm and the optimization of subloop directions is conducive to decreasing the network-wide cost especially the inventory cost. [ABSTRACT FROM AUTHOR]

This paper presents a novel metaheuristic algorithm called queuing search (QS), which is inspired from human activities in queuing. Some common phenomena are considered in QS: (1) customers actively follow the queue that provides fast service; (2) each customer service is mainly affected by the staff or customer itself; and (3) a customer can be influenced by others during the service when the queue order is not strictly maintained. The performance of QS is tested on 30 bound-constrained benchmark functions scalable with 30 and 100 dimensions from CEC 2014, 5 standard and 4 challenging constrained engineering optimization problems. Meanwhile, comparisons are performed among the results of QS and some state-of-the-art or well-known metaheuristic algorithms. [ABSTRACT FROM AUTHOR]

In this paper a novel nature-inspired optimization paradigm is proposed called Moth-Flame Optimization (MFO) algorithm. The main inspiration of this optimizer is the navigation method of moths in nature called transverse orientation. Moths fly in night by maintaining a fixed angle with respect to the moon, a very effective mechanism for travelling in a straight line for long distances. However, these fancy insects are trapped in a useless/deadly spiral path around artificial lights. This paper mathematically models this behaviour to perform optimization. The MFO algorithm is compared with other well-known nature-inspired algorithms on 29 benchmark and 7 real engineering problems. The statistical results on the benchmark functions show that this algorithm is able to provide very promising and competitive results. Additionally, the results of the real problems demonstrate the merits of this algorithm in solving challenging problems with constrained and unknown search spaces. The paper also considers the application of the proposed algorithm in the field of marine propeller design to further investigate its effectiveness in practice. Note that the source codes of the MFO algorithm are publicly available at http://www.alimirjalili.com/MFO.html . [ABSTRACT FROM AUTHOR]

Multi-level image thresholding is a common approach to image segmentation where an image is divided into several regions based on its histogram. Otsu's method is the most popular method for this purpose, and is based on seeking for threshold values that maximise the between-class variance. This requires an exhaustive search to find the optimal set of threshold values, making image thresholding a time-consuming process. This is especially the case with increasing numbers of thresholds since, due to the curse of dimensionality, the search space enlarges exponentially with the number of thresholds. Population-based metaheuristic algorithms are efficient and effective problem-independent methods to tackle hard optimisation problems. Over the years, a variety of such algorithms, often based on bio-inspired paradigms, have been proposed. In this paper, we formulate multi-level image thresholding as an optimisation problem and perform an extensive evaluation of 23 population-based metaheuristics, including both state-of-the-art and recently introduced algorithms, for this purpose. We benchmark the algorithms on a set of commonly used images and based on various measures, including objective function value, peak signal-to-noise ratio, feature similarity index, and structural similarity index. In addition, we carry out a stability analysis as well as a statistical analysis to judge if there are significant differences between algorithms. Our experimental results indicate that recently introduced algorithms do not necessarily achieve acceptable performance in multi-level image thresholding, while some established algorithms are demonstrated to work better. [ABSTRACT FROM AUTHOR]

The Asymmetric Traveling Salesman Problem (ATSP), as a branch of the traveling salesman problem, aims to find a group of circuits when a salesman travels all cities at the minimum cost and returns to the starting city under the condition of different round-trip costs between the two cities. Mayfly Algorithm (MA) is a swarm-based metaheuristic algorithm, which has been applied to many fields successfully. In this paper, we arrange all cities on the sphere. A Discrete Mayfly Algorithm (DMA) for solving spherical asymmetric traveling salesman problem is proposed. The algorithm applies inver-over operator, crossover operator and 3-opt operator to simplify the parameters of the algorithm, enrich the diversity of the population and enhance the local search ability. By experimenting, analyzing and comparing the effects of DMA and other metaheuristic algorithms in twelve scales, this study proves that the proposed algorithm is superior to others for the spherical ATSP, especially in high-dimensional cases. [ABSTRACT FROM AUTHOR]

Wind resource is one of the most promising renewable energy, which has become a suitable replacement for fossil fuels. Optimizing the transferring wind energy from a wind turbine is essential to obtain the maximum power output as other variables are uncontrollable. This paper presents four different optimization algorithms, namely ant lion optimization (ALO), whale optimization algorithm (WOA), particle swarm optimization (PSO), and crow search optimization (CSO), considering a hybrid decision-making model to compare the performances of wind energy optimization. In the first phase, the evolutionary algorithms are defined based on several factors to meet the need for wind energy based on volumetric and time reliability, reversibility, and vulnerability as well as evaluate optimized energy to the subscriber from the Gansu region. In the second phase, the ordinal priority approach (OPA) is coupled with VIseKriterijumska Optimizacija I Kompromisno Resenje (VIKOR) method to rank the evolutionary algorithms. Then, the results are compared with the absolute optimal response based on the nonlinear programming method obtained from GAMS software. The results demonstrate that an ALO outperforms other algorithms. The average accuracy of ALO is 92%. CSO is the least accurate with 55% of the absolute optimal response. ALO is found to be faster, more efficient, and achieved economy and reliability as compared to other optimization algorithms for solving the problem under consideration. It is shown that the applied models are robust, effective, and able to save costs. [ABSTRACT FROM AUTHOR]

In this paper, a resource constrained project scheduling problem with hierarchical alternatives and stochastic activity durations is studied. A stochastic chance constraint is introduced to formulate this problem. A metaheuristic framework called SAA/DAAA through integrating the sampling average approximation (SAA) with the population-based evolutionary artificial algae algorithm (AAA) is developed to solve the problem due to the NP-hardness nature of the problem. The priority-selection list (PSL) and schedule generation scheme (SGS) are introduced for local search. Experiments with different sizes (50-scale, 100-scale, 150-scale) as well as different uncertainty levels (moderate, medium, high) are used as examples to illustrate and validate the proposed method. The influences of sample size, sampling times and confidence level are also analyzed during experiments. In addition, the proposed discrete AAA (DAAA) is compared with classic GA and numerical experiments show that the SAA/DAAA outperforms the SAA/GA in terms of both objectives and solving time. [ABSTRACT FROM AUTHOR]