In this article we describe a novel Particle Swarm Optimization (PSO) approach to multi-objective optimization (MOO), called Time Variant Multi-Objective Particle Swarm Optimization (TV-MOPSO). TV-MOPSO is made adaptive in nature by allowing its vital parameters (viz., inertia weight and acceleration coefficients) to change with iterations. This adaptiveness helps the algorithm to explore the s...

In recent years, symbiosis as a rich source of potential engineering applications and computational model has attracted more and more attentions in the adaptive complex systems and evolution computing domains. Inspired by different symbiotic coevolution forms in nature, this paper proposed a series of multi-swarm particle swarm optimizers called PS2Os, which extend the single population particl...

Particle Swarm Optimization (PSO) has been extensively used in recent years for the optimization of nonlinear optimization problems. Two of the most popular variants of PSO are PSO-W (PSO with inertia weight) and PSO-C (PSO with constriction factor). Typically particles in swarm use information from global best performing particle, gbest and their own personal best, pbest. Recently, studies hav...

A new global path planning approach based on particle swarm optimization (PSO) for a mobile robot in a static environment is presented. Consider path planning as an optimization problem with constraints. The constraints are the path can not pass by the obstacles. The optimization target is the path is shortest. The obstacles in the robot’s environment are described as polygons and the vertexes ...

The problem of development of the SVM classifier based on the modified particle swarm optimization has been considered. This algorithm carries out the simultaneous search of the kernel function type, values of the kernel function parameters and value of the regularization parameter for the SVM classifier. Such SVM classifier provides the high quality of data classification. The idea of particle...

Recently, Particle Swarm Optimization (PSO) algorithm has exhibited good performance across a wide range of application problems. A quick review of the literature reveals that research for solving the Quadratic Assignment Problem (QAP) using PSO approach has not much been investigated. In this paper, we design a hybrid meta-heuristic fuzzy scheme, called as variable neighborhood fuzzy particle ...

Particle swarm optimization (PSO) has shown to be a robust and efficient optimization algorithm therefore PSO has received increased attention in many research fields. This paper demonstrates the feasibility of applying the Dynamic Inertia Weight Particle Swarm Optimization to solve a Non-Polynomial (NP) Complete puzzle. This paper presents a new approach to solve the Nonograms Puzzle using Dyn...

Error Correcting Output Codes reveal an efficient strategy in dealing with multi-class classification problems. According to this technique, a multi-class problem is decomposed into several binary ones. On these created sub-problems we apply binary classifiers and then, by combining the acquired solutions, we are able to solve the initial multiclass problem. In this paper we consider the optimi...