Elsevier

Information Sciences

Volume 94, Issues 1–4, October 1996, Pages 141-150
Information Sciences

Intelligent system
Static task allocation using (μ, λ) evolutionary strategies

https://doi.org/10.1016/0020-0255(96)00012-6Get rights and content

Abstract

Allocating tasks optimally in distributed systems is a NP-hard problem which has led researchers to adopt heuristic techniques. In the past, evolutionary strategies have been shown to be capable of efficiently determining good allocations. All of this previous work has used the (μ + λ) version of the evolutionary strategy. In this paper, we show that the (μ, λ) version of evolutionary strategy can find even better task allocations.

References (5)

There are more references available in the full text version of this article.

Cited by (3)

  • An analysis of the migration rates for biogeography-based optimization

    2014, Information Sciences
    Citation Excerpt :

    Evolutionary Algorithms have several advantages such as robustness, reliability, global search capability and the fact that there is little or no prior knowledge required. [30]. Many of them, such as Evolutionary Strategies (ES) [14,16,17], Genetic Algorithms (GA) [7,18,19,32,41], Differential Evolution (DE) [29,34,35,42,55], have been successfully implemented in practical problems. The main ideas of most EAs are inspired from nature.

  • Using GIS to develop an efficient spatio-temporal task allocation algorithm to human groups in an entirely dynamic environment case study: Earthquake rescue teams

    2009, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
  • Classification approach based on evolutionary neural networks

    2005, Ruan Jian Xue Bao/Journal of Software
View full text