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....

Full description

Saved in:

Bibliographic Details
Published in:	International journal of production research Vol. 50; no. 15; pp. 4316 - 4325
Main Authors:	Liu, Ya, Chu, Chengbin, Yu, Yugang
Format:	Journal Article
Language:	English
Published:	Abingdon Taylor & Francis Group 01.08.2012 Taylor & Francis Taylor & Francis LLC
Subjects:	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 Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!