Particle Swarm Optimization (PSO) is an innovative and competitive optimization technique for numerical optimization with real-parameter representation. This paper examines the working mechanism of PSO in a principled manner with forma analysis and investigates the applicability of PSO on the Quadratic Assignment Problem (QAP). Particularly, the derived PSO operator for QAP is empirically studi...

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

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

The reactive power planning and dispatch problems have been solved using Genetic algorithm (GA), Differential evolution (DE) and Particle Swarm Optimization (PSO) technique in order to have a comparative study on the performance of these algorithms. It has been found that Differential evolution performs best followed by the Particle swarm optimization. Both DE and PSO can perform well even with...

Metaheuristic optimization algorithms have become popular choice for solving complex and intricate problems which are otherwise difficult to solve by traditional methods. In the present study an attempt is made to review the hybrid optimization techniques in which one main algorithm is a well known metaheuristic; particle swarm optimization or PSO. Hybridization is a method of combining two (or...

So far various methods for optimization presented and one of most popular of them are optimization algorithms based on swarm intelligence and also one of most successful of them is Particle Swarm Optimization (PSO). Prior some efforts by applying fuzzy logic for improving defects of PSO such as trapping in local optimums and early convergence has been done. Moreover to overcome the problem of i...

By taking advantage of niche sharing scheme,we propose a novel co-evolutionary particle swarm optimization algorithm (NCPSO) to solve permutation flow shop scheduling problem. As the core of this algorithm, niche sharing scheme maximizes the diversity of population and hence improves the quality of individuals. To evaluate the performance of the proposed algorithm, we have use eight Taillard in...

A new model for evolving the structure of a Particle Swarm Optimization (PSO) algorithm is proposed in this paper. The model is a hybrid technique that combines a Genetic Algorithm (GA) and a PSO algorithm. Each GA chromosome is an array encoding a meaning for updating the particles of the PSO algorithm. The evolved PSO algorithm is compared to a human-designed PSO algorithm by using ten artifi...

This paper presents an optimal portfolio selection approach based on value at risk (VaR), conditional value at risk (CVaR), worst-case value at risk (WVaR) and partitioned value at risk (PVaR) measures as well as calculating these risk measures. Mathematical solution methods for solving these optimization problems are inadequate and very complex for a portfolio with high number of assets. For t...

Although many mathematicians have searched on the fractional calculus since many years ago, but its application in engineering, especially in modeling and control, does not have many antecedents. Since there are much freedom in choosing the order of differentiator and integrator in fractional calculus, it is possible to model the physical systems accurately. This paper deals with time-domain id...