This work concerns new borders, heuristics, algoritms and mathematic models of pallet loading problem (PLP). We try to describe these computational methods and find out if we can use them in real. We maximalize number of boxes placed on rectangular pallets in a particular warehouse by using chosen heuristics. Every box has a rectangular form with the same lenght and width and is fully placed on the pallet. We can rotate with the box by 90% degree until it is fixed as we want and its side lies parallelly with side of the pallet. All instances are setted in model (X, Y, a, b), where X is lenght, Y width of the pallet, a lenght and b width of the box.
| Identifer | oai:union.ndltd.org:nusl.cz/oai:invenio.nusl.cz:76813 |
| Date | January 2009 |
| Creators | Rybka, Ondřej |
| Contributors | Pelikán, Jan, Rada, Miroslav |
| Publisher | Vysoká škola ekonomická v Praze |
| Source Sets | Czech ETDs |
| Language | Czech |
| Detected Language | English |
| Type | info:eu-repo/semantics/masterThesis |
| Rights | info:eu-repo/semantics/restrictedAccess |
Page generated in 0.0024 seconds