An energy-dependent partitioning scheme is explored for extracting a small number of eigenvalues of a real symmetric matrix with the help of a serial as well as parallel genetic algorithm (GA). The proposed method is ...
详细信息
An energy-dependent partitioning scheme is explored for extracting a small number of eigenvalues of a real symmetric matrix with the help of a serial as well as parallel genetic algorithm (GA). The proposed method is tested on two matrices (up to 2000 x 2000) with an increasing number of processors in a master- slave architecture. A comparison is made with the Jacobi-Davidson method in serial mode as implemented in the JDQZ-package. Different partition sizes are used. Traditionally used Lowdin's method is also tested in both serial and parallel modes. The advantages and disadvantages of the parallel GA-based method in solving the partitioned eigenvalue problem are analyzed.
This study develops an evolutionary strategy called DEPSO-GANN, which uses an artificial neural network (ANN) based on a parallel genetic algorithm (PGA) with migration for the adaptive control of integrated different...
详细信息
ISBN:
(纸本)9780769550732
This study develops an evolutionary strategy called DEPSO-GANN, which uses an artificial neural network (ANN) based on a parallel genetic algorithm (PGA) with migration for the adaptive control of integrated differential evolution (DE) and particle swarm optimization (PSO) to solve large-scale optimization problems, reduce calculation costs, and improve the stability of convergence towards the optimal solution. This approach combines the global search ability of DE and the local search ability of adaptive system with migration parallel GA. The proposed algorithm incorporates concepts from DE, PSO, PGA and neural networks (NN) to facilitate the adaptive control of parameters. DEPSO-GANN is applied to several numerical benchmark tests with multiple dimensions to evaluate its performance;it is also compared with other evolutionary algorithms (EAs) and memetic algorithms (MAs), which is shown to be statistically significantly superior to other EAs and MAs. We confirm satisfactory performance through various benchmark tests.
Search Based Software Testing (SBST) is one of the most explored fields in Software Testing. It suffers from the optimization problem to execute the Software Under Test (SUT). This problem is addressed mostly using Ge...
详细信息
ISBN:
(纸本)9781479939152
Search Based Software Testing (SBST) is one of the most explored fields in Software Testing. It suffers from the optimization problem to execute the Software Under Test (SUT). This problem is addressed mostly using geneticalgorithm (GA) and it involves three operations namely selection, crossover and mutation to accomplish a global search to yield fitness solution to run the SUT successfully. In existing work, GA is combined with Hadoop MapReduce to give parallel genetic algorithm (PGA). Here, mapper function performs parallel fitness computation and reducer function performs the GA. This PGA generates test suite that makes the entire SUT to get executed. This paper makes an attempt to existing by parallelizing fitness calculation and GA operations to generate search test data for the SUT based on branch coverage criteria.
The aim of the work described in this paper is to investigate the implementation of Multi-core parallel genetic algorithm(McPGA) for real-time turning of PID parameters based on it using *** performance of our scheme ...
详细信息
The aim of the work described in this paper is to investigate the implementation of Multi-core parallel genetic algorithm(McPGA) for real-time turning of PID parameters based on it using *** performance of our scheme is discussed in comparison with that of the Sequential geneticalgorithm(SGA) program running on the same *** experimental results clearly show that McPGA is much better than SGA on convergence,premature and optimized *** can be used for PID parameter real-time turning in Industry Process Control Computer(IPC).
With the application of the geneticalgorithm (GA) deeply developed, the research of parallel genetic algorithm (PGA) and its realization become very important. Because of PGA inner parallel mechanism, its parallel pr...
详细信息
ISBN:
(纸本)9781424421077
With the application of the geneticalgorithm (GA) deeply developed, the research of parallel genetic algorithm (PGA) and its realization become very important. Because of PGA inner parallel mechanism, its parallel process becomes a very naturally resolvable method. In this paper, four kinds of parallel models of parallel genetic algorithms, such as master-slave model, coarse-grained model, fine-grained model and mixed model, are simply generalized and evaluated. For every model, its characteristics are displayed. As for the existing problem to each model, the concerning parameters are illustrated in order to improve them. Then some main evaluation models of parallel genetic algorithms are presented. At the end, it is shown that parallel genetic algorithms should go on further study in the future.
This anomalies detection approach seeks the directions that maximize the projection index, so as to gain the anomalies structure information. Using geneticalgorithm in this approach can search accurate optimal projec...
详细信息
ISBN:
(纸本)9780819473639
This anomalies detection approach seeks the directions that maximize the projection index, so as to gain the anomalies structure information. Using geneticalgorithm in this approach can search accurate optimal projection directions, but it's a computation-intensive task. So, a parallelalgorithm under distributed memory system was presented. The projection directions were searched efficiently by parallel genetic algorithm model, and the projection directions' precision was guaranteed by using a strengthened terminal qualification. Then, the detected anomaly components were wiped off by projecting the data onto the subspace orthogonal to the previous projection directions, and the other anomalies were searched in the residual space. The final task of projection and objects segmentation was also completed in parallel. Using an OMIS hyperspectral data to test the parallelalgorithm's performance under an eight-node cluster, the process time reduced from 15 minutes to 2.8 minutes. The results show the validity and comparative good parallel efficiency.
In previous studies guide-based blending including inner and outer blending has been found to be an efficient way to deal with large composite optimization problem considering structural integrity. A new blending mode...
详细信息
ISBN:
(纸本)9783037858462
In previous studies guide-based blending including inner and outer blending has been found to be an efficient way to deal with large composite optimization problem considering structural integrity. A new blending model named generalized blending based on geneticalgorithm for composite optimization is presented. First, On the basis of region division, a length-control indicator is introduced to decide the covered regions of each ply for the generalized blending model. Also, the master-slave parallel genetic algorithm(GA) is adopted to decrease optimization time. Finally, the three blending models are used for a large composite wing optimization. The result shows that the three optimal designs are manufacturable and the generalized blending model has more design freedom in blending designs.
Regarding the air routing problems of logistics express delivery industry, we considered increasing cost so as to completely meet the delivery time requirement, a programming model of air routing problems with hard ti...
详细信息
Regarding the air routing problems of logistics express delivery industry, we considered increasing cost so as to completely meet the delivery time requirement, a programming model of air routing problems with hard time window, which was solved by parallel genetic algorithm, was presented,Meanwhile, the soft time window model was constructed to compare with the result of the hard window's, by building and applying satisfaction function. Numerical contrast analysis showed that the hard time window is of high cost as well as a greater satisfaction degree. This planning is more suitable for the character and requirement of the mid-market logistics.
作者：
Monakhov, O. G.Russian Acad Sci
Inst Computat Math & Math Geophys Siberian Branch Pr Aka Lavrenteva 6 Novosibirsk 630090 Russia
An approach to optimization of trading strategies (algorithms) is described based on indicators of financial markets and on evolutionary computations. A parallel genetic algorithm is presented for searching optimal pa...
详细信息
An approach to optimization of trading strategies (algorithms) is described based on indicators of financial markets and on evolutionary computations. A parallel genetic algorithm is presented for searching optimal parameters of trading strategies aimed at profit maximization.
Antiresonances have become an attractive alternative in structural damage assessment. They can be identified easier and more accurately than mode shapes, and still providing the same information. Antiresonances are de...
详细信息
Antiresonances have become an attractive alternative in structural damage assessment. They can be identified easier and more accurately than mode shapes, and still providing the same information. Antiresonances are derived from point frequency response functions (FRFs) or from transfer FRFs. However, antiresonances from transfer FRFs are very sensitive to small structural changes, and the matching between numerical and experimental antiresonances is affected. This problem is solved if antiresonances from point FRFs are used. However, it implies an experimental procedure that differs from a common modal testing, which may become not practical or too expensive. This paper proposes a damage detection method able to deal with transfer antiresonances. The inverse problem is handled by a parallel genetic algorithm. In this case, a perfect match between the antiresonances is not required because the optimization is not gradient based. Moreover, the matching can change at each step and the optimization is not affected. The algorithm is verified with two experimental cases: an exhaust system of a car with a single fatigue crack and a tridimensional space frame structure with single and multiple damage scenarios. Results are compared with the ones obtained using mode shapes. Damage detected is consistent with the experimental damage in both cases. Copyright (C) 2010 John Wiley & Sons, Ltd.
暂无评论