Name
Title | ||
|---|---|---|
An exploratory research of elitist probability schema and its applications in evolutionary algorithms |
Abstract | ||
|---|---|---|
An important problem in the study of evolutionary algorithms is how to continuously predict promising solutions while simultaneously escaping from local optima. In this paper, we propose an elitist probability schema (EPS) for the first time, to the best of our knowledge. Our schema is an index of binary strings that expresses the similarity of an elitist population at every string position. EPS expresses the accumulative effect of fitness selection with respect to the coding similarity of the population. For each generation, EPS can quantify the coding similarity of the population objectively and quickly. One of our key innovations is that EPS can continuously predict promising solutions while simultaneously escaping from local optima in most cases. To demonstrate the abilities of the EPS, we designed an elitist probability schema genetic algorithm and an elitist probability schema compact genetic algorithm. These algorithms are estimations of distribution algorithms (EDAs). We provided a fair comparison with the persistent elitist compact genetic algorithm (PeCGA), quantum-inspired evolutionary algorithm (QEA), and particle swarm optimization (PSO) for the 0---1 knapsack problem. The proposed algorithms converged quicker than PeCGA, QEA, and PSO, especially for the large knapsack problem. Furthermore, the computation time of the proposed algorithms was less than some EDAs that are based on building explicit probability models, and was approximately the same as QEA and PSO. This is acceptable for evolutionary algorithms, and satisfactory for EDAs. The proposed algorithms are successful with respect to convergence performance and computation time, which implies that EPS is satisfactory. |
Year | DOI | Venue |
|---|---|---|
2014 | 10.1007/s10489-013-0494-9 | Appl. Intell. |
Keywords | Field | DocType |
Coding similarity,Elitist probability schema,Genetic algorithm,Evolutionary algorithm,Estimation of distribution algorithm | Particle swarm optimization,EDAS,Population,Mathematical optimization,Evolutionary algorithm,Estimation of distribution algorithm,Local optimum,Computer science,Artificial intelligence,Knapsack problem,Genetic algorithm,Machine learning | Journal |
Volume | Issue | ISSN |
40 | 4 | 0924-669X |
Citations | PageRank | References |
1 | 0.34 | 32 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Hongguang Zhang | 1 | 106 | 16.70 |
| Y. Liu | 2 | 578 | 102.76 |
| Bihua Tang | 3 | 45 | 11.61 |
| Kaiming Liu | 4 | 34 | 8.76 |