Ant Algorithms Optimization

Authors

  • S. D. Shtovba
  • O. M. Rudyi

Keywords:

optimization, ant algorithms, distributive systems, effectively

Abstract

The article is devoted to describing the theoretical basis of ant algorithms - a new perspective approach to optimization, that is investigated intensively abroad, but it is not known in Ukraine. The application of ant algorithms provides the reliable solutions of optimization problem with significant less time then classic methods as it is shown by the example of traveling salesman problem. Especially effective ant algorithms are for distributive systems parameters of which are dynamically changed in time

Downloads

Abstract views: 373

Published

2010-11-12

How to Cite

[1]
S. D. Shtovba and O. M. Rudyi, “Ant Algorithms Optimization”, Вісник ВПІ, no. 4, pp. 62–69, Nov. 2010.

Issue

No 4 (2004)

Section

Information technologies and computer sciences

Metrics

Downloads

Download data is not yet available.

License

Authors who publish with this journal agree to the following terms:

  • Authors retain copyright and grant the journal right of first publication.
  • Authors are able to enter into separate, additional contractual arrangements for the non-exclusive distribution of the journal's published version of the work (e.g., post it to an institutional repository or publish it in a book), with an acknowledgment of its initial publication in this journal.
  • Authors are permitted and encouraged to post their work online (e.g., in institutional repositories or on their website) prior to and during the submission process, as it can lead to productive exchanges, as well as earlier and greater citation of published work (See The Effect of Open Access).

Most read articles by the same author(s)

<< < 1 2 3 > >>