Document Type

Article

Publication Date

2017

Publication Title

International Journal of Applied Engineering Research

Volume

12

Issue

7

First Page

1290

Last Page

1304

Keywords

knapsack, packing sequence, rotation, obstacles, simulated annealing

Abstract

High utilization of cargo volume is an essential factor in the success of modern enterprises in the market. Although mathematical models have been presented for container loading problems in the literature, there is still a lack of studies that consider practical constraints. In this paper, a Mixed Integer Linear Programming is developed for the problem of packing a subset of rectangular boxes inside a container such that the total value of the packed boxes is maximized while some realistic constraints, such as vertical stability, are considered. The packing is orthogonal, and the boxes can be freely rotated into any of the six orientations. Moreover, a sequence triple-based solution methodology is proposed, simulated annealing is used as modeling technique, and the situation where some boxes are preplaced in the container is investigated. These preplaced boxes represent potential obstacles. Numerical experiments are conducted for containers with and without obstacles. The results show that the simulated annealing approach is successful and can handle large number of packing instances.

Funding Reference Number

Natural Sciences and Engineering Research Council of Canada (NSERC), Engage Grants Program, Application ID: EGP 424284 – 11

Comments

Copyright Research India Publications. First published at https://www.ripublication.com/Volume/ijaerv12n7.htm

Creative Commons License

Creative Commons Attribution 3.0 License
This work is licensed under a Creative Commons Attribution 3.0 License.

Share

COinS