Özet:

The effectiveness and efficiency of optimization algorithms depends on their ability to actively search/discover and move quickly in the solution space. The "search" and "use" capabilities in an algorithm are directly related to neighbouring operators used. In order to enhance these capabilities, more than one neighborhood operator can be included in the search process. This study suggested the use of an adaptive binary artificial bee colony, which contains three neighboring operators, to solve the multi-dimensional backpack problem. Multi-dimensional backpack problem is a NP-hard problem that has many areas of application. Especially large-scale problems are quite difficult to solve in reasonable times. For the purpose of determining the best parameters of the suggested algorithm, the first parameters adjustment experimental studies have been carried out. The success of the suggested algorithm and the four different methods in literature have been statistical comparisons on three different set of problems. It has been shown that the suggested algorithm produces more successful results than other methods in literature.

Anahtar Kelimeler: