Using a Heuristic Approach for Three Dimensional Multiple Bin-Size Bin Packing Problem for Choosing Best Fleet Composition in a Spare Parts Company in Iran

The three-dimensional multiple bin-size bin packing problem (MBSBPP) has many applications in logistic problems. Efficiently modeling and solving this problem can reduce time and transportation costs. In this paper we considered a spare parts company in Iran. We constructed a mathematical model of the problem. The Algorithm is then tested on some instances using GAMS software. Also a heuristic algorithm is developed. The results show that this heuristic is effective in both measures, cost and problem run-time. For obtaining best fleet composition, a simulation is performed. Cost of each scenario is calculated and finally best scenario is suggested for implementation.