alexa Abstract | Scheduling Functions for Position Updating in Population Based Optimization Algorithms
ISSN: 2090-4908

International Journal of Swarm Intelligence and Evolutionary Computation
Open Access

OMICS International organises 3000+ Global Conferenceseries Events every year across USA, Europe & Asia with support from 1000 more scientific Societies and Publishes 700+ Open Access Journals which contains over 50000 eminent personalities, reputed scientists as editorial board members.

Open Access Journals gaining more Readers and Citations

700 Journals and 15,000,000 Readers Each Journal is getting 25,000+ Readers

This Readership is 10 times more when compared to other Subscription Journals (Source: Google Analytics)

Research Article Open Access

Abstract

In many population-based optimization algorithms (Evolutionary Algorithms, Particle Swarm Optimization, etc.), each iteration of the algorithm involves a procedure-specific set of operations for each population member, followed by a resulting update of the position of that member within the problem search space. However, for algorithms in which these operations involve only a single population member and not the population as a whole, there is no inherent need to update every member at every iteration. In this paper, we propose a generalization of this updating procedure wherein a “scheduling” function is defined to dictate the ordering of updates through the application of algorithm, thus considering the typical procedure of updating every population member at every iteration as a particular “round-robin" schedule. Using the standard Particle Swarm Optimization algorithm (SPSO-2011) as a basis for demonstrating the concept, we compare a number of different scheduling functions and show that several of these functions outperform the typical round-robin schedule for a set of benchmark optimization problems.

To read the full article Peer-reviewed Article PDF image | Peer-reviewed Full Article image

Author(s): Jeremy Mange* and Sara Pace

Keywords

Optimization, Particle swarm optimization, Scheduling functions, Population-based methods, Multi armed bandit algorithms, Optimization, Particle swarm optimization, Scheduling functions, Population-based methods, Multi armed bandit algorithms

Share This Page

Additional Info

Loading
Loading Please wait..
 
 
 
 
Peer Reviewed Journals
 
Make the best use of Scientific Research and information from our 700 + peer reviewed, Open Access Journals
International Conferences 2017-18
 
Meet Inspiring Speakers and Experts at our 3000+ Global Annual Meetings

Contact Us

 
© 2008-2017 OMICS International - Open Access Publisher. Best viewed in Mozilla Firefox | Google Chrome | Above IE 7.0 version
adwords