Diagnosis of Autism Spectrum Disorder by Imperialistic Competitive Algorithm and Logistic Regression Classifier

Autism spectrum disorder(ASD),classified as a developmental disability,is now more common in children than ever.A drastic increase in the rate of autism spectrum disorder in children worldwide demands early detection of autism in children.Parents can seek professional help for a better prognosis of the child’s therapy when ASD is diagnosed under five years.This research study aims to develop an automated tool for diagnosing autism in children.The computer-aided diagnosis tool for ASD detection is designed and developed by a novel methodology that includes data acquisition,feature selection,and classification phases.The most deterministic features are selected from the self-acquired dataset by novel feature selection methods before classification.The Imperialistic competitive algorithm(ICA)based on empires conquering colonies performs feature selection in this study.The performance of Logistic Regression(LR),Decision tree,K-Nearest Neighbor(KNN),and Random Forest(RF)classifiers are experimentally studied in this research work.The experimental results prove that the Logistic regression classifier exhibits the highest accuracy for the self-acquired dataset.The ASD detection is evaluated experimentally with the Least Absolute Shrinkage and Selection Operator(LASSO)feature selection method and different classifiers.The Exploratory Data Analysis(EDA)phase has uncovered crucial facts about the data,like the correlation of the features in the dataset with the class variable.

Optimal Allocation of STATCOM to Enhance Transient Stability Using Imperialist Competitive Algorithm

With the daily expansion of global energy consumption,developing the power grids is of uttermost importance.However,building a new trans-mission line is costly and time-consuming,so utilizing the same lines with possible higher transmission capacity is very cost-effective.In this regard,to increase the capacity of the transmission lines,the flexible alternating current transmission system(FACTS)has been widely used in power grids in recent years by industrialized countries.One of the essential topics in electrical power systems is the reactive power compensation,and the FACTS plays a significant role in controlling the reactive power current in the power grid and the system voltage oscillations and stability.When a static synchronous compensator(STATCOM)is embedded in a power system to increase the bus voltage,a supplementary damping controller can be designed to enhance the system oscillation damping.Given the expansion of the grids in the power system,the complexity of their optimization and the extraordinary ability of the imperialist competitive algorithm(ICA)for solving such problems,in this paper,the ICA has been used to determine the optimal position and size of the FACTS devices.

Imperialistic Competitive Algorithm:A metaheuristic algorithm for locating the critical slip surface in 2-Dimensional soil slopes

In this study, Imperialistic Competitive Algorithm（ICA） is utilized for locating the critical failure surface and computing the factor of safety（FOS） in a slope stability analysis based on the limit equilibrium approach. The factor of safety relating to each trial slip surface is calculated using a simplified algorithm of the Morgenstern-Price method, which satisfies both the force and the moment equilibriums. General slip surface is considered non-circular in this study that is constituted by linking random straight lines.To explore the performance of the proposed algorithm, four benchmark test problems are analyzed. The results demonstrate that the present techniques can provide reliable, accurate and efficient solutions for locating the critical failure surface and relating FOS. Moreover, in contrast with previous studies the present algorithm could reach the lower value of FOS and reached more exact solutions.

Fault Attribute Reduction of Oil Immersed Transformer Based on Improved Imperialist Competitive Algorithm

The original fault data of oil immersed transformer often contains a large number of unnecessary attributes,which greatly increases the elapsed time of the algorithm and reduces the classification accuracy,leading to the rise of the diagnosis error rate.Therefore,in order to obtain high quality oil immersed transformer fault attribute data sets,an improved imperialist competitive algorithm was proposed to optimize the rough set to discretize the original fault data set and the attribute reduction.The feasibility of the proposed algorithm was verified by experiments and compared with other intelligent algorithms.Results show that the algorithm was stable at the 27th iteration with a reduction rate of 56.25%and a reduction accuracy of 98%.By using BP neural network to classify the reduction results,the accuracy was 86.25%,and the overall effect was better than those of the original data and other algorithms.Hence,the proposed method is effective for fault attribute reduction of oil immersed transformer.

A Cooperated Imperialist Competitive Algorithm for Unrelated Parallel Batch Machine Scheduling Problem

This study focuses on the scheduling problem of unrelated parallel batch processing machines(BPM)with release times,a scenario derived from the moulding process in a foundry.In this process,a batch is initially formed,placed in a sandbox,and then the sandbox is positioned on a BPM formoulding.The complexity of the scheduling problem increases due to the consideration of BPM capacity and sandbox volume.To minimize the makespan,a new cooperated imperialist competitive algorithm(CICA)is introduced.In CICA,the number of empires is not a parameter,and four empires aremaintained throughout the search process.Two types of assimilations are achieved:The strongest and weakest empires cooperate in their assimilation,while the remaining two empires,having a close normalization total cost,combine in their assimilation.A new form of imperialist competition is proposed to prevent insufficient competition,and the unique features of the problem are effectively utilized.Computational experiments are conducted across several instances,and a significant amount of experimental results show that the newstrategies of CICAare effective,indicating promising advantages for the considered BPMscheduling problems.

Direct load control by distributed imperialist competitive algorithm

Demand side management techniques have drawn significant attentions along with the development of smart grid.This paper proposes a new direct load control(DLC)model for scheduling interruptible air conditioner loads.The model is coordinated with the unit commitment and economic dispatch to minimize the total operation cost over the whole dispatch horizon.The network constraints are also considered in the model.To ensure the thermal comfort of the occupants,we are among the first to incorporate the advanced two-parameter thermal inertia dynamical model of customer houses into the DLC model to calculate the indoor temperature variation.This paper also proposes a distributed imperialist competitive algorithm to effectively solve the model.The simulation studies prove the efficiency of the proposed methodology.

FICA: fuzzy imperialist competitive algorithm

Despite the success of the imperialist competitive algorithm(ICA)in solving optimization problems,it still suffers from frequently falling into local minima and low convergence speed.In this paper,a fuzzy version of this algorithm is proposed to address these issues.In contrast to the standard version of ICA,in the proposed algorithm,powerful countries are chosen as imperialists in each step;according to a fuzzy membership function,other countries become colonies of all the empires.In absorption policy,based on the fuzzy membership function,colonies move toward the resulting vector of all imperialists.In this algorithm,no empire will be eliminated;instead,during the execution of the algorithm,empires move toward one point.Other steps of the algorithm are similar to the standard ICA.In experiments,the proposed algorithm has been used to solve the real world optimization problems presented for IEEE-CEC 2011 evolutionary algorithm competition.Results of experiments confirm the performance of the algorithm.

A fuzzy imperialistic competitive algorithm for optimizing convex functions

Purpose–The purpose of this paper is to describe imperialist competitive algorithm(ICA),a novel socio-politically inspired optimization strategy for proposing a fuzzy variant of this algorithm.ICA is a meta-heuristic algorithm for dealing with different optimization tasks.The basis of the algorithm is inspired by imperialistic competition.It attempts to present the social policy of imperialisms(referred to empires)to control more countries(referred to colonies)and use their sources.If one empire loses its power,among the others making a competition to take possession of it.Design/methodology/approach–In fuzzy imperialist competitive algorithm(FICA),the colonies have a degree of belonging to their imperialists and the top imperialist,as in fuzzy logic,rather than belonging completely to just one empire therefore the colonies move toward the superior empire and their relevant empires.Simultaneously for balancing the exploration and exploitation abilities of the ICA.The algorithms are used for optimization have shortcoming to deal with accuracy rate and local optimum trap and they need complex tuning procedures.FICA is proposed a way for optimizing convex function with high accuracy and avoiding to trap in local optima rather than using original ICA algorithm by implementing fuzzy logic on it.Findings–Therefore several solution procedures,including ICA,FICA,genetic algorithm,particle swarm optimization,tabu search and simulated annealing optimization algorithm are considered.Finally numerical experiments are carried out to evaluate the effectiveness of models as well as solution procedures.Test results present the suitability of the proposed fuzzy ICA for convex functions with little fluctuations.Originality/value–The proposed evolutionary algorithm,FICA,can be used in diverse areas of optimization problems where convex functions properties are appeared including,industrial planning,resource allocation,scheduling,decision making,pattern recognition and machine learning(optimization techniques;fuzzy logic;convex functions).

Energy loss optimization of run-off-road wheels applying imperialist competitive algorithm

The novel imperialist competitive algorithm(ICA)has presented outstanding fitness on various optimization problems.Application of meta-heuristics has been a dynamic studying interest of the reliability optimization to determine idleness and reliability constituents.The application of a meta-heuristic evolutionary optimization method,imperialist competitive algorithm(ICA),for minimization of energy loss due to wheel rolling resistance in a soil bin facility equipped with single-wheel tester is discussed.The required data were collected thorough various designed experiments in the controlled soil bin environment.Local and global searching of the search space proposed that the energy loss could be reduced to the minimum amount of 15.46 J at the optimized input variable configuration of wheel load at 1.2 kN,tire inflation pressure of 296 kPa and velocity of 2 m/s.Meanwhile,genetic algorithm(GA),particle swarm optimization(PSO)and hybridized GA–PSO approaches were benchmarked among the broad spectrum of meta-heuristics to find the outperforming approach.It was deduced that,on account of the obtained results,ICA can achieve optimum configuration with superior accuracy in less required computational time.

Tele-Network Design Based on Queue Competition Algorithm

In this paper, we report research on how to design the tele-network. First of all, we defined the reliability of tele-network. According to the definition, we divide the whole reliability into two parts:the reliability of the mini-way and that of the whole system. Then we do algebra unintersection of the mini-way, deriving a function of reliability of tele-network. Also, we got a function of the cost of tele-network after analyzing the cost of arcs and points. Finally, we give a mathematical model to design a tele-network. For the algorithm, we define the distance of a network and adjacent area within certain boundaries . We present a new algorithm--Queue Competition Algorithm (QCA) based on the adjacent area . The QCA correlates sequence of fitnesses in their father-generations with hunting zone of mutation and the number of individuals generated by mutation, making the stronger fitness in a small zone converge at a local extreme value, but the weaker one takes the advantage of lots of individuals and a big zone to hunt a new local extreme value. In this way, we get the overall extreme value. Numerical simulation shows that we can get the efficient hunting and exact solution by using QCA. The QCA efficient hunting and exact solution.

Evolutionary algorithm for optimization of multilayer coatings

In this paper, a new evolutionary algorithm, the well-known imperialist competition algorithm, is proposed for optimizing the optical thin-films. In this method, the process is modeled of the competition between countries as imperialists and their colonizing of others as colonies. This algorithm could be an appropriate alternative to some of the more popular algorithms for optimizing the optical thin-films for good performance. The polarizer and edge filter for example are designed by using the imperialist competition algorithm method and the results are compared with those from two optimization high-performance methods： the genetic algorithm and differential evolutionary algorithm. Based on these results,the performance of the imperialist competition algorithm method shows that this algorithm is not sensitive to the change of its parameters and it can be an important advantage for quickly achieving a global optimal point. On the other hand the results show a better ratio of P-polarization transmittance to S-polarization transmittance in the design of a 1540-nm polarizer, which is more appropriate than the results from the other two methods. In the second design, an edge filter with a lower number of layers and more uniform bandpass spectrum than the counterparts of those methods is obtained. These results indicate that the imperialist competition algorithm is a robust method for optical thin-film designs.

Power Maximization of A Point Absorber Wave Energy Converter Using Improved Model Predictive Control

This paper considers controlling and maximizing the absorbed power of wave energy converters for irregular waves. With respect to physical constraints of the system, a model predictive control is applied. Irregular waves’ behavior is predicted by Kalman filter method. Owing to the great influence of controller parameters on the absorbed power, these parameters are optimized by imperialist competitive algorithm. The results illustrate the method’s efficiency in maximizing the extracted power in the presence of unknown excitation force which should be predicted by Kalman filter.

Research on Optimization of Freight Train ATO Based on Elite Competition Multi-Objective Particle Swarm Optimization

In view of the complex problems that freight train ATO (automatic train operation) needs to comprehensively consider punctuality, energy saving and safety, a dynamics model of the freight train operation process is established based on the safety and the freight train dynamics model in the process of its operation. The algorithm of combining elite competition strategy with multi-objective particle swarm optimization technology is introduced, and the winning particles are obtained through the competition between two elite particles to guide the update of other particles, so as to balance the convergence and distribution of multi-objective particle swarm optimization. The performance comparison experimental results verify the superiority of the proposed algorithm. The simulation experiments of the actual line verify the feasibility of the model and the effectiveness of the proposed algorithm.

Adaptive Memory Coherence Algorithms in DSVM

Based on the characteristics of distrubuted system and the behavior of parallelprograms, this paper presents the fixed and randofored competitive memory coherence algorithms for distributed shared virtual memory These algorithms exploit parallel programs' locality of reference and dribit good competitive property Our simulation shows that the fixed and randomized algorithms achieve better performance and higher stability than other strategies such as write-invalldate and write-update.

Optimal Coordination of Directional Overcurrent Relays in Meshed Active Distribution Network Using Imperialistic Competition Algorithm

The optimal setting of directional overcurrent relays(DOCRs)ensures the fault detection and clearing in the minimum possible operation time.Directional protective relaying is carried out to coordinate relay settings in a meshed network in the presence of distributed generation.The main goal of DOCR coordination is to find the optimal time dial setting(TDS)and pickup multiplier setting(PMS)to reach the minimum total operation time of all primary relays in the presence of coordination constraints.Due to the complexity of mixed integer non-linear programming(MINLP)problem,imperialistic competition algorithm(ICA)as a powerful evolutionary algorithm is used to solve the coordination problem of DOCRs.The proposed DOCR coordination formulation is implemented in three different test cases.The results are compared with the standard branch-and-bound algorithm and other meta-heuristic optimization algorithms,which demonstrates the effectiveness of the proposed algorithm.

Online Learning Approaches in Maximizing Weighted Throughput in an Unreliable Channel

We design online algorithms to schedule unit-length packets with values and deadlines through an unreliable communication channel. In this model, time is discrete. Packets arrive over time; each packet has a non-negative value and an integer deadline. In each time step, at most one packet can be sent. The ratio of successfully delivering a packet depends on the channel＇s quality of reliability. The objective is to maximize the total value gained by delivering packets no later than their respective deadlines. In this paper, we conduct theoretical and empirical studies of online learning approaches for this model and a few of its variants. These online learning algorithms are analyzed in terms of external regret. We conclude that no online learning algorithms have constant regrets. Our online learning algorithms outperform online competitive algorithms in terms of algorithmic simplicity and running complexity. In general, these online learning algorithms work no worse than the best known competitive online algorithm for maximizing weighted throughput in practice.