Aggregated state dynamic programming for a multiobjective two-dimensional bin packing problem

This paper studies a real-life multi-objective two-dimensional single-bin-size bin-packing problem arising in industry. A packing pattern is defined by one bin, a set of items packed into the bin and the packing positions of these items. A number of bins can be placed with the same packing pattern....

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	International journal of production research Jg. 50; H. 15; S. 4316 - 4325
Hauptverfasser:	Liu, Ya, Chu, Chengbin, Yu, Yugang
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Abingdon Taylor & Francis Group 01.08.2012 Taylor & Francis Taylor & Francis LLC
Schlagworte:	Applied sciences Bins Computation cutting stock problems Decision theory. Utility theory Decomposition Dynamic programming Exact sciences and technology Flows in networks. Combinatorial problems Heuristic Mathematical programming Operational research and scientific management Operational research. Management science Optimization Optimization techniques Packing problem Stemming Studies Two dimensional Hypergraph OR cutting stock problems Cutting stock problem Heuristic method Multiobjective programming Bin packing problem Dynamic programming Combinatorial optimization
ISSN:	0020-7543, 1366-588X
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!