Opis

• Tytuł:
  Ant Algorithm for AP-N Aimed at Optimization of Complex Systems
• Twórca:
  Mikulik, Jerzy;
  Zajdel, Mirosław
• Opis:
  Assignment Problem (AP), which is well known combinatorial problem, has been studied extensively in the course of many operational and technical researches. It has been shown to be NP-hard for three or more dimensions and a few non-deterministic methods have been proposed to solve it. This paper pays attention on new heuristic search method for the n-dimensional assignment problem, based on swarm intelligence and comparing results with those obtained by other scientists. It indicates possible direction of solutions of problems and presents a way of behaviour using ant algorithm for multidimensional optimization complex systems. Results of researches in the form of computational simulations outcomes are presented.
• Dostępność obiektu:
  Dostęp otwarty
• Data:
  2010.12.19
• Typ:
  info:eu-repo/semantics/article;
  info:eu-repo/semantics/publishedVersion
• Język:
  angielski
• Źródło:
  2300-7087;
  1896-8325
• Format:
  application/pdf
• Wydawca:
  AGH University of Krakow Press
• Relacja: https://journals.agh.edu.pl/dmms/article/view/540/395
• Temat i słowa kluczowe:
  assignment problem;
  ant algorithm;
  optimization;
  MSC 90C27;
  MSC 90C59
• Identyfikator: https://journals.agh.edu.pl/dmms/article/view/540 ;
  10.7494/dmms.2010.4.2.29
• Dostawca danych:
  AGH University of Science and Technology Journals
• Czy mogę z tego obiektu skorzystać?:
  poproś o pozwolenie
• Rodzaj zawartości:
  teksty