We treat a practical application of packing problem in supply chain management. This study was motivated by a real situation encountered in the storage problem of a foam industry in Tunisia. The storage problem consists in allocating, without overlapping, a given set of rectangular items (mattresses) to the minimum number of three dimensional bins with the different bins (rack) dimensions as input variables. Storage problem is a variable - sized bin packing problem that consists in finding an arrangement of set of items that cannot be rotated into the minimum number of variables bins. We develop a new heuristic method and we propose an integer programming model for the storage problem. The algorithm was applied in the case of unlimited number of bins. Numerical results on real-life test instances are reported.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Three-dimensional bin packing problem with variable bin length Application in industrial storage problem


    Contributors:
    Salma, M. (author) / Ahmed, F. (author)


    Publication date :

    2011-05-01


    Size :

    744611 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Three-dimensional Packing Problem Solving Method Based on Space Optimization

    Gao, Wei / Yang, Dingqiang | British Library Online Contents | 2014


    A Heuristic algorithm for Three Dimensional Container Packing Problem of Fixed-size Cargos

    Sui, S.-l. / Shao, W. / Gao, Z.-y. | British Library Online Contents | 2005


    The generalized bin packing problem

    Baldi, Mauro Maria | Online Contents | 2012


    Improved Packing Representation Model for the Orthogonal Packing Problem

    Chekanin, A.V. / Chekanin, V.A. | British Library Conference Proceedings | 2013


    The Pallet-Packing Vehicle Routing Problem

    Zachariadis, Emmanouil E. | Online Contents | 2012