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

Authors

1 industrial engineering - Technology development Institute (acecr), sharif branch, tehran, iran

2 industrial engineering department, Faculty of Technical and Engineering, university of science & culture, Tehran,Iran

Abstract

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.

Keywords

Main Subjects

References

صباغ، م. س.، علینقیان، م. زمانلو، ک. 2015. مسأله مسیریابی وسیله نقلیه وابسته به زمان با محدودیت‌های بارگیری دوبعدی: مدل‌سازی و حل. نشریه پژوهش‌های مهندسی صنایع در سیستم‌های تولید، 3، 43-59.
 
ALVAREZ-VALDES, R., PARREÑO, F. & TAMARIT, J. 2012. A GRASP/Path Relinking algorithm for two-and three-dimensional multiple bin-size bin packing problems. Computers & Operations Research.
ALVAREZ-VALDES, R., PARREÑO, F. & TAMARIT, J. 2015. Lower bounds for three-dimensional multiple-bin-size bin packing problems. OR Spectrum, 37, 49-74.
BAAZAOUI, M., HANAFI, S. & KAMOUN, H. 2017. Three-Dimensional Multiple-Bin-Size Bin Packing: A Case Study with a New MILP-Based Upper Bound. Operational Research in Business and Economics. Springer.
BISCHOFF, E. & WÄSCHER, G. 1995. Cutting and packing. European Journal of Operational Research, 84, 503-505.
BODIN, L., MINGOZZI, A., BALDACCI, R. & BALL, M. 2000. The rollon–rolloff vehicle routing problem. Transportation Science, 34, 271-288.
BORTFELDT, A. & WÄSCHER, G. 2012. Constraints in container loading–A state-of-the-art review. European Journal of Operational Research.
CHE, C. H., HUANG, W., LIM, A. & ZHU, W. 2011. The multiple container loading cost minimization problem. European Journal of Operational Research, 214, 501-511.
CRAINIC, T. G., PERBOLI, G. & TADEI, R. 2009. TS2PACK: A two-level tabu search for the three-dimensional bin packing problem. European Journal of Operational Research, 195, 744-760.
DYCKHOFF, H. 1990. A typology of cutting and packing problems. European Journal of Operational Research, 44, 145-159.
ERTEK, G. & KILIC, K. 2006. Decision support for packing in warehouses. Computer and Information Sciences–ISCIS 2006. Springer.
FAGERHOLT, K. 1999. Optimal fleet design in a ship routing problem. International Transactions in Operational Research, 6, 453-464.
HOFF, A., ANDERSSON, H., CHRISTIANSEN, M., HASLE, G. & LØKKETANGEN, A. 2010. Industrial aspects and literature survey: Fleet composition and routing. Computers & Operations Research, 37, 2041-2061.
IORI, M. 2016. An annotated bibliography of combined routing and loading problems. Yugoslav Journal of Operations Research, 23.
JABALI, O., GENDREAU, M. & LAPORTE, G. 2012. A continuous approximation model for the fleet composition problem. Transportation Research Part B: Methodological, 46, 1591-1606.
KOÇ, Ç., BEKTAŞ, T., JABALI, O. & LAPORTE, G. 2016. The impact of depot location, fleet composition and routing on emissions in city logistics. Transportation Research Part B: Methodological, 84, 81-102.
LI, T.-H. S., LIU, C.-Y., KUO, P.-H., FANG, N.-C., LI, C.-H., CHENG, C.-W., HSIEH, C.-Y., WU, L.-F., LIANG, J.-J. & CHEN, C.-Y. 2017. A three-dimensional adaptive PSO-based packing algorithm for an IoT-based automated e-fulfillment packaging system. IEEE Access.
LI, X. & ZHANG, K. 2015. A hybrid differential evolution algorithm for multiple container loading problem with heterogeneous containers. Computers & Industrial Engineering, 90, 305-313.
NOURINEJAD, M. & ROORDA, M. J. 2017. A continuous approximation model for the fleet composition problem on the rectangular grid. OR spectrum, 39, 373-401.
PAQUAY, C., LIMBOURG, S. & SCHYNS, M. 2017. A tailored two-phase constructive heuristic for the three-dimensional Multiple Bin Size Bin Packing Problem with transportation constraints. European Journal of Operational Research.
ROGGE, M., VAN DER HURK, E., LARSEN, A. & SAUER, D. U. 2018. Electric bus fleet size and mix problem with optimization of charging infrastructure. Applied Energy, 211, 282-295.
SOONPRACHA, K., MUNGWATTANA, A. & MANISRI, T. A re-constructed meta-heuristic algorithm for robust fleet size and mix vehicle routing problem with time windows under uncertain demands. Proceedings of the 18th Asia Pacific Symposium on Intelligent and Evolutionary Systems-Volume 2, 2015. Springer, 347-361.
WÄSCHER, G., HAUßNER, H. & SCHUMANN, H. 2007. An improved typology of cutting and packing problems. European Journal of Operational Research, 183, 1109-1130.
WU, H., LEUNG, S. C., SI, Y.-W., ZHANG, D. & LIN, A. 2017. Three-stage heuristic algorithm for three-dimensional irregular packing problem. Applied Mathematical Modelling, 41, 431-444.
YI, J. & BORTFELDT, A. 2018. The Capacitated Vehicle Routing Problem with Three-Dimensional Loading Constraints and Split Delivery—A Case Study. Operations Research Proceedings 2016. Springer.
ZHU, W., HUANG, W. & LIM, A. 2012. A prototype column generation strategy for the multiple container loading problem. European Journal of Operational Research, 223, 27-39.

Files

History

  • Receive Date: 08 June 2018
  • Revise Date: 02 September 2018
  • Accept Date: 04 September 2018

Share

How to cite

Statistics