Detail publikace

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

Originální název

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

Anglický název

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

Jazyk

en

Originální abstrakt

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.

Anglický abstrakt

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.

BibTex


@inproceedings{BUT28815,
  author="Miloš {Kobliha} and Josef {Schwarz}",
  title="Self-Organizing Migrating Algorithm for Dynamic Problems: An Experimental study",
  annote="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.",
  address="Faculty of Mechanical Engineering BUT",
  booktitle="13th International Conference on Soft Computing",
  chapter="28815",
  howpublished="print",
  institution="Faculty of Mechanical Engineering BUT",
  year="2007",
  month="september",
  pages="24--29",
  publisher="Faculty of Mechanical Engineering BUT",
  type="conference paper"
}