Introduction to Cutting and Packing Optimization by Guntram Scheithauer

Author:Guntram Scheithauer
Language: eng
Format: epub
Publisher: Springer International Publishing, Cham

7.3.1 Heuristics for the Offline Strip Packing Problem

An optimization problem is of type offline if all input data of the problem are known when the optimization process has to start. Otherwise, if not all input data are known, we say the problem is of type online. Respectively, an algorithm for solving offline-type problems is named offline algorithm, otherwise online algorithm.

BL heuristic (Bottom-up Left-justified)

All pieces are packed according to the sequence defined by L at the lowest possible position (minimal y-coordinate) and, if not uniquely determined, at the left-most feasible place (minimal x-position).

Download

Copyright Disclaimer:
This site does not store any files on its server. We only index and link to content provided by other sites. Please contact the content providers to delete copyright contents if any and email us, we'll remove relevant links or contents immediately.