Scholars Central

Research articlePublished 2016

Scheduling Functions for Position Updating in Population Based Optimization Algorithms

Authors: Jeremy Mange, Sara Pace

Ask about this article

Abstract

Select any words in the title or abstract, or press this and choose a sentence.

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

Ask about this article

Answers come only from this article's title, abstract and keywords, each sentence pointing to where it comes from. Your question is sent to OpenAI to write the answer. Scholars Central does not store it.

Try:

Similar by topic

More from this journal

The newest in International Journal of Swarm Intelligence and Evolutionary Computation.

All its articles

Conferences in this field

Upcoming conferences in this field.

Follow

New articles from what you follow go into your email digest, once you agree to alert emails.

  • JournalInternational Journal of Swarm Intelligence and Evolutionary Computation
  • SubjectComputer Science & IT
  • BylineArticles whose byline prints “Jeremy Mange”
  • BylineArticles whose byline prints “Sara Pace”

For authors and organisers

Publish, present and keep up with your field

Find the right journal for your paper and submit your manuscript.

Photo: Pexels