Hierarchical variable selection method (UVE-SPA-CSA) based on uninformative variable elimination (UVE), successive projections algorithm (SPA) and clonal selection algorithm (CSA) was proposed and applied for the firs...
详细信息
Hierarchical variable selection method (UVE-SPA-CSA) based on uninformative variable elimination (UVE), successive projections algorithm (SPA) and clonal selection algorithm (CSA) was proposed and applied for the first time to near infrared (NIR) hyperspectral data of lamb meats for predicting chemical constituents of fat, protein and water contents. Instead of selecting different sets of optimum wavelengths for these chemical constituents, only a set of optimum wavelengths were selected with the proposed technique for fat, protein and water. At first, sensitive wavelengths were identified using combinations of UVE and SPA for fat (910, 961, 988, 1011, 1064, 1084, 1192 and 1212 nm), protein (921, 944, 947, 971, 1021, 1091, 1269 and 1396 nm) and water (910, 961, 994, 1058, 1131, 1195, 1198 and 1312 nm), and merged into instrumental optimal wavelengths (IOW). Then, on the basis of the built optimization formulations and CSA, only seven wavelengths (1021, 1084, 1091, 1192, 1212, 1269 and 1396 nm) were selected as the prediction optimum wavelengths (POW) for predicting fat, protein and water contents in lamb meats. The multiple linear regression (MLR) models were developed to relate absorbance spectra of lamb samples and their chemical constituents (i.e. fat, protein and water contents) using POW. The fat, protein and water contents were predicted with correlation coefficient of calibration (R-c) of 0.95, 0.80 and 0.91, and residual prediction deviation (RPD) of 4.13, 1.31 and 2.53, respectively. Based on the obtained MLR equations, the distribution maps of these chemical constituents within lamb meats were generated to help knowing and understanding the heterogeneity of lamb meats. The results indicated that the proposed UVE-SPA-CSA is useful for variable selection of hyperspectral imaging and prediction of chemical constituents of lamb meats. (C) 2014 Elsevier Ltd. All rights reserved.
This paper presents the clonal selection algorithm (CSA) to select a proper subset of features and optimal parameters of Support Vector Machines (SVMs) classifier. Like the genetic algorithm, clonalselection algorith...
详细信息
ISBN:
(纸本)9780769538884
This paper presents the clonal selection algorithm (CSA) to select a proper subset of features and optimal parameters of Support Vector Machines (SVMs) classifier. Like the genetic algorithm, clonal selection algorithm is a tool for optimum solution to select better parameters, in our experiment, to improve classification accuracy, the clonal selection algorithm and genetic algorithm are used to reach the optimization performances with several real-world datasets. The experiments show the effectiveness of the methods. And those results are compared each other. The experiments denote that the proposed clonal selection algorithm is shown to be an evolutionary strategy capable of improving the classification accuracy and has fewer features for support vector machines.
This paper proposes a new method to improve the reliability of the distribution system using the reconfiguration strategy. In this regard, a new cost function is defined to include the cost of active power losses of t...
详细信息
This paper proposes a new method to improve the reliability of the distribution system using the reconfiguration strategy. In this regard, a new cost function is defined to include the cost of active power losses of the network and the customer interruption costs simultaneously. Also, in order to calculate the reliability indices of the load points, the reconfiguration technique is considered as a failure-rate reduction strategy. Regarding the reliability cost, the composite customer damage function is employed to find the customer interruption cost data. Meanwhile, a powerful stochastic framework based on a two- point estimate method is proposed to capture the uncertainty of random parameters. Also, a novel self-adaptive modification method based on the clonal selection algorithm is proposed as the optimization tool. The feasibility and satisfying performance of the proposed method are examined on the 69-bus IEEE test system.
clonal selection algorithm (CSA), based on the clonalselection theory proposed by Burnet, has gained much attention and wide applications during the last decade. However, the proliferation process in the case of immu...
详细信息
clonal selection algorithm (CSA), based on the clonalselection theory proposed by Burnet, has gained much attention and wide applications during the last decade. However, the proliferation process in the case of immune cells is asexual. That is, there is no information exchange during different immune cells. As a result the traditional CSA is often not satisfactory and is easy to be trapped in local optima so as to be premature convergence. To solve such a problem, inspired by the quantum interference mechanics, an improved quantum crossover operator is introduced and embedded in the traditional CSA. Simulation results based on the traveling salesman problems (TSP) have demonstrated the effectiveness of the quantum crossover-based clonal selection algorithm.
This paper presents a hybrid optimisation method based on the fusion of the clonal selection algorithm (CSA) and harmony search (HS) technique. The CSA is employed to improve the harmony memory members in the HS metho...
详细信息
This paper presents a hybrid optimisation method based on the fusion of the clonal selection algorithm (CSA) and harmony search (HS) technique. The CSA is employed to improve the harmony memory members in the HS method. The hybrid optimisation algorithm is further used to optimise Sugeno fuzzy classification systems for the Fisher Iris data and wine data classification. Computer simulations results demonstrate the remarkable effectiveness of our new approach.
Reducing peak-to-average power ratio (PAPR) is an implementation challenge in orthogonal frequency division multiplexing (OFDM) systems. One way to reduce PAPR is to apply a set of selected partial transmission sequen...
详细信息
ISBN:
(纸本)9781479940752
Reducing peak-to-average power ratio (PAPR) is an implementation challenge in orthogonal frequency division multiplexing (OFDM) systems. One way to reduce PAPR is to apply a set of selected partial transmission sequence (PTS) to the transmit signals. However, PTS selection is a highly complex NP-hard problem and the computational complexity is very high when a large number of subcarriers are used in the OFDM system. In this paper, we propose a new heuristic PTS selection method, the modified chaos clonal shuffled frog leaping algorithm (MCCSFLA-PTS). The MCCSFLA-PTS is inspired by natural clonalselection of frog colony and based on chaos theory. Simulation results show that the proposed MCCSFLA-PTS achieves better PAPR reduction than genetic, quantum evolutionary and selective mapping algorithms. Furthermore, the proposed algorithm converges faster than the genetic and quantum evolutionary algorithms.
This research work proposes application and implementation of artificial immune system approach to develop an algorithm for optimizing multi objective problems. The objective of this research work is to study, analyze...
详细信息
ISBN:
(纸本)9781479966295
This research work proposes application and implementation of artificial immune system approach to develop an algorithm for optimizing multi objective problems. The objective of this research work is to study, analyze and enhance the artificial immune system approach for developing an algorithm to solve various real life engineering multi-objective optimization problems.
Flexible Job-shop Scheduling Problem (FJSP) is expanded from the traditional Job-shop Scheduling Problem (JSP), which possesses wider availability of machines for all the operations. The aim is to find an allocation f...
详细信息
ISBN:
(纸本)9780769536453
Flexible Job-shop Scheduling Problem (FJSP) is expanded from the traditional Job-shop Scheduling Problem (JSP), which possesses wider availability of machines for all the operations. The aim is to find an allocation for each operation and to define the sequence of operations on each machine so that the resulting schedule has a minimal completion time. This paper introduces a hybrid metaheuristic, the stretching technique-based immune algorithm, consisting of a combination of the stretching technique and clonal selection algorithm (CSA). The proposed method is used for solving the multi-objective FJSP. The details of implementation for the multi-objective FJSP and the corresponding computational experiments are reported. The results indicate that the proposed algorithm is an efficient approach for the multi-objective FJSP, especially for large scale problems.
The job shop scheduling problem (JSSP) is a notoriously difficult problem in combinatorial optimization. Extensive investigation has been devoted to developing efficient algorithms to find optimal or near-optimal solu...
详细信息
ISBN:
(纸本)9780769536194
The job shop scheduling problem (JSSP) is a notoriously difficult problem in combinatorial optimization. Extensive investigation has been devoted to developing efficient algorithms to find optimal or near-optimal solutions. This paper proposes an improved immune clonal selection algorithm, called improved clonal selection algorithm for the JSSP. The new algorithm has the advantage of preventing from prematurity and fast convergence speed. Numerous well-studied benchmark examples in job-shop scheduling problems were utilized to evaluate the proposed approach. The computational results show that the proposed algorithm could obtain the high-quality solutions within reasonable computing times, and the results indicate the effectiveness and flexibility of the immune memory clonal selection algorithm.
Particle Swarm Optimization, a nature-inspired evolutionary algorithm, has been successful in solving a wide range of real-value optimization problems. However, little attempts have been made to extend it to discrete ...
详细信息
ISBN:
(纸本)9780769535838
Particle Swarm Optimization, a nature-inspired evolutionary algorithm, has been successful in solving a wide range of real-value optimization problems. However, little attempts have been made to extend it to discrete problems. In this paper, a new particle swarm optimization method based on the clonal selection algorithm is proposed to avoid premature convergence and guarantee the diversity of the population. The experimental results show that the new algorithm not only has great advantage of convergence property over clonal selection algorithm and PSO, but also can avoid the premature convergence problem effectively.
暂无评论