615 research outputs found

    Optimization-Based Evolutionary Data Mining Techniques for Structural Health Monitoring

    Get PDF
    In recent years, data mining technology has been employed to solve various Structural Health Monitoring (SHM) problems as a comprehensive strategy because of its computational capability. Optimization is one the most important functions in Data mining. In an engineering optimization problem, it is not easy to find an exact solution. In this regard, evolutionary techniques have been applied as a part of procedure of achieving the exact solution. Therefore, various metaheuristic algorithms have been developed to solve a variety of engineering optimization problems in SHM. This study presents the most applicable as well as effective evolutionary techniques used in structural damage identification. To this end, a brief overview of metaheuristic techniques is discussed in this paper. Then the most applicable optimization-based algorithms in structural damage identification are presented, i.e. Particle Swarm Optimization (PSO), Genetic Algorithm (GA), Imperialist Competitive Algorithm (ICA) and Ant Colony Optimization (ACO). Some related examples are also detailed in order to indicate the efficiency of these algorithms

    Developing new models for flyrock distance assessment in open-pit mines

    Get PDF
    Peer ReviewedObjectius de Desenvolupament Sostenible::9 - Indústria, Innovació i InfraestructuraPostprint (published version

    Clustering stock exchange data by using evolutionary algorithms for portfolio management

    Get PDF
    In present paper, imperialist competitive algorithm and ant colony algorithm and particle swarm optimization algorithm have been used to cluster stocks of Tehran stock exchange. Also results of the three algorithms have been compared with three famous clustering models so called k-means, Fcm and Som. After clustering, a portfolio has been made by choosing some stocks from each cluster and using NSGA-II algorithm. Results show superiority of ant colony algorithms and particle swarm optimization algorithm and imperialist competitive to other three methods for clustering stocks. Due to diversification of the portfolio, portfolio risk will be reduced while using data chosen from the clusters. The more efficient the clustering, the lower the risk is. Also, using clustering for portfolio management reduces time of portfolio selection.peer-reviewe

    Optimal fuzzy proportional-integral-derivative control for a class of fourth-order nonlinear systems using imperialist competitive algorithms

    Get PDF
    The proportional integral derivative (PID) controller has gained wide acceptance and use as the most useful control approach in the industry. However, the PID controller lacks robustness to uncertainties and stability under disturbances. To address this problem, this paper proposes an optimal fuzzy-PID technique for a two-degree-of-freedom cart-pole system. Fuzzy rules can be combined with controllers such as PID to tune their coefficients and allow the controller to deliver substantially improved performance. To achieve this, the fuzzy logic method is applied in conjunction with the PID approach to provide essential control inputs and improve the control algorithm efficiency. The achieved control gains are then optimized via the imperialist competitive algorithm. Consequently, the objective function for the cart-pole system is regarded as the summation of the displacement error of the cart, the angular error of the pole, and the control force. This control concept has been tested via simulation and experimental validations. Obtained results are presented to confirm the accuracy and efficiency of the suggested method. © 2022 S. Hadipour Lakmesari et al

    A novel integrated approach of relevance vector machine optimized by imperialist competitive algorithm for spatial modeling of shallow landslides

    Get PDF
    This research aims at proposing a new artificial intelligence approach (namely RVM-ICA) which is based on the Relevance Vector Machine (RVM) and the Imperialist Competitive Algorithm (ICA) optimization for landslide susceptibility modeling. A Geographic Information System (GIS) spatial database was generated from Lang Son city in Lang Son province (Vietnam). This GIS database includes a landslide inventory map and fourteen landslide conditioning factors. The suitability of these factors for landslide susceptibility modeling in the study area was verified by the Information Gain Ratio (IGR) technique. A landslide susceptibility prediction model based on RVM-ICA and the GIS database was established by training and prediction phases. The predictive capability of the new approach was evaluated by calculations of sensitivity, specificity, accuracy, and the area under the Receiver Operating Characteristic curve (AUC). In addition, to assess the applicability of the proposed model, two state-of-the-art soft computing techniques including the support vector machine (SVM) and logistic regression (LR) were used as benchmark methods. The results of this study show that RVM-ICA with AUC = 0.92 achieved a high goodness-of-fit based on both the training and testing datasets. The predictive capability of RVM-ICA outperformed those of SVM with AUC = 0.91 and LR with AUC = 0.87. The experimental results confirm that the newly proposed model is a very promising alternative to assist planners and decision makers in the task of managing landslide prone areas

    Real Power Loss Reduction by Enhanced Imperialist Competitive Algorithm

    Get PDF
    In this paper, an Enhanced Imperialist Competitive (EIC) Algorithm is proposed for solving reactive power problem. Imperialist Competitive Algorithm (ICA) which was recently introduced has shown its decent performance in optimization problems. This innovative optimization algorithm is inspired by socio-political progression of imperialistic competition in the real world. In the proposed EIC algorithm, the chaotic maps are used to adapt the angle of colonies movement towards imperialist’s position to augment the evading capability from a local optima trap. The ICA is candidly stuck into a local optimum when solving numerical optimization problems. To overcome this insufficiency, we use four different chaotic maps combined into ICA to augment the search ability. Proposed Enhanced Imperialist Competitive (EIC) algorithm has been tested on standard IEEE 30 bus test system and simulation results show clearly the decent performance of the proposed algorithm in reducing the real power loss

    An improved discrete bat algorithm for symmetric and asymmetric traveling salesman problems

    Get PDF
    Bat algorithm is a population metaheuristic proposed in 2010 which is based on the echolocation or bio-sonar characteristics of microbats. Since its first implementation, the bat algorithm has been used in a wide range of fields. In this paper, we present a discrete version of the bat algorithm to solve the well-known symmetric and asymmetric traveling salesman problems. In addition, we propose an improvement in the basic structure of the classic bat algorithm. To prove that our proposal is a promising approximation method, we have compared its performance in 37 instances with the results obtained by five different techniques: evolutionary simulated annealing, genetic algorithm, an island based distributed genetic algorithm, a discrete firefly algorithm and an imperialist competitive algorithm. In order to obtain fair and rigorous comparisons, we have conducted three different statistical tests along the paper: the Student's tt-test, the Holm's test, and the Friedman test. We have also compared the convergence behaviour shown by our proposal with the ones shown by the evolutionary simulated annealing, and the discrete firefly algorithm. The experimentation carried out in this study has shown that the presented improved bat algorithm outperforms significantly all the other alternatives in most of the cases

    A Novel RSSI Prediction Using Imperialist Competition Algorithm (ICA), Radial Basis Function (RBF) and Firefly Algorithm (FFA) in Wireless Networks

    Get PDF
    This study aims to design a vertical handover prediction method to minimize unnecessary handovers for a mobile node (MN) during the vertical handover process. This relies on a novel method for the prediction of a received signal strength indicator (RSSI) referred to as IRBF-FFA, which is designed by utilizing the imperialist competition algorithm (ICA) to train the radial basis function (RBF), and by hybridizing with the firefly algorithm (FFA) to predict the optimal solution. The prediction accuracy of the proposed IRBF–FFA model was validated by comparing it to support vector machines (SVMs) and multilayer perceptron (MLP) models. In order to assess the model’s performance, we measured the coefficient of determination (R2), correlation coefficient (r), root mean square error (RMSE) and mean absolute percentage error (MAPE). The achieved results indicate that the IRBF–FFA model provides more precise predictions compared to different ANNs, namely, support vector machines (SVMs) and multilayer perceptron (MLP). The performance of the proposed model is analyzed through simulated and real-time RSSI measurements. The results also suggest that the IRBF–FFA model can be applied as an efficient technique for the accurate prediction of vertical handover
    corecore