Recently Particle Swarm optimization (PSO) algorithm gained popularity and employed in many engineering applications because of its simplicity and efficiency. The performance of the PSO algorithm can further be improv...
详细信息
Recently Particle Swarm optimization (PSO) algorithm gained popularity and employed in many engineering applications because of its simplicity and efficiency. The performance of the PSO algorithm can further be improved by using hybrid techniques. There are various hybrid PSO algorithms published in the literature where researchers combine the benefits of PSO with other heuristics algorithms. In this paper, we propose a cooperative line search particle swarm optimization (CLS-PSO) algorithm by integrating local line search technique and basic PSO (B-PSO). The performance of the proposed hybrid algorithm, examined through four typically nonlinearoptimization problems, is reported. Our experimental results show that CLS-PSO outperforms basic PSO.
It is not uncommon in parallel workloads to encounter shared data structures with read-mostly access patterns, where operations that update data are infrequent and most operations are read-only. Typically, data consis...
详细信息
ISBN:
(纸本)9781450300193
It is not uncommon in parallel workloads to encounter shared data structures with read-mostly access patterns, where operations that update data are infrequent and most operations are read-only. Typically, data consistency is guaranteed using mutual exclusion or read-write locks. The cost of atomic update of lock variables result in high overheads and high cache coherence traffic under active sharing, thus slowing down single thread performance and limiting scalability. In this paper, we present SOLERO (software Optimistic Lock Elision for Read-Only critical sections), a new lock implementation called for optimizing read-only critical sections in Java based on sequential locks. SOLERO is compatible with the conventional lock implementation of Java. However, unlike the conventional implementation, only critical sections that may write data or have side effects need to update lock variables, while read-only critical sections need only read lock variables without writing them. Each writing critical section changes the lock value to a new value. Hence, a read-only critical section is guaranteed to be consistent if the lock is free and its value does not change from the beginning to the end of the read-only critical section. Using Java workloads including SPECjbb2005 and the HashMap and TreeMap Java classes, we evaluate the performance impact of applying SOLERO to read-mostly locks. Our experimental results show performance improvements across the board, often substantial, in both single thread speed and scalability over the conventional lock implementation (mutual exclusion) and read-write locks. SOLERO improves the performance of SPECjbb2005 by 3-5% on single and multiple threads. The results using the HashMap and TreeMap benchmarks show that SOLERO outperforms the conventional lock implementation and read-write locks by substantial multiples on multi-threads.
Task scheduling and task allocation, which are vital parts of mapping parallel programs to concurrent architectures, must take into account the interprocessor communication, whose overheads have emerged as the major p...
详细信息
A portfolio selection problem is about finding an optimal scheme to allocate a fixed amount of capital to a set of available assets. The optimal scheme is very helpful for investors in making decisions. However, findi...
详细信息
ISBN:
(纸本)9780769542539
A portfolio selection problem is about finding an optimal scheme to allocate a fixed amount of capital to a set of available assets. The optimal scheme is very helpful for investors in making decisions. However, finding the optimal scheme is difficult and time-consuming especially when the number of assets is large and some actual investment constraints are considered. This paper proposes a new approach based on estimation of distribution algorithms (EDAs) for solving a cardinality constrained portfolio selection (CCPS) problem. The proposed algorithm, termed PBILCCPS, hybridizes an EDA called population-based incremental learning (PBIL) algorithm and a continuous PBIL (PBILc) algorithm, to optimize the selection of assets and the allocation of capital respectively. The proposed algorithm adopts an adaptive parameter control strategy and an elitist strategy. The performance of the proposed algorithm is compared with a genetic algorithm and a particle swarm optimization algorithm. The results demonstrate that the proposed algorithm can achieve a satisfactory result for portfolio selection and perform well in searching nondominated portfolios with high expected returns.
In this paper, the use of the genetic algorithm in optimization of a nonlinear filter in adaptive noise cancellation (ANC) system is proposed. While the standard adaptive algorithms in nonlinear systems may converge t...
详细信息
In this paper, the use of the genetic algorithm in optimization of a nonlinear filter in adaptive noise cancellation (ANC) system is proposed. While the standard adaptive algorithms in nonlinear systems may converge to a local minimum, genetic algorithms (GAs) handle this problem efficiently. Computer simulations show that a superior performance is achieved using the proposed system with a not complex GA. A comparison of the proposed system with a popular ANC system also shows a high reduction of estimation error's power.
Though many numerical methods have been put for nonlinear equations, their convergence and performance are highly sensitive to the initial guesses of the solution pre-supplied. However, the selection of good initial g...
详细信息
Though many numerical methods have been put for nonlinear equations, their convergence and performance are highly sensitive to the initial guesses of the solution pre-supplied. However, the selection of good initial guess is often of hard work. Aiming at this, a novel approach is proposed to resolve nonlinear equations. It takes genetic algorithms' new achievement differential evolution algorithms as the main technique. With a function deflection technique and a novel space contraction method to re-initialize, it resolve nonlinear equations by transform them into correspondent optimization problems. Convergence reliability, computational cost and applicability of different algorithms were compared by testing several classical nonlinear equations and a benchmark mechanics problem. The numerical experiments done show that the put approach has reliable convergence probability, high convergence rate and solution precision. And DE is a successful approach in solving equations both in theory and application.
As a novel and promising algorithm, differential evolution (DE) has shown good performance in lots of optimization problems. It has been said that DE is one of the most competitive EAs for continuous optimization. As ...
详细信息
As a novel and promising algorithm, differential evolution (DE) has shown good performance in lots of optimization problems. It has been said that DE is one of the most competitive EAs for continuous optimization. As a kind of EAs, GT algorithm is a novel algorithm which based on multi-parent crossover. Compared with GT algorithm, DE performances better to find the global minima obviously. This paper presents a concept of pattern analyses to analyze the reason of the DE's highperformance. Then a new algorithm based on GT's multi-parent crossover and traditional DE's discrete recombination is presented for enhancing the performance of the obsolete and inefficient GT algorithm. According to the pattern analyses, the new algorithm obtains several patterns similar to DE. The experiments show the efficiency of the proposed new algorithm.
Particle Swarm optimization (PSO) is a new random computational method for tackling optimization functions. However, it is easily trapped into the local optimum when solving the complexity and high-dimensional problem...
详细信息
Particle Swarm optimization (PSO) is a new random computational method for tackling optimization functions. However, it is easily trapped into the local optimum when solving the complexity and high-dimensional problems, which makes the performance of PSO greatly reduced. To overcome this shortcoming, the paper proposes an Improved Particle Swarm optimization (IPSO), by adding the third particle of having a more room for progress to guide the current particles' velocity updating rule, Which can keep the diversity of the particles and reduce the probability of trapping into the local optimization .Besides, the program enhances and improves the stability and the convergence speed of the algorithm according to adjusting the particles which go beyond the default position space in each interiors. Five benchmark functions are tested, and the results indicate the effectiveness of the new program.
This paper describes the null steering method by position perturbation of selected elements with minimum sidelobe level using a proposed hybrid Enhanced Particle Swarm optimization (EPSO) / Differential Evolution (DE)...
This paper describes the null steering method by position perturbation of selected elements with minimum sidelobe level using a proposed hybrid Enhanced Particle Swarm optimization (EPSO) / Differential Evolution (DE) algorithm. EPSO and DE algorithms are proved to be high-performance evolutionary algorithms capable of solving nonlinearoptimization problems. Therefore, in this paper the two algorithms are combined and a robust EPSO/DE hybrid method is developed. This newly developed optimization algorithm is then applied to find the optimum number and the position of selected perturbed elements in the array to control the null towards the interference direction. The position perturbations of antenna elements are performed over the axial direction, elevation direction or combination of both. The hybridized algorithm has shown to give best result compared to each individual algorithm when applied to optimize different configurations.
Ensemble has been proved a successful approach for enhancing the performance of single classifiers. But there are two key factors influencing the performance of an ensemble directly: accuracy of each single member and...
详细信息
Ensemble has been proved a successful approach for enhancing the performance of single classifiers. But there are two key factors influencing the performance of an ensemble directly: accuracy of each single member and diversity between the members. There have been many approaches used in the literature to create the mentioned diversity. In this paper we add a novel approach, in which classifier type variance is utilized along with feature subset diversification to create a high diversity ensemble of different classifiers and an optimization is conducted on the initial population using a multi-objective evolutionary algorithm. The results of experiment over some standard data sets exhibit the outperformance of the suggested approach in comparison to existing ones in specific situations.
暂无评论