Clonal Selection Based Memetic Algorithm for Job Shop Scheduling Problems

A clonal selection based memetic algorithm is proposed for solving job shop scheduling problems in this paper. In the proposed algorithm, the clonal selection and the local search mechanism are designed to enhance exploration and exploitation. In the clonal selection mechanism, clonal selection, hypermutation and receptor edit theories are presented to construct an evolutionary searching mechanism which is used for exploration. In the local search mechanism, a simulated annealing local search algorithm based on Nowicki and Smutnicki＇s neighborhood is presented to exploit local optima. The proposed algorithm is examined using some well-known benchmark problems. Numerical results validate the effectiveness of the proposed algorithm.

Improved clonal selection algorithm optimizing Neural Network for solving terminal anti-missile collaborative intercepting assistant decision-making model

Programming terminal high-low collaborative intercepting strategy scientifically and constructing assistant decision-making model with self-determination and intellectualization is onekey problem to enhance operational efficiency.Assistant decision-making model has been constructed after analysis on collaborative intercepting principle;then Improved Clonal Selection Algorithm Optimizing Neural Network(ICLONALGNN)is designed to solve the terminal anti-missile collaborative intercepting assistant decision-making model through introducing crossover operator to increase population diversity,introducing modified combination operator to make use of the information before crossover and mutation,introducing population update operator into traditional CLONALG to optimize Neural Network parameters.Experimental simulation confirms the superiority and practicability of the assistant decision-making model solved by ICLONALG-NN.

CLUSTERING VIA DIMENSIONAL REDUCTION METHOD FOR THE PROJECTION PURSUIT BASED ON THE ICSA

The performance of the classical clustering algorithm is not always satisfied with the high-dimensional datasets, which make clustering method limited in many application. To solve this problem, clustering method with Projection Pursuit dimension reduction based on Immune Clonal Selection Algorithm (ICSA-PP) is proposed in this paper. Projection pursuit strategy can maintain consistent Euclidean distances between points in the low-dimensional embeddings where the ICSA is used to search optimizing projection direction. The proposed algorithm can converge quickly with less iteration to reduce dimension of some high-dimensional datasets, and in which space, K-mean clustering algorithm is used to partition the reduced data. The experiment results on UCI data show that the presented method can search quicker to optimize projection direction than Genetic Algorithm (GA) and it has better clustering results compared with traditional linear dimension reduction method for Principle Component Analysis (PCA).