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]

Studies indicate cardiac arrhythmia is one of the leading causes of death in the world. The risk of a stroke may be reduced when an irregular and fast heart rate is diagnosed. Since it is non-invasive, electrocardiograms are often used to detect arrhythmias. Human data input may be error-prone and time-consuming because of these limitations. For early detection of heart rhythm problems, it is best to use deep learning models. In this paper, a hybrid bio-inspired algorithm has been proposed by combining whale optimization (WOA) with adaptive particle swarm optimization (APSO). The WOA is a recently developed meta-heuristic algorithm. APSO is used to increase convergence speed. When compared to conventional optimization methods, the two techniques work better together. MIT-BIH dataset has been utilized for training, testing and validating this model. The recall, accuracy, and specificity are used to measure efficiency of the proposed method. The efficiency of the proposed method is compared with state-of-art methods and produced 98.25 % of accuracy. [ABSTRACT FROM AUTHOR]

Many-objective optimization problems are today ever more common. The decomposition-based approach stands out among the evolutionary algorithms used for their solution, with MOEA/D and its variations playing significant roles. MOEA/D variations seek to improve weight vector definition, improve the dynamic adjustment of weight vectors during the evolution process, improve the evolutionary operators, use alternative decomposition methods, and hybridize with other metaheuristics, among others. Although an essential topic for the success of MOEA/D depends on how well the weight vectors are defined when decomposing the problem, not as much research has been performed on this topic as on the others. This paper proposes using a new mathematical object called augmented covering arrays (ACAs) that enable a better sampling of interactions of M objectives using the least number of weight vectors based on an interaction level (strength), defined a priori by the user. The proposed method obtains better results, measured in inverted generational distance, using small to medium populations (up to 850 solutions) of 30 to 100 objectives over DTLZ and WFG problems against the traditional weight vector definition used by MOEA/D-DE and results obtained by NSGA-III. Other MOEA/D variations can include the proposed approach and thus improve their results. [ABSTRACT FROM AUTHOR]

This paper proposes the Love Evolution Algorithm (LEA), a novel evolutionary algorithm inspired by the stimulus–value–role theory. The optimization process of the LEA includes three phases: stimulus, value, and role. Both partners evolve through these phases and benefit from them regardless of the outcome of the relationship. This inspiration is abstracted into mathematical models for global optimization. The efficiency of the LEA is validated through numerical experiments with CEC2017 benchmark functions, outperforming seven metaheuristic algorithms as evidenced by the Wilcoxon signed-rank test and the Friedman test. Further tests using the CEC2022 benchmark functions confirm the competitiveness of the LEA compared to seven state-of-the-art metaheuristics. Lastly, the study extends to real-world problems, demonstrating the performance of the LEA across eight diverse engineering problems. Source codes of the LEA are publicly available at https://ww2.mathworks.cn/matlabcentral/fileexchange/159101-love-evolution-algorithm. [ABSTRACT FROM AUTHOR]

The Manta Ray Foraging Optimization Algorithm (MRFO) is a metaheuristic algorithm for solving real-world problems. However, MRFO suffers from slow convergence precision and is easily trapped in a local optimal. Hence, to overcome these deficiencies, this paper proposes an Improved MRFO algorithm (IMRFO) that employs Tent chaotic mapping, the bidirectional search strategy, and the Levy flight strategy. Among these strategies, Tent chaotic mapping distributes the manta ray more uniformly and improves the quality of the initial solution, while the bidirectional search strategy expands the search area. The Levy flight strategy strengthens the algorithm's ability to escape from local optimal. To verify IMRFO's performance, the algorithm is compared with 10 other algorithms on 23 benchmark functions, the CEC2017 and CEC2022 benchmark suites, and five engineering problems, with statistical analysis illustrating the superiority and significance of the difference between IMRFO and other algorithms. The results indicate that the IMRFO outperforms the competitor optimization algorithms. [ABSTRACT FROM AUTHOR]

Arithmetic optimization algorithm (AOA) is a meta-heuristic optimization method based on mathematical operators proposed in recent years. Although it has good performance, it can also lead to insufficient local search ability and falling into local optima when solving complex optimization problems. In order to make up for the above shortcomings, the optimization performance of AOA is further improved. This paper proposes a hybrid algorithm based on AOA and particle swarm optimization (PSO) called HAOAPSO. Firstly, a compound opposition-based learning (COBL) strategy is introduced to broaden the scope of finding optimal solutions to help the algorithm better jump out of local optima. Secondly, PSO is combined with AOA that integrates COBL to improve the algorithm's local search ability, so as to improve the overall search efficiency of the algorithm. In addition, experiments are performed on 23 classical benchmark functions with different characteristics and five engineering design optimization problems, and the experimental results of HAOAPSO are compared with those of other well-known optimization algorithms to comprehensively evaluate the performance of the proposed algorithm. The simulation results show that HAOAPSO can provide better solutions in most cases when solving global optimization problems such as engineering, with better convergence speed and accuracy. [ABSTRACT FROM AUTHOR]

The location planning of relief distribution centres (DCs) is crucial in humanitarian logistics as it directly influences the disaster response and service to the affected victims. In light of the critical role of facility location in humanitarian logistics planning, the study proposes a two-stage relief distribution location problem. The first stage of the model determines the minimum number of relief DCs, and the second stage find the optimal location of these DCs to minimize the total cost. To address a more realistic situation, restrictions are imposed on the coverage area and capacity of each DCs. In addition, for optimally solving this complex NP-hard problem, a novel two-phase algorithm with exploration and exploitation phase is developed in the paper. The first phase of the algorithm i.e., exploration phase identifies a near-optimal solution while the second phase i.e. exploitation phase enhances the solution quality through a close circular proximity investigation. Furthermore, the comparative analysis of the proposed algorithm with other well-known algorithms such as genetic algorithm, pattern search, fmincon, multistart and hybrid heuristics is also reported and computationally tested from small to large data sets. The results reveal that the proposed two-phase algorithm is more efficient and effective when compared to the conventional metaheuristic methods. [ABSTRACT FROM AUTHOR]

In recent years, there is massive development of new metaheuristics as stochastic methods. Meanwhile, there is not any metaheuristics is powerful to handle all problems as stated in the no-free-lunch (NFL) theory. Based on this circumstance, this paper introduces a new swarm-based metaheuristics with the main strategy moving toward the resultant of better swarm members and avoiding the resultant of worse swarm members called group better-worse algorithm (GBWA). It consists of five searches: moving toward the best swarm member, moving toward the resultant of better swarm members, moving away from the resultant of worse swarm members, searching locally, and jumping to the opposite area. GBWA is then evaluated in three ways. The first evaluation is a comparative evaluation where GBWA is compared to five recent metaheuristics: coati optimization algorithm (COA), average and subtraction-based optimization (ASBO), clouded leopard optimization (CLO), total interaction algorithm (TIA), and osprey optimization algorithm (OOA). The second evaluation is the individual search evaluation. The third evaluation is hyperparameter test. The collection of 23 classic functions is chosen as the use case in all evaluations. The result of the first evaluation shows that GBWA is better than COA, ASBO, CLO, TIA, and OOA in 20, 21, 20, 21, and 21 functions consecutively. Meanwhile, the result of the second evaluation shows the equal contribution between the motion toward the best swarm member and the motion toward the resultant of better swarm members. [ABSTRACT FROM AUTHOR]

The utilization of cloud computing environments is highly popular for carrying out workflow executions due to its ability to provide clients with immediate access to computing resources. Among the various workflow scheduling problems in the cloud, deadline-constrained workflow scheduling has garnered increasing attention in recent years. This paper introduces a hybrid scheduling algorithm known as Partial Critical Path–Ant Colony Optimization (PCP–ACO), which aims to minimize the execution cost of a workflow while ensuring that it meets the user-defined deadline in cloud environments. PCP–ACO is a list scheduling algorithm that combines the PCP heuristic algorithm with the meta-heuristic ACO to achieve faster convergence. The list scheduling algorithm consists of two phases: task ordering and resource selection. In the case of PCP–ACO, the first step involves calculating a topological sort of the workflow tasks to assign priority to each task. Subsequently, the ACO meta-heuristic is employed to allocate the appropriate resource to each task of the workflow, based on their respective sub-deadlines that are computed using the PCP heuristic. In order to evaluate the effectiveness of the proposed algorithm, several experiments were conducted using five real scientific workflows. The results demonstrate that PCP–ACO outperforms the IC-PCP, L-ACO, and HP-GA algorithms in terms of average execution cost, achieving reductions of 19%, 17.3%, and 21.5%, respectively. [ABSTRACT FROM AUTHOR]

Metaheuristics are commonly employed as a means of solving many distinct kinds of optimization problems. Several natural-process-inspired metaheuristic optimizers have been introduced in the recent years. The convergence, computational burden and statistical relevance of metaheuristics should be studied and compared for their potential use in future algorithm design and implementation. In this paper, eight different variants of dragonfly algorithm, i.e. classical dragonfly algorithm (DA), hybrid memory-based dragonfly algorithm with differential evolution (DADE), quantum-behaved and Gaussian mutational dragonfly algorithm (QGDA), memory-based hybrid dragonfly algorithm (MHDA), chaotic dragonfly algorithm (CDA), biogeography-based Mexican hat wavelet dragonfly algorithm (BMDA), hybrid Nelder-Mead algorithm and dragonfly algorithm (INMDA), and hybridization of dragonfly algorithm and artificial bee colony (HDA) are applied to solve four industrial chemical process optimization problems. A fuzzy multi-criteria decision making tool in the form of fuzzy-measurement alternatives and ranking according to compromise solution (MARCOS) is adopted to ascertain the relative rankings of the DA variants with respect to computational time, Friedman's rank based on optimal solutions and convergence rate. Based on the comprehensive testing of the algorithms, it is revealed that DADE, QGDA and classical DA are the top three DA variants in solving the industrial chemical process optimization problems under consideration. [ABSTRACT FROM AUTHOR]

The Artificial Electric Field Algorithm (AEFA) stands out as a physics-inspired metaheuristic, drawing inspiration from Coulomb's law and electrostatic force; however, while AEFA has demonstrated efficacy, it can face challenges such as convergence issues and suboptimal solutions, especially in high-dimensional problems. To overcome these challenges, this paper introduces a modified version of AEFA, named mAEFA, which leverages the capabilities of Lévy flights, simulated annealing, and the Adaptive s-best Mutation and Natural Survivor Method (NSM) mechanisms. While Lévy flights enhance exploration potential and simulated annealing improves search exploitation, the Adaptive s-best Mutation and Natural Survivor Method (NSM) mechanisms are employed to add more diversity. The integration of these mechanisms in AEFA aims to expand its search space, enhance exploration potential, avoid local optima, and achieve improved performance, robustness, and a more equitable equilibrium between local intensification and global diversification. In this study, a comprehensive assessment of mAEFA is carried out, employing a combination of quantitative and qualitative measures, on a diverse range of 29 intricate CEC'17 constraint benchmarks that exhibit different characteristics. The practical compatibility of the proposed mAEFA is evaluated on five engineering benchmark problems derived from the civil, mechanical, and industrial engineering domains. Results from the mAEFA algorithm are compared with those from seven recently introduced metaheuristic algorithms using widely adopted statistical metrics. The mAEFA algorithm outperforms the LCA algorithm in all 29 CEC'17 test functions with 100% superiority and shows better results than SAO, GOA, CHIO, PSO, GSA, and AEFA in 96.6%, 96.6%, 93.1%, 86.2%, 82.8%, and 58.6% of test cases, respectively. In three out of five engineering design problems, mAEFA outperforms all the compared algorithms, securing second place in the remaining two problems. Results across all optimization problems highlight the effectiveness and robustness of mAEFA compared to baseline metaheuristics. The suggested enhancements in AEFA have proven effective, establishing competitiveness in diverse optimization 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]

Metaheuristic algorithms, widely applied across various domains due to their simplicity and strong optimization capabilities, play a crucial role in problem-solving. While the Aquila Optimizer is recognized for its effectiveness, it often exhibits slow convergence rates and susceptibility to local optima in certain scenarios. To address these concerns, this paper introduces an enhanced version, termed Tent-enhanced Aquila Optimizer (TEAO). TEAO incorporates the Tent chaotic map to initialize the Aquila population, promoting a more uniform distribution within the solution space. To balance exploration and exploitation, novel formulas are proposed, accelerating convergence while ensuring precision. The effectiveness of the TEAO algorithm is validated through a comprehensive comparison with 14 state-of-the-art algorithms using 23 classical benchmark test functions. Additionally, to assess the practical feasibility of the approach, TEAO is applied to six constrained engineering problems and benchmarked against the performance of the same 14 algorithms. All experimental results consistently demonstrate that TEAO outperforms other advanced algorithms in terms of solution quality and stability, establishing it as a more competitive choice for optimization tasks. [ABSTRACT FROM AUTHOR]

A new swarm-based metaheuristic, namely the enriched coati osprey algorithm (ECOA), is proposed in this paper. As its name suggests, ECOA hybridizes two new metaheuristics, the coati optimization algorithm (COA) and the osprey optimization algorithm (OOA). ECOA is constructed by five searches performed sequentially by the swarm members. The first three are directed searches, while the last two are neighborhood searches. All three directed searches are adopted from COA and OOA. Meanwhile, the four-bordered neighborhood search is developed based on a new approach. During the assessment, ECOA was challenged to overcome the set of 23 functions and contended with five new metaheuristics: total interaction algorithm (TIA), golden search optimization (GSO), average and subtraction-based optimization (ASBO), COA, and OOA. The result shows that ECOA outperforms TIA, GSO, ASBO, COA, and OOA in 16, 23, 18, 21, and 21 functions. Meanwhile, the individual search test result shows that the directed searches perform better than the neighborhood searches. Moreover, the directed search toward the best member becomes the most dominant search. [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]

Meta-heuristic algorithms have the advantages of resilience, global optimization capacity, and coding flexibility, making them helpful in tackling difficult optimization issues. The enhanced wind-driven optimization (CHTWDO) that was proposed in this paper coupled the chaotic map approach and the hyperbolic tangent with the T-distribution mutation method. The initial air particles are evenly distributed in the system space through a tent mapping strategy. Meanwhile, the variation probability of the hyperbolic tangent model and the T-distribution variation method are used to improve the comprehensive performance of the algorithm. In this way, the global search accuracy and the ability of avoiding the extreme value of the algorithm can be taken into account. Combining the three strategies, CHTWDO had higher global search accuracy and a stronger ability to jump out of local extremum. Comparing with the eight meta-heuristic algorithms (including WDO) and the single strategy improved WDO on 24 test functions, the experimental results show that CHTWDO with two improved strategies has better convergence precision and faster convergence speed. Statistical tests such as Friedman's and Wilcoxon's rank-sum tests are used to determine significant differences between these comparison algorithms. Finally, CHTWDO also obtains the best results on four classical optimization problems in engineering applications, which verifies its practicality and effectiveness. [ABSTRACT FROM AUTHOR]

This paper proposes a hybrid metaheuristic approach to optimize a duty cycle framework based on Seagull and Mayfly Optimization (HSMO-DC) Algorithm. This approach becomes crucial as current clustering protocols are unable to efficiently tune the clustering parameters in accordance to the diversification of varying WSNs. The proposed HSMO-DC primarily has two parts, where the first part takes care of the online cluster head selection and network communication using the seagull algorithm while the second part performs parameter optimization using the mayfly algorithm. The seagull is aimed at improving the energy distribution in the network through an effective bandwidth allocation procedure while reducing the total energy dissipation. Comparatively, with other clustering protocols, our proposed methods reveal an enhanced network lifetime with an improved network throughput and adaptability based on selected standard metric of performance measurement. [ABSTRACT FROM AUTHOR]

Load forecasting is a research hotspot in academia; in the context of new power systems, the prediction and determination of load reserve capacity is also important. In order to adapt to new forms of power systems, a day-ahead automatic generation control (AGC) reserve capacity demand prediction method based on the Fourier transform and the attention mechanism combined with a bidirectional long and short-term memory neural network model (Attention-BiLSTM) optimized by an improved whale optimization algorithm (IWOA) is proposed. Firstly, based on the response time, Fourier transform is used to refine the distinction between various types of load reserve demand, and the power of the AGC reserve band is calculated using Parseval's theorem to obtain the reserve capacity demand sequence. The maximum mutual information coefficient method is used to explore the relevant influencing factors of the AGC reserve sequence concerning the data characteristics of the AGC reserve sequence. Then, the historical daily AGC reserve demand sequences with relevant features are input into the Attention-BiLSTM prediction model, and the improved whale algorithm is used to automatically find the optimal hyperparameters to obtain better prediction results. Finally, the arithmetic simulation results show that the model proposed in this paper has the best prediction performance with the upper (0.8810) and lower (0.6651) bounds of the coefficient of determination ( R 2 ) higher than the other models, and it has the smallest mean absolute percentage error ( M A P E ) and root mean square error ( R M S E ). [ABSTRACT FROM AUTHOR]

The Internet of Vehicles (IoV) is one of the developing paradigms that integrates the automotive industry with the Internet of Things (IoT). The evolution of traditional Vehicular Ad-hoc Networks (VANETs), which are a layered framework for Intelligent Transportation Systems (ITS), is employed to provide Quality of Service (QoS) to end users in hazardous situations. VANETs can set up ad-hoc networks and share information among themselves using Peer-to-Peer (P2P) communication. Dynamic properties in VANETs such as dynamic topology, node mobility, sparse vehicle distribution, and bandwidth constraints can have an impact on scalability, routing, and security. This can result in frequent link failures, instability, reliability, and QOS concerns, as well as the inherent complexity of NP-hard problems. Researchers have proposed several techniques to achieve stability; the most prominent one is clustering, which relies on mobility metrics. However, existing clustering techniques generate overwhelming clusters, resulting in greater resource consumption, communication overhead, and hop count, which may lead to increased latency. Therefore, the primary objective is to achieve stability by increasing cluster lifetime, which is accomplished by generating optimal clusters. A nature-inspired meta-heuristic algorithm titled African Vulture Optimization Based Clustering Algorithm (AVOCA) is implemented to achieve it. The proposed algorithm can achieve load optimization with efficient resource utilization by mitigating hidden node challenges and ensuring communication proficiency. By maintaining an equilibrium state between the exploration and exploitation phases, AVOCA avoids local optima. The paper explores a taxonomy of the techniques used in Cluster Head (CH) selection, coordination, and maintenance to achieve stability with lower communication costs. We evaluated the effectiveness of AVOCA using various network grid sizes, transmission ranges, and network nodes. The results show that AVOCA generates 40% less clusters when compared to the Clustering Algorithm Based on Moth-Flame Optimization for VANETs (CAMONET). AVOCA generates 45% less clusters when compared to Self-Adaptive Multi-Kernel Clustering for Urban VANETs (SAMNET), AVOCA generates 43% less clusters when compared to Intelligent Whale Optimization Algorithm (i-WOA) and AVOCA generates 38% less clusters when compared to Harris Hawks Optimization (HHO). The results show that AVOCA outperforms state-of-the-art algorithms in generating optimal clusters. [ABSTRACT FROM AUTHOR]

Since the mention of the Fourth Industrial Revolution in 2016, quantum computers and quantum computing (QC) have emerged as key technologies. Many researchers are trying to realize quantum computers and quantum computing. In particular, most of the development and application of metaheuristics algorithms using quantum computing is focused on computer engineering fields. Cases in which the developed algorithm is applied to the optimal design of a building or the optimal design results presented by expanding the algorithm in various directions are very insufficient. Therefore, in this paper, we proposed four methods of adopting qubits to perform pitch adjusting in the optimization process of the QbHS (quantum-based harmony search) algorithm and applied it to TTO (truss topology optimization) using four methods to compare the results. The four methods of adopting qubits have the same or decreased number of qubits adopted as the number of iterations changes. As a result of applying TTO using four methods, convergence performance differed depending on the adoption method, and convergence performance was superior to conventional HS (harmony search) algorithms in all methods. The optimal design of structural engineering using such QC is expected to contribute to the revitalization of future technologies in the architectural field and the field of computer information systems. [ABSTRACT FROM AUTHOR]

This paper presents two hybrid optimization methods known as PSOHHO and DPSOHHO optimization algorithms. In the first method, using a number of formulae, the top populations are exchanged between the two algorithms and a new population is created and in the second method, we adopted the parallel optimization and optimized its performance. In this method, unlike other parallel methods, the population does not remain constant. With this ability, the strengths of an algorithm can be used to compensate for the weaknesses of the other algorithm. In these methods, no changes are made to the algorithms. The main goal is to use existing algorithms. These methods attain the optimal solution in the shortest time possible. Two algorithms of particle swarm optimization (PSO) and Harris Hawks's optimization (HHO) are used to present this method and two truss samples and CEC209 are considered to confirm the performance of this method. Based on the results, these methods have rapid convergence speed and acceptable results compared to other methods. [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]

• 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]

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]

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]