The topic of this paper is the use of advanced algorithms in order to solve the problem of optimal use of available space. There are a lot of algorithms that try to solve this problem but most of them are not taking into consideration the available space into the concave elements. In this paper we describe how to use this space in order to find the optimal solution. Most of the algorithms that solve this problem use genetic algorithms as a base for the optimization. Some of them also use heuristics in order to implement expert knowledge. Our approach is based on an algorithm that groups the elements utilizing the available space from concave elements and then continues with the optimization phase. The optimization phase is implemented as a genetic algorithm that uses specific problem heuristics.
space utilization, transportation optimization, combinatorial optimization, packaging problem, cargo loading optimization, genetic algorithms, heuristics
© Association for Information and Communication Technologies www.ict-act.org Developed by tdelev