Effects of Memory and Genetic Operators on Artificial Bee Colony Algorithm for Three-Dimensional Bin Packing Problem

EasyChair Preprint 5754

Abstract

The Artificial Bee Colony (ABC) algorithm is widely used to achieve optimum solution in a short time in integer-based optimization problems. However, the complexity of integer-based problems such as Knapsack Problems (KP) requires robust algorithms to avoid excessive solution search time. ABC algorithm that provides both the exploitation and the exploration approach is used as an alternative approach for various KP problems in the literature. However, it is rarely used for the Three-Dimensional Bin Packing Problem (3DBPP) which is an important part of the transportation systems. In this study, the exploitation and exploration aspects of the ABC algorithm are improved by using memory mechanisms and genetic operators to develop two different hybrid ABC algorithms. The developed algorithms and the basic ABC algorithm are applied to a generated 3DBPP dataset to observe the effects of the memory mechanism and the genetic operators separately. The results show that the genetic operators are more effective than the memory mechanism to develop a hybrid ABC algorithm, for solving heterogeneous 3DBPPs.

Keyphrases: Artificial Bee Colony Algorithm, Genetic Algorithm, Tabu Search, Three-Dimensional Bin Packing Problem, knapsack problem

@booklet{EasyChair:5754,
  author    = {Tuğrul Bayraktar and Filiz Ersöz and Cemalettin Kubat},
  title     = {Effects of Memory and Genetic Operators on Artificial Bee Colony Algorithm for Three-Dimensional Bin Packing Problem},
  howpublished = {EasyChair Preprint 5754},
  year      = {EasyChair, 2021}}