The difficulty of current multi-objective optimization community lies in the large number of objectives. Lacking enough selection pressure toward the Pareto front,classical algorithms are greatly restrained. In this paper,preference rank immune memory clone selection algorithm (PISA) is proposed to solve the problem of multi-objective optimization with a large number of objectives. The nondominated antibodies are proportionally cloned by their preference ranks,which are defined by their preference information. It is beneficial to increase selection pressure and speed up convergence to the true Pareto-optimal front. Solutions used to approximate the Pareto front can be reduced by preference information. Because only nondominated antibodies are selected to operate,the time complexity of the algorithm can be reduced. Besides,an immune memory population is kept to preserve the nondominated antibodies and ε dominance is employed to maintain the diversity of the immune memory population. Tested in several multi-objective problems with 2 objectives and DTLZ2 and DTLZ3 as high as 8 objectives,PISA is experimentally effective.
Synthetic aperture radar (SAR) image segmentation usually involves two crucial issues: suitable speckle noise removing technique and effective image segmentation methodology. Here, an efficient SAR image segmentation method considering both of the two aspects is presented. As for the first issue, the famous nonlocal mean (NLM) filter is introduced in this study to suppress the multiplicative speckle noise in SAR image. Furthermore, to achieve a higher denoising accuracy, the local neighboring pixels in the searching window are projected into a lower dimensional subspace by principal component analysis (PCA). Thus, the nonlocal mean filter is implemented in the subspace. Afterwards, a multi-objective clustering algorithm is proposed using the principals of artificial immune system (AIS) and kernel-induced distance measures. The multi-objective clustering has been shown to discover the data distribution with different characteristics and the kernel methods can improve its robustness to noise and outliers. Experiments demonstrate that the proposed method is able to partition the SAR image robustly and accurately than the conventional approaches.
A novel hybrid multiobjective algorithm is presented in this paper, which combines a new multiobjective estimation of distribution algorithm, an efficient local searcher andε-dominance. Besides, two multiobjective problems with variable linkages strictly based on manifold distribution are proposed. The Pareto set to the continuous multiobjective optimization problems, in the decision space, is a piecewise low-dimensional continuous manifold. The regularity by the manifold features just build probability distribution model by globally statistical information from the population, yet, the efficiency of promising individuals is not well exploited, which is not beneficial to search and optimization process. Hereby, an incremental tournament local searcher is designed to exploit local information efficiently and accelerate convergence to the true Pareto-optimal front. Besides, sinceε-dominance is a strategy that can make multiobjective algorithm gain well distributed solutions and has low computational complexity,ε-dominance and the incremental tournament local searcher are combined here. The novel memetic multiobjective estimation of distribution algorithm, MMEDA, was proposed accordingly. The algorithm is validated by experiment on twenty-two test problems with and without variable linkages of diverse complexities. Compared with three state-of-the-art multiobjective optimization algorithms, our algorithm achieves comparable results in terms of convergence and diversity metrics.