Coronary artery disease (CAD) is one of the major causes of mortality worldwide. Knowledge about risk factors that increase the probability of developing CAD can help to understand the disease better and assist in its treatment. Recently, modern computer-aided approaches have been used for the prediction and diagnosis of diseases. Swarm intelligence algorithms like particle swarm optimization (PSO) have demonstrated great performance in solving different optimization problems. As rule discovery can be modelled as an optimization problem, it can be mapped to an optimization problem and solved by means of an evolutionary algorithm like PSO. An approach for discovering classification rules of CAD is proposed. The work is based on the real-world CAD data set and aims at the detection of this disease by producing the accurate and effective rules. The proposed algorithm is a hybrid binary-real PSO, which includes the combination of categorical and numerical encoding of a particle and a different approach for calculating the velocity of particles. The rules were developed from randomly generated particles, which take random values in the range of each attribute in the rule. Two different feature selection methods based on multi-objective evolutionary search and PSO were applied on the data set, and the most relevant features were selected by the algorithms. The accuracy of two different rule sets were evaluated. The rule set with 11 features obtained more accurate results than the rule set with 13 features. Our results show that the proposed approach has the ability to produce effective rules with highest accuracy for the detection of CAD.

No abstract

In this study, a hybrid of Quantum Evolutionary and Artificial Immune Algorithms (QIA) is proposed for solving Multiobjective Flexible Job Shop Scheduling Problem (MFJSSP). This problem is formulated as three-objective problem which minimizes completion time (makespan), critical machine workload and total work load of all machines. The quantum coding is shown to improve the immune strategy. The proposed algorithm overcomes the problem by increasing the speed of convergence and diversity of population. Three benchmarks of Kacem and Brandimart are examined to evaluate the performance of the proposed algorithm. The experimental results show a better performance in comparison to other approaches.

No abstract

No abstract