Search academic texts

Information × Registration Number 2112U001374, Article popup.category Thesis Title popup.author popup.publication 01-01-2012 popup.source_user Сумський державний університет popup.source http://essuir.sumdu.edu.ua/handle/123456789/28540 popup.publisher Сумський державний університет Description The goal of the research is to identify opportunities for solving complex polyhedral optimization problems with the limited time. This features provide algorithms based on the reproduction of social behavior organized by biological groups. It is determined that a rational method of optimization in polynomial bounded time problem is an algorithm that reflects the behavior of a swarm of bees. The main feature of this algorithm is that it uses not one but a set of solutions, which is processed at each iteration, and the result of iterations is also set of solutions. Only general management options such as size of the colony and the maximum number of iterations are used in the algorithm. When you are citing the document, use the following link http://essuir.sumdu.edu.ua/handle/123456789/28540 popup.nrat_date 2025-05-12 Close