Artificial Bee Colony Algorithm for Container Loading Problem
Tuğrul BAYRAKTAR Filiz ERSÖZ Cemalettin KUBAT
AbstractA container is the one of the main components of transportation systems. Allocating items into limited spaces, is a kind of combinatorial optimization problem and container loading problems is a branch of knapsack problems, in which a set of items are loaded into capacitated domains. Heuristic approaches are mostly applied to solve knapsack problems due to the problem complexity. Artificial Bee Colony Algorithm and Genetic Algorithm are successful for solving object placement issues. The first one can obtain sufficient results as well as the second one. In this study, the performance of Artificial Bee Colony Algorithm, which is applied on CLP rarely, is compared with Genetic Algorithm, which is applied on CLP widely, to see the capability of proposed ABC algorithm for further studies.