Imperialist Competitive Algorithm Algorithm Research Articles

Evolutionary Algorithm to Optimize Process Parameters of Al/Steel Magnetic Pulse Welding

The Magnetic Pulse Welding (MPW) process uses only electromagnetic force to create a solid-state metallurgical bond between a working coil and outer workpiece. The electromagnetic force drives the outer tube to collide with the inner rod, resulting in successful bonding. However, due to the dissimilarity of the MPW joint, only a portion of the interface forms a metallurgical bond, which affects the quality of the joint. Therefore, the purpose of this study is to analyze the effects of process parameters on joint quality through experimental work using RSM. Furthermore, an optimization algorithm is utilized to optimize the process parameters used in magnetic pulse welding. A1070 aluminum and S45C carbon steel were used as the materials, while peak current, gap between working coil and outer tube, and frequency were chosen as the process parameters for MPW. The welding conditions are determined through experimental design. After welding, the maximum load and weld length are measured to analyze the effect of the process parameters, and a prediction model is developed. Specifically, to achieve a high-quality joint, the process parameters are optimized using the Imperialist Competitive Algorithm (ICA) and Genetic Algorithm (GA). The results reveal that the peak current is a significant parameter, and the developed prediction model exhibits high accuracy. Furthermore, the ICA algorithm proves very effective in determining the process parameters for achieving a high-quality Al/Steel MPW joint.

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.

A- and D-optimal designs in real life data using imperialist comparative algorithm

In this paper, we used Imperialist Competitive Algorithm (ICA) to get A-and D-optimal de­signs for two models; one with nonlinear and the other linear model were found for two life data. It was noted that the number of iterations for D-optimal design for both models was smaller than that of A-optimal design. This implies that getting a D-optimal design is preferable and saves time and energy compared to A-optimal since they are addressing the same issues related to the variance-covariance function. The Efficiency Lower Bound and the Sensitivity function embedded in ICA which support the general equivalent theorem in getting optimal design were also found in this study. Another advantage of using ICA algorithm is that it does not require the design space or the region of uncertainty to be discretized which means that the search for the support points of the optimal design is not restricted to the grid point. This was also confirmed here that the optimal design for A and D- designs were not restricted to the grid points.

Dynamic Configuration Method of Flexible Workshop Resources Based on IICA-NS Algorithm

The optimal configuration of flexible workshop resources is critical to production efficiency, while disturbances pose significant challenges to the effectiveness of the configuration. Therefore, this paper proposes a hybrid-driven resource dynamic configuration model and an improved Imperialist Competitive Algorithm hybrid Neighborhood Search (IICA-NS) that incorporates domain knowledge to allocate resources in flexible workshops. First, a hybrid-driven configuration framework is proposed to optimize resource configuration strategies. Then, in the revolutionary step of the Imperialist Competitive Algorithm (ICA), the bottleneck heuristic neighborhood structure is adopted to retain the excellent genes in the imperial so that the updated imperial is closer to the optimal solution; And a population invasion strategy is proposed further to improve the searchability of the ICA algorithm. Finally, the simulation experiments are carried out through production examples on flexible workshop production cases, and the proposed algorithm is applied. Compared with traditional ICA, genetic algorithm (GA), particle swarm optimization algorithm (PSO), moth-flame optimization (MFO) and sparrow search algorithm (SSA), the proposed method and algorithm effectively solve flexible workshops’ resource dynamic configuration problems.

A new imperialist competitive algorithm with spiral rising mechanism for solving path optimization problems.

Intelligent optimization algorithms have now become important means for solving global optimization problems. The imperialist competitive algorithm (ICA) is a nature-inspired meta-heuristic algorithm that imitates social behavior. ICA has been widely used in optimization problems, however, ICA tends to fall into a local optimal solution because of its fast convergence speed, which may lead to premature convergence when solving optimization problems. To solve these problems, a new improved ICA algorithm is proposed. Based on the original ICA algorithm, the theory of spiral rising is introduced to enlarge the search space and enhance the global search ability of the algorithm based on ensuring the necessary speed of convergence. In this paper, the improved optimization algorithm is applied to 19 classical benchmark functions, and the improved ICA is applied to the robot path optimization problems to solve the optimal path. The improved ICA algorithm improves the optimization ability and algorithm stability.

Distributed Generation Management in Smart Grid with the Participation of Electric Vehicles with Respect to the Vehicle Owners’ Opinion by Using the Imperialist Competitive Algorithm

In this paper, a modified version of Imperialist Competitive Algorithm (ICA) is proposed for the optimal energy management of a Microgrid (MG) with Parking Lots (PL) and Distributed Generation (DG) units. A 24-h scheduling for participation in DG units and electric vehicles PLs in two scenarios is done. The PLs are divided into seven group that each group has different trip behavior. Therefore, energy management should be done in such a way as to minimize operating costs according to the charging status of electric vehicles as well as the production capacity of distributed generation sources. Finally, the results of the two scenarios are reviewed separately and compared. The simulation results proved the effectiveness of the proposed method. The MG operation cost is decreased about 63%. Also, the optimization results. The optimization results by the proposed ICA algorithm are compared with the results of genetic algorithm (GA) and particle swarming optimization (PSO) algorithms. The optimization results confirm better performance of the proposed algorithm compared to GA and PSO algorithms.

Ore grade estimation using the imperialist competitive algorithm (ICA)

In this paper, a hybrid inverse distance weighted (IDW) and the imperialist competitive algorithm (ICA) was proposed for grade estimations in mining projects. Indeed, the coefficients of the IDW equation, power, and the influence distance were modified by applying the ICA algorithm. For this, an example was solved by using IDW, the ordinary kriging, and IDW-ICA. After successfully validating the IDW-ICA, the iron grades were estimated in the Baba Ali iron mine, the most prominent iron mine in the west of Iran. For this, after gathering data from thirty-two boreholes, the grade estimations were conducted using IDW, kriging, and IDW-ICA. Some statistical parameters, including the mean absolute percentage error (MAPE), root-mean-squared error (RMSE), and correlation coefficient, were used to compare the results. The higher value of the R2, 94.41%, the lowest values of MAPE, 17.4%, and RMSE, 4.19, of the proposed algorithm, revealed that the IDW-ICA could be applied as a new-fangled method for grade estimations in the mining projects.

Optimization of Concrete Gravity Dam Section using New Election Meta-heuristic Algorithm

According to design criteria, site specifications, and required height, different dimensional options are considered for geometric parameters, while design gravity dams. Among options, an option that provides sustainability and low costs is considered as an executive option. In this study, the Koyna concrete gravity dam section in India and the Kalat Zavin concrete gravity dam in Khorasan Razavi province were optimized using the election meta-heuristic algorithm (EA) concerning the stability conditions. In this model, geometric parameters were considered as decision variables and dam weight as an objective function. The model obtains geometric parameters in such a way that the dam weight is minimized. To evaluate the proposed method, the Koyna dam and Kalat Zavin dam data set were used and the results were compared with Genetic (GA), Honey Bee Mating Optimization (HBMO), and Imperialist Competitive (ICA) algorithms. The results of the EA method indicate a 9.87% and 10.40% decrease in the volume of concrete consumption and a reduction in area for Koyna and Kalat Zavin dams. Based on the comparisons, the EA algorithm showed better performance in optimizing the dam section than the genetic algorithm (GA), honey bee mating algorithm (HBMO), and imperialist competitive algorithm (ICA) optimization models. optimization models. Also, the improvement rate of the EA algorithm in comparison with ICA, HBMO, and GA algorithms is equal to 8%, 6%, and 11%, respectively.

Imperialist competitive algorithm hybridized with multilayer perceptron to predict the load-settlement of square footing on layered soils

To forecast the value of bearing capacity in shallow footings, a total of 2430 finite element modelling (FEM) simulation is performed. In this regard and to optimize the performance of the artificial neural network (ANN), it is combined with the imperialist competitive algorithm (ICA). The new combined technique is called ICA-MLP (multi-layer perceptron). To develop the ICA-MLP model, the input parameters were the soil type (i.e., having particular soil properties for each of the sandy soil types) installed at the top, the soil type installed at the bottom, the first-layer thickness ratio (h/B) and the applied stress on the footing (kPa), while the output was the vertical settlement (mm) under the square footing. The estimations were compared with a predeveloped ANN model to demonstrate the ability of the ICA-MLP hybrid model. The results showed a high ability of ICA metaheuristic ensembles for understanding the non-linear relationship between the influential factors and the selected target. Meanwhile, a comparison between the used models revealed that the best-combined structure is when the ICA algorithm is followed by the swarm size equal to 350. In this sense, the results from the predeveloped ANN model, based on R2 values, were 0.83 and 0.89 for the training and testing data sets, respectively, whereas the R2 and RMSE values for the ICA-MLP model for the training and testing datasets were 0.983, 0.062 and 0.977, 0.070, respectively. Therefore, the ICA-MLP model can be regarded as a new model that is superior to the conventional MLP technique.

Optimization of blasting design in open pit limestone mines with the aim of reducing ground vibration using robust techniques

Blasting operations create significant problems to residential and other structures located in the close proximity of the mines. Blast vibration is one of the most crucial nuisances of blasting, which should be accurately estimated to minimize its effect. In this paper, an attempt has been made to apply various models to predict ground vibrations due to mine blasting. To fulfill this aim, 112 blast operations were precisely measured and collected in one the limestone mines of Iran. These blast operation data were utilized to construct the artificial neural network (ANN) model to predict the peak particle velocity (PPV). The input parameters used in this study were burden, spacing, maximum charge per delay, distance from blast face to monitoring point and rock quality designation and output parameter was the PPV. The conventional empirical predictors and multivariate regression analysis were also performed on the same data sets to study the PPV. Accordingly, it was observed that the ANN model is more accurate as compared to the other employed predictors. Moreover, it was also revealed that the most influential parameters on the ground vibration are distance from the blast and maximum charge per delay, whereas the least effective parameters are burden, spacing and rock quality designation. Finally, in order to minimize PPV, the developed ANN model was used as an objective function for imperialist competitive algorithm (ICA). Eventually, it was found that the ICA algorithm is able to decrease PPV up to 59% by considering burden of 2.9 m, spacing of 4.4 m and charge per delay of 627 Kg.

An Efficient New Hybrid ICA-PSO Approach for Solving Large Scale Non-convex Multi Area Economic Dispatch Problems

Multi-area economic dispatch (MAED) is one of the vital problems in economic operation of interconnected power systems. This paper proposes a novel hybrid approach based on combined imperialist competitive algorithm (ICA) and particle swarm optimization (PSO) methods in order to determine the feasible optimal solution of the non-convex economic dispatch (ED) problem considering valve loading effects. In the proposed algorithm we have defined new type of countries in ICA algorithm, namely independent countries. These types of countries improve their position using a PSO based search strategy. The proposed method benefits from the advantage of the both algorithms. The proposed hybrid approach based on ICA-PSO is applied on different test systems and compared with most of the recent methodologies. Also, a large scale multi-area economic dispatch (MAED) problem is solved using the proposed hybrid approach to minimize total fuel cost in all areas while satisfying power balance constraints, generating limits and tie-line capacity constraints. The results show the effectiveness of the proposed approach and prove that ICA-PSO is applicable for solving the power system economic load dispatch problem, especially in large scale power systems.

A Mathematical Model and Grouping Imperialist Competitive Algorithm for Integrated Quay Crane and Yard Truck Scheduling Problem with Non-crossing Constraint

In this research, an integrated approach is presented to simultaneously solve quay crane scheduling and yard truck scheduling problems. A mathematical model was proposed considering the main real-world assumptions such as quay crane non-crossing, precedence constraints and variable berthing times for vessels with the aim of minimizing vessels completion time. Based on the numerical results, this proposed mathematical model has suitable efficiency for solving small instances. Two versions of imperialist competitive algorithm (ICA) are presented to heuristically solve the problem. The grouping version of algorithm (G-ICA) is used to solve the large-sized instances based on considering the allocation of trucks as a grouping problem. Effectiveness of the proposed metaheuristics on small-sized problems is compared with the optimal results of the mathematical model. In order to compare the efficiency of the proposed algorithms for large-sized instances, several instances were generated and solved, and the performance of algorithms has been compared with each other. Moreover, a simulated annealing (SA) algorithm is developed to solve the problem and evaluate the performance of the proposed ICA algorithms. Based on the experimental results, the G-ICA has a better performance compared to the ICA and SA. Also an instance of a container terminal in Iran has been investigated which shows that the proposed model and solution methods are applicable in real-world problems.

Hybridization of the imperialist competitive algorithm and local search with application to ship design optimization

In the wide scenario of the optimization techniques, a large number of algorithms are inspired by natural processes, in many different ways. One of the latest is the Imperialist Competitive Algorithm (ICA) Atashpaz-Gargari and Lucas (2007), judged by their authors as very efficient and competitive with other popular optimization algorithms. However, its diffusion is still limited, so that it has not yet been adequately studied.In this paper, we have investigated the convergence properties of the ICA algorithm, observing the effect of the various coefficients and their role in the global convergence. Some modifications, including the coupling with a local search method, have been listed/suggested and then tested on a suite of standard algebraic test functions, verifying the improvements on the speed of convergence of the original algorithm. An application to naval design has been also included, in order to check the ability to solve realistic problems.

An enhancement of task scheduling in cloud computing based on imperialist competitive algorithm and firefly algorithm

Cloud computing is an Internet-based approach in which all applications and files are hosted in a cloud consisting of thousands of computers that are linked in complex ways. The major challenge of cloud data centers is to show how the millions of requests of final users are correctly and effectively being investigated and serviced. Load-balancing techniques are needed to increase the flexibility and scalability of cloud data centers. Load-balancing technique is one of the most significant issues in the distributed computing system. Since there are large-scale resources and a lot of user demands in cloud computing load-balancing problem, it could be the main reason that many researchers considered and addressed that as an NP-hard problem. Therefore, some heuristics algorithms such as imperialist competitive algorithm (ICA) and firefly algorithm (FA) had been proposed by previous researchers to solve the mentioned problem. Although ICA and FA could get an approximate satisfying result in solving the cloud computing load-balancing problem, obtaining the better result means to make improvements in makespan, CPU time, load balancing, stability and planning speed. The motivation of this research is proposing an intelligent meta-heuristic algorithm based on the combination of ICA and FA to get the mentioned required result. Local search ability of FA can reinforce ICA algorithm. The obtained result of this research showed dramatic improvements in makespan, CPU time, load balancing, stability and planning speed.

An evolutionary optimization-based approach for simulation of endurance time load functions

ABSTRACTA novel optimization method based on Imperialist Competitive Algorithm (ICA) for simulating endurance time (ET) excitations was proposed. The ET excitations are monotonically intensifying acceleration time histories that are used as dynamic loading. Simulation of ET excitations by using evolutionary algorithms has been challenging due to the presence of a large number of decision variables that are highly correlated due to the dynamic nature of the problem. Optimal parameter values of the ICA algorithm for simulating ETEFs were evaluated and were used to simulate ET excitations. In order to increase the capability of the ICA and provide further search in the optimization space, this algorithm was combined with simulated annealing (SA). The new excitation results were compared with the current practice for simulation of ET excitations. It was shown that the proposed ICA-SA method leads to more accurate ET excitations than the classical optimization methods.

A comparative study of two meta-heuristic algorithms in optimizing cost of reinforced concrete segmental lining

In this work, we tried to automatically optimize the cost of the concrete segmental lining used as a support system in the case study of Mashhad Urban Railway Line 2 located in NE Iran. Two meta-heuristic optimization methods including particle swarm optimization (PSO) and imperialist competitive algorithm (ICA) were presented. The penalty function was used for unfeasible solutions, and the segmental lining structure was defined by nine design variables: the geometrical parameters of the lining cross-section, the reinforced feature parameters, and the dowel feature parameters used among the joints to connect the segment pieces. Furthermore, the design constrains were implemented in accordance with the American Concrete Institute code (ACI318M-08) and guidelines of lining design proposed by the International Tunnel Association (ITA). The objective function consisted of the total cost of structure preparation and implementation. Consequently, the optimum design of the system was analyzed using the PSO and ICA algorithms. The results obtained showed that the objective function of the support system by the PSO and ICA algorithms reduced 12.6% and 14% per meter, respectively.

A novel algorithm for solving resource-constrained project scheduling problems: a case study

PurposeConstruction projects managers try their best for the project to go according to the plans. They always attempt to complete the projects on time and consistent with the predetermined budgets. Amid so many problems in project planning, the most critical and well-known problem is the Resource-Constrained Project Scheduling Problem (RCPSP). The purpose of this paper is to solve RCPSP using hybrid algorithm ICA/PSO.Design/methodology/approachDue to the existence of various forms for scheduling the problem and also the diversity of constraints and objective functions, myriad of research studies have been conducted in this realm of study. Since most of these problems are NP-hard ones, heuristic and meta-heuristic methods are used for solving these problems. In this research, a novel hybrid method which is composed of meta-heuristic methods of particle swarm optimization (PSO) and imperialist competitive algorithm (ICA) has been used to solve RCPSP. Finally, a railway project has been examined for RCPS Problem in a real-world situation.FindingsAccording to the results of the case study, ICA/PSO algorithm has better results than ICAs and PSO individually.Practical implicationsICA/PSO algorithm could be used for solving problems in a multi-mode situation of activities or considering more constraints on the resources, such as the existence of non-renewable resources and renewable. Based on the case study in construction project, ICA/PSO algorithm has a better solution than PSO and ICA.Originality/valueIn this study, by combining PSO and ICA algorithms and creating a new hybrid algorithm, better solutions have been achieved in RCPSP. In order to validate the method, standard problems available in PSPLib library were used.

Modified imperialist competitive algorithm for environmental constrained energy management of microgrids

Optimal energy management of microgrids with different objectives such as operation cost, air pollution and wider use of renewable energy sources is investigated in many research works. In this paper, the effect of different operation modes of microgrids to solve environmental/economic dispatch problem is evaluated. Different modes of operation of microgrid include islanding operation, grid-connected and unilateral or bilateral exchange of power with main grid. The imperialist competitive algorithm (ICA) is one of the evolutionary algorithms that can model the competing imperialists to absorb colonies and uses it to find optimum solution. In this paper, a new method to improve the ICA algorithm is proposed in which the movement radius of the colonies toward the imperialist is adaptively adjusted in accordance with their position by means of adding direction and velocity parameters to the colonies. Thus, the colonies are attracted and repelled more intelligently by imperialists. The proposed method can create a trade-off between exploitation (i.e. local search) and exploration (i.e. global search) and prevents premature convergence while minimizing trapping in the local minima. Simulation results and comparison with other algorithms confirm high performance of the proposed algorithm.

Applying various hybrid intelligent systems to evaluate and predict slope stability under static and dynamic conditions

The evaluation and precise prediction of safety factor (SF) of slopes can be useful in designing/analyzing these important structures. In this study, an attempt has been made to evaluate/predict SF of many homogenous slopes in static and dynamic conditions through applying various hybrid intelligent systems namely imperialist competitive algorithm (ICA)-artificial neural network (ANN), genetic algorithm (GA)-ANN, particle swarm optimization (PSO)-ANN and artificial bee colony (ABC)-ANN. In fact, ICA, PSO, GA and ABC were used to adjust weights and biases of ANN model. In order to achieve the aim of this study, a database composed of 699 datasets with 5 model inputs including slope gradient, slope height, friction angle of soil, soil cohesion and peak ground acceleration and one output (SF) was established. Several parametric investigations were conducted in order to determine the most effective factors of GA, ICA, ABC and PSO algorithms. The obtained results of hybrid models were check considering two performance indices, i.e., root-mean-square error and coefficient of determination $$(R^{2})$$ . To evaluate capability of all hybrid models, a new system of ranking, i.e., the color intensity rating, was developed. As a result, although all predictive models are able to approximate slope SF values, PSO-ANN predictive model can perform better compared to others. Based on $$R^{2}$$ , values of (0.969, 0.957, 0.980 and 0.920) were found for testing of ICA-ANN, ABC-ANN, PSO-ANN and GA-ANN predictive models, respectively, which show higher efficiency of the PSO-ANN model in predicting slope SF values.

Three hybrid intelligent models in estimating flyrock distance resulting from blasting

Flyrock is an adverse effect produced by blasting in open-pit mines and tunnelling projects. So, it seems that the precise estimation of flyrock is essential in minimizing environmental effects induced by blasting. In this study, an attempt has been made to evaluate/predict flyrock induced by blasting through applying three hybrid intelligent systems, namely imperialist competitive algorithm (ICA)–artificial neural network (ANN), genetic algorithm (GA)–ANN and particle swarm optimization (PSO)–ANN. In fact, ICA, PSO and GA were used to adjust weights and biases of ANN model. To achieve the aim of this study, a database composed of 262 datasets with six model inputs including burden to spacing ratio, blast-hole diameter, powder factor, stemming length, the maximum charge per delay, and blast-hole depth and one output (flyrock distance) was established. Several parametric investigations were conducted to determine the most effective factors of GA, ICA and PSO algorithms. Then, at the end of modelling process of each hybrid model, eight models were constructed and their results were checked considering two performance indices, i.e., root mean square error (RMSE) and coefficient of determination (R2). The obtained results showed that although all predictive models are able to approximate flyrock, PSO–ANN predictive model can perform better compared to others. Based on R2, values of (0.943, 0.958 and 0.930) and (0.958, 0.959 and 0.932) were found for training and testing of ICA–ANN, PSO–ANN and GA–ANN predictive models, respectively. In addition, RMSE values of (0.052, 0.045 and 0.057) and (0.045, 0.044 and 0.058) were achieved for training and testing of ICA–ANN, PSO–ANN and GA–ANN predictive models, respectively. These results show higher efficiency of the PSO–ANN model in predicting flyrock distance resulting from blasting. Moreover, sensitivity analysis shows that hole diameter is more effective than others.