scholarly journals An Improved Quantum-Inspired Genetic Algorithm for Image Multilevel Thresholding Segmentation

2014 ◽  
Vol 2014 ◽  
pp. 1-12 ◽  
Author(s):  
Jian Zhang ◽  
Huanzhou Li ◽  
Zhangguo Tang ◽  
Qiuping Lu ◽  
Xiuqing Zheng ◽  
...  
Keyword(s):  
Genetic Algorithm ◽  
Cooperative Learning ◽  
Learning Strategy ◽  
Solution Space ◽  
High Dimensional ◽  
Multilevel Thresholding ◽  
Dimensional Solution ◽  
Quantum Genetic Algorithm ◽  
Adjustment Strategy ◽  
Adaptive Adjustment

A multilevel thresholding algorithm for histogram-based image segmentation is presented in this paper. The proposed algorithm introduces an adaptive adjustment strategy of the rotation angle and a cooperative learning strategy into quantum genetic algorithm (called IQGA). An adaptive adjustment strategy of the quantum rotation which is introduced in this study helps improving the convergence speed, search ability, and stability. Cooperative learning enhances the search ability in the high-dimensional solution space by splitting a high-dimensional vector into several one-dimensional vectors. The experimental results demonstrate good performance of the IQGA in solving multilevel thresholding segmentation problem by compared with QGA, GA and PSO.

scholarly journals Optimization of Network Coding Resources Based on Improved Quantum Genetic Algorithm

Photonics ◽  
2021 ◽  
Vol 8 (11) ◽  
pp. 502
Author(s):  
Tianyang Liu ◽  
Qiang Sun ◽  
Huachun Zhou ◽  
Qi Wei
Keyword(s):  
Genetic Algorithm ◽  
Network Coding ◽  
Topological Structure ◽  
Rotation Angle ◽  
Optimization Problems ◽  
Optimal Solution ◽  
Resource Optimization ◽  
Quantum Genetic Algorithm ◽  
Adjustment Mechanism ◽  
Adaptive Adjustment

The problem of network coding resource optimization with a known topological structure is NP-hard. Traditional quantum genetic algorithms have the disadvantages of slow convergence and difficulty in finding the optimal solution when dealing with this problem. To overcome these disadvantages, this paper proposes an adaptive quantum genetic algorithm based on the cooperative mutation of gene number and fitness (GNF-QGA). This GNF-QGA adopts the rotation angle adaptive adjustment mechanism. To avoid excessive illegal individuals, an illegal solution adjustment mechanism is added to the GNF-QGA. A solid demonstration was provided that the proposed algorithm has a fast convergence speed and good optimization capability when solving network coding resource optimization problems.

On the Optimal Decomposition of High-Dimensional Solution Spaces of Complex Systems

2017 ◽  
Vol 4 (2) ◽  
Author(s):  
Stefan Erschen ◽  
Fabian Duddeck ◽  
Matthias Gerdts ◽  
Markus Zimmermann
Keyword(s):  
Complete Solution ◽  
Cartesian Product ◽  
Solution Space ◽  
Linear Functions ◽  
High Dimensional ◽  
Development Work ◽  
Interior Point Algorithm ◽  
Dimensional Solution ◽  
Design Work ◽  
Design Variables

In the early development phase of complex technical systems, uncertainties caused by unknown design restrictions must be considered. In order to avoid premature design decisions, sets of good designs, i.e., designs which satisfy all design goals, are sought rather than one optimal design that may later turn out to be infeasible. A set of good designs is called a solution space and serves as target region for design variables, including those that quantify properties of components or subsystems. Often, the solution space is approximated, e.g., to enable independent development work. Algorithms that approximate the solution space as high-dimensional boxes are available, in which edges represent permissible intervals for single design variables. The box size is maximized to provide large target regions and facilitate design work. As a result of geometrical mismatch, however, boxes typically capture only a small portion of the complete solution space. To reduce this loss of solution space while still enabling independent development work, this paper presents a new approach that optimizes a set of permissible two-dimensional (2D) regions for pairs of design variables, so-called 2D-spaces. Each 2D-space is confined by polygons. The Cartesian product of all 2D-spaces forms a solution space for all design variables. An optimization problem is formulated that maximizes the size of the solution space, and is solved using an interior-point algorithm. The approach is applicable to arbitrary systems with performance measures that can be expressed or approximated as linear functions of their design variables. Its effectiveness is demonstrated in a chassis design problem.

scholarly journals Enhancing hierarchical surrogate-assisted evolutionary algorithm for high-dimensional expensive optimization via random projection

2021 ◽  
Author(s):  
Xiaodong Ren ◽  
Daofu Guo ◽  
Zhigang Ren ◽  
Yongsheng Liang ◽  
An Chen
Keyword(s):  
Optimization Problems ◽  
Solution Space ◽  
Random Projection ◽  
Surrogate Models ◽  
High Dimensional ◽  
Local Models ◽  
Dimensional Solution ◽  
Training Samples ◽  
Low Dimensional ◽  
Expensive Optimization

AbstractBy remarkably reducing real fitness evaluations, surrogate-assisted evolutionary algorithms (SAEAs), especially hierarchical SAEAs, have been shown to be effective in solving computationally expensive optimization problems. The success of hierarchical SAEAs mainly profits from the potential benefit of their global surrogate models known as “blessing of uncertainty” and the high accuracy of local models. However, their performance leaves room for improvement on high-dimensional problems since now it is still challenging to build accurate enough local models due to the huge solution space. Directing against this issue, this study proposes a new hierarchical SAEA by training local surrogate models with the help of the random projection technique. Instead of executing training in the original high-dimensional solution space, the new algorithm first randomly projects training samples onto a set of low-dimensional subspaces, then trains a surrogate model in each subspace, and finally achieves evaluations of candidate solutions by averaging the resulting models. Experimental results on seven benchmark functions of 100 and 200 dimensions demonstrate that random projection can significantly improve the accuracy of local surrogate models and the new proposed hierarchical SAEA possesses an obvious edge over state-of-the-art SAEAs.

scholarly journals Fault Detection of Diesel Engine Air and after-Treatment Systems with High-Dimensional Data: A Novel Fault-Relevant Feature Selection Method

Processes ◽  
2021 ◽  
Vol 9 (2) ◽  
pp. 259
Author(s):  
Qilan Ran ◽  
Yedong Song ◽  
Wenli Du ◽  
Wei Du ◽  
Xin Peng
Keyword(s):  
Genetic Algorithm ◽  
Diesel Engine ◽  
Fault Detection ◽  
Correlation Analysis ◽  
Canonical Correlation Analysis ◽  
Diesel Engines ◽  
Canonical Correlation ◽  
High Dimensional Data ◽  
High Dimensional ◽  
Relevant Variables

In order to reduce pollutants of the emission from diesel vehicles, complex after-treatment technologies have been proposed, which make the fault detection of diesel engines become increasingly difficult. Thus, this paper proposes a canonical correlation analysis detection method based on fault-relevant variables selected by an elitist genetic algorithm to realize high-dimensional data-driven faults detection of diesel engines. The method proposed establishes a fault detection model by the actual operation data to overcome the limitations of the traditional methods, merely based on benchmark. Moreover, the canonical correlation analysis is used to extract the strong correlation between variables, which constructs the residual vector to realize the fault detection of the diesel engine air and after-treatment system. In particular, the elitist genetic algorithm is used to optimize the fault-relevant variables to reduce detection redundancy, eliminate additional noise interference, and improve the detection rate of the specific fault. The experiments are carried out by implementing the practical state data of a diesel engine, which show the feasibility and efficiency of the proposed approach.

Sign in / Sign up

Export Citation Format

Share Document