Result Details

Self-Organizing Migrating Algorithm for Dynamic Problems: An Experimental study

KOBLIHA, M.; SCHWARZ, J. Self-Organizing Migrating Algorithm for Dynamic Problems: An Experimental study. 13th International Conference on Soft Computing. Brno: Faculty of Mechanical Engineering BUT, 2007. p. 24-29. ISBN: 978-80-214-3473-8.
Type
conference paper
Language
English
Authors
Kobliha Miloš, Ing., DCSY (FIT)
Schwarz Josef, doc. Ing., CSc., DCSY (FIT)
Abstract

This paper is an experimental study investigating the capability of well known Self-Organizing Migrating Algorithm (SOMA) to solve dynamic problems. We have proposed a new extension of SOMA algorithm with two new approaches based on multi-population and elite concept. We tested the performance of the algorithm on the artificial benchmark with moving peaks. The experimental results confirmed the capability of the proposed dynamic xSODOMA algorithm to effectively adapt the search process towards the nonstationary global optimum.

Keywords

SOMA algorithm, dynamic environment, limited lifetime, multi-population, AllToElite strategy.

Published
2007
Pages
24–29
Proceedings
13th International Conference on Soft Computing
Conference
MENDEL 2007 - 13th International Conference on Soft Computing
ISBN
978-80-214-3473-8
Publisher
Faculty of Mechanical Engineering BUT
Place
Brno
BibTeX
@inproceedings{BUT28815,
  author="Miloš {Kobliha} and Josef {Schwarz}",
  title="Self-Organizing Migrating Algorithm for Dynamic Problems: An Experimental study",
  booktitle="13th International Conference on Soft Computing",
  year="2007",
  pages="24--29",
  publisher="Faculty of Mechanical Engineering BUT",
  address="Brno",
  isbn="978-80-214-3473-8"
}
Projects
Design and hardware implementation of a patent-invention machine, GACR, Standardní projekty, GA102/07/0850, start: 2007-01-01, end: 2009-12-31, completed
Security-Oriented Research in Information Technology, MŠMT, Institucionální prostředky SR ČR (např. VZ, VC), MSM0021630528, start: 2007-01-01, end: 2013-12-31, running
Departments
Back to top