Quantum-behaved particle swarm optimization (QPSO) algorithm is a global convergence guaranteed algorithms, which has been applied widely for continuous optimization problems. In this paper, we propose an improved quantum-behaved particle swarm optimization with memory according to the means of best position of particles and using sigal step seaching strategy for sovle the multidimentional prob...

State assignment (SA) for finite state machines (FSMs) is one of the main optimization problems in the synthesis of sequential circuits. It determines the complexity of its combinational circuit and thus area, delay, testability and power dissipation of its implementation. Particle swarm optimization (PSO) is a nondeterministic heuristic that optimizes a problem by iteratively trying to improve...

In light of the accuracy of particle swarm optimization-particle filter (PSO-PF) inadequate for multi-robot cooperative positioning, the paper presents population density particle swarm optimization-particle filter (PDPSO-PF), which draws cooperative coevolutionary algorithm in ecology into particle swarm optimization. By taking full account of the competitive relationship between the environme...

in this work, by using the particle swarm optimization the electron raman scattering for square double quantum wells is optimized. for this purpose, by combining the particle swarm algorithm together with the numerical solution procedures for equations, and also the perturbation theory we find the optimal structure that maximizes the electron raman scattering. application of this algorithm to t...

in this paper, we proposed an algorithm for solving the problem of task scheduling using particle swarm optimization algorithm, with changes in the selection and removing the guide and also using the technique to get away from the bad, to move away from local extreme and diversity. scheduling algorithms play an important role in grid computing, parallel tasks scheduling and sending them to appr...

optimization techniques can be efficiently utilized to achieve an optimal shape for arch dams. this optimal design can consider the conditions of the economy and safety simultaneously. the main aim is to present an applicable and practical model and suggest an algorithm for optimization of concrete arch dams to enhance their seismic performance. to achieve this purpose, a preliminary optimizati...

the gravitational search algorithm (gsa) is a novel optimization methodbased on the law of gravity and mass interactions. it has good ability to search forthe global optimum, but its searching speed is really slow in the last iterations. sothe hybridization of particle swarm optimization (pso) and gsa can resolve theaforementioned problem. in this paper, a modified pso, which the movement ofpar...

the markowitz’s optimization problem is considered as a standard quadratic programming problem that has exact mathematical solutions. considering real world limits and conditions, the portfolio optimization problem is a mixed quadratic and integer programming problem for which efficient algorithms do not exist. therefore, the use of meta-heuristic methods such as neural networks and evolutionar...

the traveling salesman problem (tsp) is the problem of finding the shortest tour through all the nodes that a salesman has to visit. the tsp is probably the most famous and extensively studied problem in the field of combinatorial optimization. because this problem is an np-hard problem, practical large-scale instances cannot be solved by exact algorithms within acceptable computational times. ...

In this paper, we incorporate pheromone courtship mode of biology to improve particle swarm optimizer. The particle swarm optimization technique has ever since turned out to be a competitor in the field of numerical optimization. A particle swarm optimization consists of a number of individuals refining their knowledge of the given search space. Particle swarm optimizations are inspired by part...