Particle swarm optimization with composite particles in dynamic environments

This article is placed here with the permission of IEEE - Copyright @ 2010 IEEEIn recent years, there has been a growing interest in the study of particle swarm optimization (PSO) in dynamic environments. This paper presents a new PSO model, called PSO with composite particles (PSO-CP), to address dynamic optimization problems. PSO-CP partitions the swarm into a set of composite particles based on their similarity using a "worst first" principle. Inspired by the composite particle phenomenon in physics, the elementary members in each composite particle interact via a velocity-anisotropic reflection scheme to integrate valuable information for effectively and rapidly finding the promising optima in the search space. Each composite particle maintains the diversity by a scattering operator. In addition, an integral movement strategy is introduced to promote the swarm diversity. Experiments on a typical dynamic test benchmark problem provide a guideline for setting the involved parameters and show that PSO-CP is efficient in comparison with several state-of-the-art PSO algorithms for dynamic optimization problems.This work was supported in part by the Key Program of the National Natural Science Foundation (NNSF) of China under Grant 70931001 and 70771021, the Science Fund for Creative Research Group of the NNSF of China under Grant 60821063 and 70721001, the Ph.D. Programs Foundation of the Ministry of education of China under Grant 200801450008, and by the Engineering and Physical Sciences Research Council of U.K. under Grant EP/E060722/1

A clustering particle swarm optimizer for locating and tracking multiple optima in dynamic environments

This article is posted here with permission from the IEEE - Copyright @ 2010 IEEEIn the real world, many optimization problems are dynamic. This requires an optimization algorithm to not only find the global optimal solution under a specific environment but also to track the trajectory of the changing optima over dynamic environments. To address this requirement, this paper investigates a clustering particle swarm optimizer (PSO) for dynamic optimization problems. This algorithm employs a hierarchical clustering method to locate and track multiple peaks. A fast local search method is also introduced to search optimal solutions in a promising subregion found by the clustering method. Experimental study is conducted based on the moving peaks benchmark to test the performance of the clustering PSO in comparison with several state-of-the-art algorithms from the literature. The experimental results show the efficiency of the clustering PSO for locating and tracking multiple optima in dynamic environments in comparison with other particle swarm optimization models based on the multiswarm method.This work was supported by the Engineering and Physical Sciences Research Council of U.K., under Grant EP/E060722/1

Optimisation of Mobile Communication Networks - OMCO NET

The mini conference “Optimisation of Mobile Communication Networks” focuses on advanced methods for search and optimisation applied to wireless communication networks. It is sponsored by Research & Enterprise Fund Southampton Solent University. The conference strives to widen knowledge on advanced search methods capable of optimisation of wireless communications networks. The aim is to provide a forum for exchange of recent knowledge, new ideas and trends in this progressive and challenging area. The conference will popularise new successful approaches on resolving hard tasks such as minimisation of transmit power, cooperative and optimal routing

Active Contour-Based Visual Tracking by Integrating Colors, Shapes, and Motions Using Level Sets

Using a camera,the visual object tracking is one of the most important process in searching the spot of moving object over the time. In the case of the object moves fast relative to the frame rate,the visual object tracking is difficult task. The active contour evolution algorithm which is used for the tracking of object in a given frame of an image sequence. Active contour based visual object tracking using the level sets is proposed which does not consider the camera either stationary or moving. We present a framework for active contour-based visual object tracking using the level sets. The main components of our framework consist of the contour-based tracking initialization, colour-based contour evolution, the adaptive shape-based contour evolution for the non-periodic motions, the dynamic shape-based contour evolution for the periodic motions and handling of the abrupt motions. For the contour-based tracking initialization, we use an optical flow-based algorithm for the automatically initializing contours at the first frame. In the color-based contour evolution, we use Markov random field theory to measure correlations between values of the neighboring pixels for the posterior probability estimation.In the adaptive shape-based contour evolution, we combined the global shape information and the local color information to hierarchically develop gradually the contour, and a flexible shape updating model is made. In the dynamic shape based contour evolution, a shape mode transition matrix is gain to characterize the temporal correlations of the object shapes. In the handling of abrupt motions, particle swarm optimization (PSO) is used to capture the global motion which is applied to the contour in the current frame to produce an initial contour in the next frame. DOI: 10.17762/ijritcc2321-8169.15013