OPTIMIZATION OF AIRPORT TAXIING PLANNING DURING CONGESTED HOURS BASED ON IMMUNE CLONAL SELECTION ALGORITHM

In order to ease congestion and ground delays in major hub airports, an aircraft taxiing scheduling optimization model is proposed with schedule time as the object function. In the new model, the idea of a classical job shop-schedule problem is adopted and three types of special aircraft-taxi conflicts are considered in the constraints. To solve such nondeterministic polynomial time-complex problems, the immune clonal selection algorithm（ICSA） is introduced. The simulation results in a congested hour of Beijing Capital International Airport show that, compared with the first-come-first-served（FCFS） strategy, the optimization-planning strategy reduces the total scheduling time by 13.6 min and the taxiing time per aircraft by 45.3 s, which improves the capacity of the runway and the efficiency of airport operations.

Directional Filter for SAR Images Based on Nonsubsampled Contourlet Transform and Immune Clonal Selection

A directional filter algorithm for intensity synthetic aperture radar （SAR） image based on nonsubsampled contourlet transform （NSCT） and immune clonal selection （ICS） is presented. The proposed filter mainly focuses on exploiting different features of edges and noises by NSCT. Furthermore, ICS strategy is introduced to optimize threshold parameter and amplify parameter adaptively. Numerical experiments on real SAR images show that there are improvements in both visual effects and objective indexes.

An optimization algorithm for locomotive secondary spring load adjustment based on artificial immune

In order to control the locomotive wheel(axle) load distribution, a shimming process to adjust the locomotive secondary spring loads was heretofore developed. An immune dominance clonal selection multi-objective algorithm based on the artificial immune system was presented to further improve the performance of the optimization algorithm for locomotive secondary spring load adjustment, especially to solve the lack of control on the output shim quantity. The algorithm was designed into a two-level optimization structure according to the preferences of the problem, and the priori knowledge of the problem was used as the immune dominance. Experiments on various types of locomotives show that owing to the novel algorithm, the shim quantity is cut down by 30% 60% and the calculation time is about 90% less while the secondary spring load distribution is controlled on the same level as before. The application of this optimization algorithm can significantly improve the availability and efficiency of the secondary spring adjustment process.

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).

Clonal Strategy Algorithm Based on the Immune Memory

Based on the clonal selection theory and immune memory mechanism in the natural immune system, a novel artificial immune system algorithm, Clonal Strategy Algorithm based on the Immune Memory （CSAIM）, is proposed in this paper. The algorithm realizes the evolution of antibody population and the evolution of memory unit at the same time, and by using clonal selection operator, the global optimal computation can be combined with the local searching. According to antibody-antibody （Ab-Ab） affinity and antibody-antigen （Ab-Ag） affinity, the algorithm can allot adaptively the scales of memory unit and antibody population. It is proved theoretically that CSAIM is convergent with probability 1. And with the computer simulations of eight benchmark functions and one instance of traveling salesman problem （TSP）, it is shown that CSAIM has strong abilities in having high convergence speed, enhancing the diversity of the population and avoiding the premature convergence to some extent.