Proposition of Hybrid Algorithm for Solving Two Dimensional Strip Packing Problem

Abstract

Proposed article deals with proposition of hybrid algorithm designed to solve strip packing problem in two dimensional space. After mentioning the common algorithms, that are used to solve strip packing problem, we propose parallel hybrid algorithm, that reduces time to solve selected problems.Currently there are several existing heuristic algorithms, namely genetic algorithms, that are achieving very good results, however based on previous analysis, their weak point is usually in generating initial solutions, or any operation like mutation or crossover that works with deterministic algorithms. This problem together with genetic algorithm that we are currently working on was the main factor of creating this article. Although deterministic algorithms like those mentioned in this paper seem to be throughoutly mapped, in our opinion there is still place for additional research. Proposed algorithm is not perfect, it has it’s flaws, however for purpose of our future genetic algorithm, it is suitable and useful.