An algorithm of ants’ colony for the multi-dimensional knapsack problem.

• Datum: 2019
• Hauptverfasser: Yukhymenko, B. I., Tkalenko, O. Yu.
• Format: Artikel
• Sprache: Ukrainian
• Veröffentlicht: Інститут проблем реєстрації інформації НАН України 2019
• Schlagworte: optimization methods; approximate probabilistic methods; ant colony algorithms; multi-dimensional knapsack problem; computational complexity
• Online Zugang: http://drsp.ipri.kiev.ua/article/view/180014
• Назва журналу: Data Recording, Storage & Processing

A fairly new direction in the creation of methods and algorithms for solving optimization problems is described. The behavior of living beings in nature can be formalized using scientific ideas. Particular attention is attracted by the behavior of ants. Their colonies can be viewed as a multi-agent...