| Article ID: | iaor2017913 |
| Volume: | 26 |
| Issue: | 4 |
| Start Page Number: | 453 |
| End Page Number: | 474 |
| Publication Date: | Mar 2017 |
| Journal: | International Journal of Logistics Systems and Management |
| Authors: | Rosa Rodrigo De Alvarenga, Silva Dahlen Siqueira, Guenzani Andrea, Gerzelj Eliane, Fraga Karina Pedrini, Arpini Bianca Passos |
| Keywords: | supply & supply chains, inventory: storage, combinatorial optimization, simulation, programming: mathematical, statistics: empirical |
The break‐bulk trade has a significant role in international maritime trade. Brazil exports several break‐bulk cargoes, especially granite blocks. The port administration should plan the yard operations, putting more granite blocks in the same area and also reducing the distance travelled by the trucks from the storage yard to the seaside. This paper proposes a mathematical model to plan the layout of the storage yard, named 3D‐yard allocation problem (3D‐YAP) that considers that a small block goes on top of a big block, only blocks from the same vessel can be stacked in one stack and blocks can be rotated on the X‐Y plane. The model was tested on instances based on real data from Praia mole terminal (PMT), Brazil, that were solved by CPLEX 12.6. It is also important to say that the model can be applied to any kind of break‐bulk cargo in any port yard or terminal.