Dobór parametrów w równoległych algorytmach genetycznych dla problemu plecakowego
Selection of various parameters of parallel evolutionary algorithm for knapsack problems

Summary/Abstract: The aim of the paper is the presentation of the methodology for selection of various parameters of parallel evolutionary algorithm. The selection process will be presented on the example of knapsack problem, which can be used for example for the problem of selection of investment shares to the cart. Discreet knapsack problem is one of the optimization tasks of NP-hard with computational complexity known as O (n2). The methods which are recommended for solving discrete knapsack problem are: greedy algorithms, dynamic programming, and mentioned above evolutionary algorithms in the parallel version.

• Details
• Contents