A heuristic and GRASP algorithm for three-dimensional multiple bin-size bin packing problem based on the needs of a spare-part company Online publication date: Wed, 20-Jan-2021
by Ali Shoja Sangchooli; Seyed Mehdi Sajadifar
International Journal of Services and Operations Management (IJSOM), Vol. 38, No. 1, 2021
Abstract: The three-dimensional multiple bin-size bin packing problem (3D-MBSBPP) has many practical applications in the logistic problems such as warehouse management, transportation planning and container loading. An efficient solution to the problem can have significant effects on reducing the transportation costs, improving the status and increasing the productivity and profitability of the companies. The mathematical models proposed for this problem are few in number and can, therefore, be expanded and improved much further. In this paper, based on the needs of a spare-part company in Iran, we developed a mathematical model for 3D-MBSBPP. This model takes into account the rotation of the boxes and the maximum weight constraint of the bins and then, we used a new heuristic and a GRASP algorithm for solving the model. The obtained answers in comparison with the exact method, confirm the speed and efficiency of the proposed algorithms, especially in solving the large-scale and real-sized problems.
Online publication date: Wed, 20-Jan-2021
If you are not a subscriber and you just want to read the full contents of this article, buy online access here.Complimentary Subscribers, Editors or Members of the Editorial Board of the International Journal of Services and Operations Management (IJSOM):
Login with your Inderscience username and password:
Want to subscribe?
A subscription gives you complete access to all articles in the current issue, as well as to all articles in the previous three years (where applicable). See our Orders page to subscribe.
If you still need assistance, please email email@example.com