League Championship Algorithm Research Articles

Identifying Optimal Wavelengths from Visible–Near-Infrared Spectroscopy Using Metaheuristic Algorithms to Assess Peanut Seed Viability

Peanuts, owing to their composition of complex carbohydrates, plant protein, unsaturated fatty acids, and essential minerals (magnesium, iron, zinc, and potassium), hold significant potential as a vital component of the human diet. Additionally, their low water requirements and nitrogen fixation capacity make them an appropriate choice for cultivation in adverse environmental conditions. The germination ability of seeds profoundly impacts the final yield of the crop; assessing seed viability is of extreme importance. Conventional methods for assessing seed viability and germination are both time-consuming and costly. To address these challenges, this study investigated Visible–Near-Infrared Spectroscopy (Vis/NIR) in the wavelength range of 500–1030 nm as a nondestructive and rapid method to determine the viability of two varieties of peanut seeds: North Carolina-2 (NC-2) and Spanish flower (Florispan). The study subjected the seeds to three levels of artificial aging through heat treatment, involving incubation in a controlled environment at a relative humidity of 85% and a temperature of 50 °C over 24 h intervals. The absorbance spectra noise was significantly mitigated and corrected to a large extent by combining the Savitzky–Golay (SG) and multiplicative scatter correction (MSC) methods. To identify the optimal wavelengths for seed viability assessment, a range of metaheuristic algorithms were employed, including world competitive contest (WCC), league championship algorithm (LCA), genetics (GA), particle swarm optimization (PSO), ant colony optimization (ACO), imperialist competitive algorithm (ICA), learning automata (LA), heat transfer optimization (HTS), forest optimization (FOA), discrete symbiotic organisms search (DSOS), and cuckoo optimization (CUK). These algorithms offer powerful optimization capabilities for effectively extracting relevant wavelength information from spectral data. Results revealed that all the algorithms demonstrated remarkable accuracy in predicting the allometric coefficient of seeds, achieving correlation coefficients exceeding 0.985 and errors below 0.0036, respectively. In terms of execution time, the ICA (2.3635 s) and LCA (44.9389 s) algorithms exhibited the most and least efficient performance, respectively. Conversely, the FOA and the LCA algorithms excelled in identifying the least number of optimal wavelengths (10 wavelengths). Subsequently, the seeds were classified based on the wavelengths selected via the FOA (10 wavelengths) and (DSOS (16 wavelengths) methods, in conjunction with logistic regression (LR), decision tree (DT), multilayer perceptron (MP), support vector machine (SVM), k-nearest neighbor (K-NN), and naive Bayes (NB) classifiers. The DSOS–DT and FOA–MP methods demonstrated the highest accuracy, yielding values of 0.993 and 0.983, respectively. Conversely, the DSOS–LR and DSOS–KNN methods obtained the lowest accuracy, with values of 0.958 and 0.961, respectively. Overall, our findings demonstrated that Vis/NIR spectroscopy, coupled with variable selection algorithms and learning methods, presents a suitable and nondestructive approach for detecting seed viability.

Optimizing disaster relief goods distribution and transportation: a mathematical model and metaheuristic algorithms

The effective distribution of relief goods is critical in mitigating the impact of natural disasters and preserving human life. This study addresses a relief goods distribution problem, assuming the existence of multiple relief orders that must be delivered to various disaster-stricken regions from a network of warehouses using a fleet of diverse vehicles. The objective is to identify the most suitable warehouse for each relief order, allocate relief orders to vehicles, batch the orders in the designated vehicles, and devise routing plans to minimize the total delivery time. A mixed-integer linear programming model is formulated to tackle this problem. Owing to the problem’s NP-hard nature, a metaheuristic algorithm, known as the Multiple League Championship Algorithm, is developed. Furthermore, two innovative variants of the MLCA , namely the League Base Multiple League Championship Algorithm (L- MLCA) and the Playoff Multiple League Championship Algorithm (P-MLCA), are introduced.Experimental results indicate that the P-MLCA outperforms the other two algorithms. The solutions derived from the P-MLCA are compared with the optimal solutions obtained by a commercial solver for small-scale problems. This comparative analysis demonstrates the promising performance of the P-MLCA in finding the optimal distribution of relief goods.

Effective league championship algorithm and lower bound procedure for scheduling a single batch-processing machine with non-identical job sizes and job rejection

We address the scheduling problem of a set of non-identical size jobs on a single batch-processing machine (SBPM) wherein the scheduler can make decision whether to schedule a job in batches or not to schedule it with a job-dependent penalty. The processing time of a batch is the greatest job processing time in that batch (parallel batching or p-batching). The scheduler wants to minimize a given objective function f, where f is the total rejection penalties of the rejected jobs (rejection cost) plus the makespan of the scheduled ones. We formulate the aforementioned problem as a 0–1 mixed integer programming model. We also apply an effective dynamic programming algorithm (DPA) to calculate a lower bound (LB) on the optimal cost of the problem. To tackle the problem, we propose a grouping algorithm, based on league championship algorithm (LCA), with new updating equations maintaining the major characteristics of the original updating equations of the LCA and well-suited to the structure of the problem. For small problems, performance of the proposed LCA is compared with GAMS/CPLEX solver. For large-scale instances, a genetic algorithm is adopted as a basis for comparison. Simulated experiments confirm the performance of the proposed methods.

A secure routing approach based on league championship algorithm for wireless body sensor networks in healthcare.

Patients must always communicate with their doctor for checking their health status. In recent years, wireless body sensor networks (WBSNs) has an important contribution in Healthcare. In these applications, energy-efficient and secure routing is really critical because health data of individuals must be forwarded to the destination securely to avoid unauthorized access by malicious nodes. However, biosensors have limited resources, especially energy. Recently, energy-efficient solutions have been proposed. Nevertheless, designing lightweight security mechanisms has not been stated in many schemes. In this paper, we propose a secure routing approach based on the league championship algorithm (LCA) for wireless body sensor networks in healthcare. The purpose of this scheme is to create a tradeoff between energy consumption and security. Our approach involves two important algorithms: routing process and communication security. In the first algorithm, each cluster head node (CH) applies the league championship algorithm to choose the most suitable next-hop CH. The proposed fitness function includes parameters like distance from CHs to the sink node, remaining energy, and link quality. In the second algorithm, we employs a symmetric encryption strategy to build secure connection links within a cluster. Also, we utilize an asymmetric cryptography scheme for forming secure inter-cluster connections. Network simulator version 2 (NS2) is used to implement the proposed approach. The simulation results show that our method is efficient in terms of consumed energy and delay. In addition, our scheme has good throughput, high packet delivery rate, and low packet loss rate.

NDTAEP: Design of a novel deadline-aware task scheduling model using augmented ensemble pattern analysis

A wide variety of scheduling models have been proposed by researchers over the years, and each of them has varying performance in terms of deadline hit ratio, scheduling effort, efficiency of task mapping, etc. However, these models are highly context-sensitive and cannot be scaled to heterogeneous task types due to their internal mapping characteristics. To improve task scalability, this work proposes a design of a novel deadline-aware task scheduling model that uses augmented ensemble pattern analysis for task clustering. The pattern analysis module uses a combination of K-means, hierarchical, and Fuzzy C Means (FCM) clustering to effectively segregate tasks depending on their completion and deadline parameters. These tasks are given to a modified deadline-aware League Championship Algorithm (LCA) optimizer, which assists in mapping the clustered tasks with worker threads. The modified LCA model uses a combination of task priority, task deadline, and worker capacity for scheduling. The model maps tasks that require higher execution effort with moderately performing worker nodes, while tasks with nearer deadlines are allotted to higher-performance workers. Due to the use of an ensemble augmented pattern analyzer with a modified LCA optimizer, the proposed model can improve execution speed by 8%, deadline hit ratio by 1.5%, and scheduling efficiency by 6.5% when compared with various state-of-the-art scheduling approaches. The proposed model was evaluated and showcased a deadline hit ratio of 99.95%, computational efficiency of 96.26%, and average task-scheduling delay of less than 0.1 ms, which makes it highly useful for a wide variety of task scheduling application scenarios.

Improved League Championship Algorithm (ILCA) for Load Balancing in Cloud Computing

You can’t obtain the outcomes you need without planning, thus it’s at the heart of cloud computing. This article’s major goal is to decrease value-added time, increase resource utilisation, and make cloud services viable for a single activity. In recent years, metaheuristic algorithms have drew attention to the correct functioning of work scheduling algorithms among the many job scheduling techniques. With sports leagues, the algorithm based on the League Championship (LCA) is fascinating because it can be used to identify the best team/task for programming.This article uses the Improved League Championship Algorithm (ILCA) to schedule tasks, reducing deployment time, cloud usage, and cost. The ILCA is implemented through the Cloudsim simulator and the Java programming language with a nonpreventive planning strategy. ILCA also enhances economies of scale and minimises the value of using the cloud. As it has proven to be versatile in terms of time to manufacture, resource usage and economics, ILCA could be a good candidate for a cloud broker as it has proven to be versatile in termsof time to manufacture, resource usage and economics usage.

Prediction and optimization of heating and cooling loads for low energy buildings in Morocco: An application of hybrid machine learning methods

In this paper, a metamodel-based approach involving simulation data collection and data-driven techniques was used to forecast and optimize heating and cooling loads in three different climates in Morocco. The metamodel method is gaining popularity as it offers a better balance between accuracy and calculation time. In addition, a wrapper method was used as a feature selection approach to find the best feature subsets in order to reduce models’ complexity. Therefore, the performances of eleven state-of-the-art algorithms including evolutionary-based algorithms, swarm intelligence-based algorithms and human-based algorithms, coupled with a learner such as Artificial Neural Networks (ANNs) and Support vector machine (SVM), were assessed. Hybrid model based on League championship algorithm (LCA), Discrete symbiotic organisms search (DSOS) algorithm, Particle swarm optimization (PSO) algorithm showed better results in terms of accuracy and reduction of feature input parameters. Indeed, the best desired performances were obtained with LCA-SVM for cooling load, DSOS-SVM for heating load, PSO-ANN for both heating and cooling loads. On the other hand, to optimize the annual thermal load, the NSGA-II algorithm was used. Results showed a reduction of 68% of the total annual load compared to the base case in Meknes city, 73% in Ifrane and 67% in Marrakech. The solution that reflects a compromise between the two objective functions (i.e., cooling load and heating load) gives better results in terms of CO2 emissions reduction in all climates evaluated, except in the cold climate.

A Mixed Integer Linear Formulation and a Grouping League Championship Algorithm for a Multiperiod-Multitrip Order Picking System with Product Replenishment to Minimize Total Tardiness

Order picking, which is collecting a set of products from different locations in a warehouse, has repeatedly been described as one of the most laborious and time-consuming internal logistic processes. Each order is issued to pick some products located at given locations in the warehouse. In this paper, we consider an order picking problem, in which a number of orders with different delivery due dates are going to be retrieved by a limited number of order pickers in multiperiods such that the total tardiness is minimized. The aim is to determine a retrieval plan in terms of order batching and order picker multitrip routing as decision variables. Besides, products are arrived and replenished at the predetermined locations at different periods. Therefore, products sitting in those locations should be delivered soon to provide empty rooms for replenishment. A mixed integer linear programming formulation is proposed for this new problem. The model is optimally solved for small-size problems. For larger instances, grouping metaheuristic algorithms are proposed based on particle swarm optimization and the league championship algorithm that use group-based operators to generate reasonable batches of orders. Improvement heuristics are designed as well. The performance of the MILP formulation and metaheuristic algorithms is analyzed for different problem instances whose designs are based on real data gathered from an auto parts warehouse. Results indicate that our algorithms can stably solve large instances of the problem in a reasonable time.

A novel optimization model for biding in the deregulated power market with pay as a bid settlement mechanism, based on the stochastic market clearing price

In this paper, a novel optimization-based bidding strategy will propose for an electricity generation company in the day-ahead market with a pay-as-bid settlement system. In this proposed model, Market Clearing Price is considered as a stochastic parameter with different distribution functions per hour. Moreover, days are also clustered in three different clusters based on the historical data by using the K-Means Algorithm. In addition, three types of linear, quadratic, and cubic cost functions are taken into account in the proposed model, where the results indicated that the cubic function is the best estimation model for the generation cost. Finally, the League Championship Algorithm is applied in order to solve our proposed model. The proposed model has been applied to real case studies where the obtained results indicated that the proposed model is able to improve the expected revenue by 17% in comparison with the basic model.

Economic and optimal planning of a multi-carrier microgrid consisting of electricity to gas conversion system and storage with developed algorithm of championship in sports leagues

The rapid development of power-to-gas (P2G) technology has led to promote the renewable energy integration and to transform the excess renewable production to combined normal gas at appropriate time. As the demand for power system increases, further recovering to excess wind energy by P2G is meat increase requests for energy and decrease system costs. In order to grow P2G transformation performance, in this work the MES model modeling to CO2-based operations and P2G are presented with the developed sports league championship algorithm. Mentioned method is considred the heat resumption for process of converting to hydrogen potency. The CO2-based ETES is presented to heat resumption of electrolysis procedure, that acts as a CO2 supplier in the methanation reaction. The championship algorithm in the sports league is equipped with teams with a network structure to extract rules multiple times. Rules are extracted multiple times by an algorithm in which each rule, in addition to current information, also contains information from the past. Therefor, in this study a memory is created to store useful information in each of the rules. In this study, the case studies show that the presented model can achieve more than 70% of the efficiency of excess wind energy recovery.

A wrapper method based on a modified two-step league championship algorithm for detecting botnets in IoT environments

A wrapper method based on a modified two-step league championship algorithm for detecting botnets in IoT environments

Fuzzy whale optimisation algorithm: a new hybrid approach for automatic sonar target recognition

ABSTRACT In this paper, a radial basis function neural network (RBF-NN) automatic sonar target recognition system is proposed. For the RBF-NN training phase, a whale optimisation algorithm (WOA) developed with a fuzzy system has been used (which is called FWOA). The reason for using the fuzzy system is the lack of correct identification of the boundary between the two stages of exploration and exploitation. Thus, the tuning of the effective parameters of the WOA is left to the fuzzy system of the Mamdani type. RBF-NN was trained by chimp optimisation algorithm (ChOA), genetic algorithm (GA), Evolution Strategy (ES), league championship algorithm (LCA), grey wolf algorithms (GWO), gravitational search algorithm (GSA), and WOA to compare the proposed algorithm. The measured criteria are convergence speed, ability to avoid local optimisation, and classification rate. The simulation results showed that FWOA with 97.49% classification accuracy rate in sonar data performed better than the other seven benchmark algorithms.

Performance assessment of meta-heuristics for composite layup optimisation

This paper investigates the performance of several meta-heuristic algorithms, including Particle Swarm Optimisation (PSO), different variants of Differential Evolution (DE), Biogeography-Based Optimisation (BBO), Cultural Algorithm (CA), Optics-Inspired Optimisation (OIO), and League Championship Algorithm (LCA), for optimum layup of laminated composite plates. The study provides detailed Pseudo codes for different algorithms. The buckling capacity maximisation of a 64-layer laminated composite plate under various load scenarios has been considered as the benchmark problem, in which the design variables are the stacking sequences of layers. A Deep Statistical Comparison (DSC) method is employed to rank the performance of different algorithms. The DSC uses a nonparametric two-sample Kolmogorov-Smirnov test to conduct the performance comparisons between the algorithms. The overall performance rankings obtained from the DSC suggest that the LCA, OIO, and PSO algorithms perform remarkably better in comparison to other algorithms. The comparisons provide some interesting conclusions on the performance of different algorithms.

A hybrid approach for joint optimization of base and extended warranty decisions considering out-of-warranty products

In practice, manufacturers who offer base and extended warranty should make simultaneous decisions on product pricing, spare part pricing for out-of-warranty products, base and extended warranty policy, and spare part inventory management. Previous studies neither considered the influence of out-of-warranty products as one of the main sources of manufacturers’ profit nor optimized these decisions in an integrated model. In this paper, these challenges are addressed by introducing an optimization model to maximize the manufacturer's profit. A new math-heuristic algorithm is proposed for solving the model using the hybridization of metaheuristic algorithms with a developed dynamic programming algorithm. To generate a new solution within the loop of the metaheuristic algorithm, the product price, spare part price and warranty policy variables are first determined with the aid of the operators of league championship algorithm or improved particle swarm optimization algorithm. The maximum number of failures in each time interval is calculated accordingly, and finally, spare part inventory costs are optimized with the aid of the proposed dynamic programming algorithm. The model is verified by Monte-Carlo simulation and is solved with real data for LED TV product. A sensitivity analysis is conducted to evaluate the influence that various parameters may have on the optimal solution.

An optimise ELM by league championship algorithm based on food images

This paper presents an optimisation of extreme learning machine by league championship algorithm based on food images. Extreme Learning Machine (ELM) is an effective classifier because of the performance which is higher than other classifiers’ aspects. However, some important drawbacks still work as a hindrance like failure of optimal selection weights for the weights of the input-hidden layer and the output of the threshold. In spite of the wide number of problem-solving attempts, there was no solution to be considered effective. This paper presents the approach of hybrid learning and the League Championship Algorithm is used by for the purpose of selecting the input weights and the thresholds outputs. The experimental outcomes showed that the performance of proposed technique is superior as compared according to different scenarios of the measures to benchmark. The proposed method has achieved an overall accuracy of 95% for UEC food 100 dataset and 94% for UEC food 256 dataset comparing with 94% and 80% for baseline approaches.

Study of League Championship Algorithm Efficiency for Global Optimization Problem

The article objective is to study a new League Championship Algorithm (LCA) algorithm efficiency by its comparing with the efficiency of the Particle Swarm optimization (PSO) algorithm.The article presents a brief description of the terms used in the League Championship algorithm, describes the basic rules of the algorithm, on the basis of which the iterative process for solving the global optimization problem is built.Gives a detailed description of the League Championship algorithm, which comprises a flowchart of the algorithm, as well as a formalization of all its main steps.Depicts an exhaustive description of the software developed to implement the League Championship algorithm to solve global optimization problems.Briefly describes the modified particle swarm algorithm. Presents the values of all free parameters of the algorithm and the algorithm modifications, which make it different from the classical version, as well.The main part of the article shows the results of a great deal of computational experiments using two abovementioned algorithms. All the performance criteria, used for assessment of the algorithms efficiency, are given.Computational experiments were performed using the spherical function, as well as the Rosenbrock, Rastrigin, and Ackley functions. The results of the experiments are summarized in Tables, and also illustrated in Figures. Experiments were performed for the vector dimension of the variable parameters that is equal to 2, 4, 8, 16, 32, and 64.An analysis of the results of computational experiments involves a full assessment of the efficiency of the League Championship algorithm, and also provides an answer about expediency for further algorithm development.It is shown that the League Championship algorithm presented in the article has a high development potential and needs further work for its study.

Dynamic pricing in a semi-centralized dual-channel supply chain with a reference price dependent demand and production cost disruption: the case of Iran Khodro Company

During the years of imposed sanctions against Iran, Iran Khodro Company (IKCO) got into a hazardous situation due to CKD parts’ purchasing cost increment and emersion of new product variants in the competitive market. To examine such situation, this study examines a multi-period semi-centralized dual-channel supply chain where a common retailer (free market) and two manufacturers’ (IKCO and Saipa as a major competitor) direct channels are confronted with reference price dependent and stochastic demand. The problem is analyzed under Stackelberg and cooperative games scenarios using heuristic algorithm and a League Championship algorithm respectively, as solution methods. Results obtained from solving the problem with IKCO data proves higher profitability of the cooperative game and its remarkable resilience for all products’ memory types i.e. short/long term memory against production cost disruption which is imposed to IKCO in some periods. Besides calculating Saipa’s optimal wholesale price in the disruption periods, our approach with support of experimental analyses is able to assign a supply chain’s degree of resilience against disruptions to its product’s memory type and also power structure.

TAM DERİNLİKLİ ESNEK ÜSTYAPILARIN KATMAN ÖZELLİKLERİNİN TAHMİNİ İÇİN LİG ŞAMPİYONASI ALGORİTMASI

This study proposes a backcalculation tool, based on the hybrid use of League Championship Algorithm (LCA) and Artificial Neural Network (ANN), in order to predict the stiffness related layer properties of full-depth asphalt pavements. The proposed algorithm, namely LCA-ANN, is composed of two main parts; (i) an ANN forward response model, which is developed with the nonlinear finite element solution, for computing the surface deflections, and (ii) LCA search algorithm which is employed to search and provide the best set of layer moduli to the ANN model. In order to evaluate the performance of the proposed method, a synthetically generated dataset and real field data are utilized. Moreover, to assess the searching ability of LCA, well-accepted metaheuristic algorithms; Simple Genetic Algorithm (SGA) and Particle Swarm Optimization (PSO) are employed for comparison purposes. Obtained results reveal that the proposed algorithm can predict the layer properties with a low order of error values and enables fast and reliable tool for backcalculation studies.

Teaching–learning-based metaheuristic scheme for modifying neural computing in appraising energy performance of building

Early assessment of the energy performance of buildings (EPB) is focused in this study. This task is carried out by predicting the cooling load (CL) in a residential building. To this end, due to the drawbacks of neural computing approaches (e.g., local minima), a novel metaheuristic technique, namely teaching–learning-based optimization (TLBO) is employed to modify a multi-layer perceptron neural network (MLPNN). The complexity of the proposed model is also optimized by a trial and error process. Evaluating the results revealed a high efficiency for this scheme. In this sense, the prediction error of the MLPNN was reduced by around 20%, and the correlation between the measured and forecasted CLs rose from 0.8875 to 0.9207. It was also deduced that the TLBO outperforms two benchmark optimizers of cuckoo optimization algorithm (COA) and league championship algorithm (LCA) in terms of both modeling accuracy and network complexity. Moreover, the TLBO-MLP emerged as the most time-effective hybrid as it required considerably lower computation time than COA-MLP and LCA-MLP. Regarding these advantages, the proposed model can be promisingly used for early assessment of EPB in practice.

A Physics Based Novel Approach for Travelling Tournament Problem: Optics Inspired Optimization

Computational intelligence search and optimization algorithms have been efficiently adopted and used for many types of complex problems. Optics Inspired Optimization (OIO) is one of the most recent physics inspired computational intelligence methods which treats the search space of the problem to be optimized as a wavy mirror in which each peak is assumed to reflect as a convex mirror and each valley to reflect as a concave one. Each candidate solution is treated as an artificial light point that its glittered ray is reflected back by the search space of the problem and the artificial image is formed based on mirror equations adopted from Optics, as a new candidate solution. In this study, OIO for the first time has been designed as solution search strategy for travelling tournament problem which is one of the current sports problems and aids to minimize transportation and total movement of teams. Furthermore, this problem has been firstly solved by League Championship Algorithm and obtained results from both synthetic and real datasets have been compared in this study for the first time. Obtained results show the superiority of OIO which is a novel algorithm and seems to efficiently solve many complex problems.