Heuristics for the strip packing problem with unloading constraints

This article addresses the Strip Packing Problem with Unloading Constraints (SPU). In this problem, we are given a strip of fixed width and unbounded height, and n items of C different classes. As in the well-known two-dimensional Strip Packing problem, we have to pack all items minimizing the used...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Computers & operations research 2013-04, Vol.40 (4), p.991-1003
Hauptverfasser:	da Silveira, Jefferson L.M., Miyazawa, Flávio K., Xavier, Eduardo C.
Format:	Artikel
Sprache:	eng
Schlagworte:	Algorithms Applied sciences Approximation Approximation algorithms Blocking Exact sciences and technology Flows in networks. Combinatorial problems GRASP Heuristic Logistics Mathematical analysis Operational research and scientific management Operational research. Management science Optimization algorithms Packing problem Route optimization Route selection Strip Strip Packing Studies Two dimensional Vehicles
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!