A dynamic programming-based heuristic for the variable sized two-dimensional bin packing problem

This paper addresses a variable sized two-dimensional bin packing problem. We propose two heuristics, H1 and H2, stemming from the dynamic programming idea by aggregating states to avoid the explosion in the number of states. These algorithms are elaborated for different purposes: H1 builds a genera...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	International journal of production research Ročník 49; číslo 13; s. 3815 - 3831
Hlavní autori:	Liu, Ya, Chu, Chengbin, Wang, Kanliang
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Abingdon Taylor & Francis Group 01.07.2011 Taylor & Francis Taylor & Francis LLC
Predmet:	Algorithms Applied sciences Bins Construction Dynamic programming Dynamische Optimierung Exact sciences and technology Flows in networks. Combinatorial problems Heuristic Heuristik Lower bounds Mathematical models Mathematical programming operational research Operational research and scientific management Operational research. Management science optimisation Optimization Optimization algorithms Packing problem Packproblem Studies Two dimensional Lower bound Multiple solution Variable geometry optimisation Supply demand balance Heuristic method operational research Bin packing problem Dynamic programming Rotation Bounded solution
ISSN:	0020-7543, 1366-588X
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!