This paper presents a hybrid particle swarm algorithm for solving the multiobjective reactive power dispatch problem. Modal analysis of the system is used for static voltage stability assessment. Loss minimization and maximization of voltage stability margin are taken as the objectives. Generator terminal voltages, reactive power generation of the capacitor banks and tap changing transformer se...

Flexible AC Transmission Systems (FACTS) controllers with its ability to directly control the power flow can offer great opportunities in modern power system, allowing better and safer operation of transmission network. In this paper, in order to find type, size and location of FACTS devices in a power system a Dedicated Improved Particle Swarm Optimization (DIPSO) algorithm is developed for de...

In this paper, the investment portfolio is formed based on the data mining algorithm of CHAID on the basis of the risk status criteria. In the next step, the second investment portfolio is created based on the decision rules extracted by the DEA-BCC model. The final portfolio is created through a two-objective mathematical programming model based on the Imperialist Competitive algorithm.

This paper try to solve the route optimization of stacker in automated storage and retrieval system with the hybrid algorithm which based on the combination of genetic algorithm and particle swarm optimization. First the algorithm generates the initial population by using particle swarm algorithm. And then the population undertakes assorted crossover and mutation in the iterative process by usi...

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...

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. ...