The genetic algorithm (GA) is an evolutionary optimization algorithm operating based upon reproduction, crossover and mutation. On the other hand, particle swarm optimization (PSO) is a swarm intelligence algorithm functioning by means of inertia weight, learning factors and the mutation probability based upon fuzzy rules. In this paper, particle swarm optimization in association with genetic a...

Localization is a key technology in wireless sensor networks. Faced with the challenges of the sensors' memory, computational constraints, and limited energy, particle swarm optimization has been widely applied in the localization of wireless sensor networks, demonstrating better performance than other optimization methods. In particle swarm optimization-based localization algorithms, the varia...

The genetic algorithm (GA) is an evolutionary optimization algorithm operating based upon reproduction, crossover and mutation. On the other hand, particle swarm optimization (PSO) is a swarm intelligence algorithm functioning by means of inertia weight, learning factors and the mutation probability based upon fuzzy rules. In this paper, particle swarm optimization in association with genetic a...

Reconfigurable Manufacturing System (RMS) justifies the need of hour by combining the high throughput of dedicated manufacturing system with the flexibility of flexible manufacturing systems. At the heart of RMS lies the Reconfigurable Machine Tools which are capable of performing multiple operations in its existing configurations and can further be reconfigured into more configurations which m...

Dimensionality reduction is a major task in remote sensing images. Feature selection is applied for performing dimensionality reduction. It selects the spectral features(i.e. Bands) and find a feature subset that preserves the semantics of the hyperspectral image. Based on particle swarm optimization (PSO), this paper proposes multi-objective functions for selecting the spectral feature subsets...

In recent years, particle swarm optimization (PSO) proposed by Kennedy et al. has been widely used as a general approximate solution method for optimization problems. The authors proposed a revised PSO (rPSO) method incorporating the homomorphous mapping and the multiple stretching technique in order to cope with shortcomings of PSO and showed its efficiency for nonlinear programming problems. ...

This paper introduces a modified PSO, Non-dominated Sorting Particle Swarm Optimizer (NSPSO), for better multiobjective optimization. NSPSO extends the basic form of PSO by making a better use of particles’ personal bests and offspring for more effective nondomination comparisons. Instead of a single comparison between a particle’s personal best and its offspring, NSPSO compares all particles’ ...

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

Agent Swarm Optimization (ASO) is a generalization of Particle Swarm Optimization (PSO) orientated towards distributed artificial intelligence, taking as a base the concept of multi-agent systems. It is aimed at supporting decision-making processes by solving either single or multi-objective optimization problems. ASO offers a common framework for the plurality of co-existent population-based a...

1. Abstract Swarm algorithms such as Particle Swarm Optimization (PSO) are non-gradient probabilistic optimization algorithms that have been successfully applied to obtain global optimal solutions for complex problems such as multi-peak problems. However these algorithms have not been applied to complicated structural and mechanical optimization problems since local optimization capability is s...