The algorithm on base of Nelder–Mead modified method and genetic algorithm for strip packing problem

Abstract

In this paper NP complete strip packing problem is analyzed. New heuristic algorithm on the base of modified Nelder–Mead method, genetic and linear programming algorithms for strip packing problem was proposed. Experiments on the well known tests show that this algorithm has certain advantages. Prospects for convex polygons packing were proposed. Possibility for parallel performance of the algorithm is shown.

Keywords

• <i>упаковка прямоугольников в полубесконечную полосу</i>
• <i>метод нелдера-мида</i>
• <i>генетические алгоритмы</i>
• <i>линейное программирование</i>
• <i>распараллеливание</i>