Comparative analysis of the efficiency of algorithms of the solution of the knapsack problem optimizing the quantity of applications for innovations

Abstract

Purpose: The article is devoted to the comparative analysis of algorithms of solution of the task of selecting applications for innovative projects with a limited budget. Discussion: This problem is formalized as a knapsack problem, for which discrete optimization methods and genetic algorithms are applied. A set of criteria for the efficiency of algorithms is proposed and an appropriate comparative analysis is carried out. Results: The authors have implemented discrete optimization and genetic algorithms to solve the knapsack problem with regard to the selection of applications for innovative projects, an analysis of their comparative effectiveness on a number of criteria. Some results are provided.