Packing and Shipping Cardboard Tubes

Conference paper
Part of the Mathematics in Industry book series (MATHINDUSTRY, volume 26)

Abstract

Spiralpack - Manipulados de Papel, S.A. is one of the main Iberian peninsula players in the production of standard and high performance cardboard tubes. This company attended at 101st European Study Groups with Industry (ESGI) to address the following questions concerning their packing and shipping processes: Given an order for a certain tube specification, possibly with a grouping request, what is the maximum number of tubes that can be packed inside a given container (usually the truck space) and how should they be positioned? Given several pallets of tubes, what is the most efficient way to arrange them in a container? In this work we show an industrial mathematics approach to these challenges, as well as some insight on the software developed to help Spiralpack addressing those questions.

Notes

Acknowledgements

The authors would like to thank Engineering Mathematical Laboratory (LEMA) and Spiralpack for supporting this work. The authors would like to thank all the participants of the 101st European Study Group for contributions on this subject, namely, Adérito Araújo, Ana Ribeiro, Fábio Chalub, Fernando Pestana da Costa, Luís Trabucho and Michael Grinfeld.

References

  1. 1.
    Bischoff, E., Ratcliff, M.: Issues in the development of approaches to container loading. OMEGA Int. J. Manag. Sci. 23(4), 377–390 (1995)CrossRefGoogle Scholar
  2. 2.
    Bortfeldt, D., Wäscher, G.: Constrains in container loading problem—a state-of-the-art review. Eur. J. Oper. Res. 229(1), 1–20 (2013)CrossRefMATHGoogle Scholar
  3. 3.
    Junqueira, L., Morabito, R., Yamashita, D.: Three-dimensional container loading models with cargo stability and load bearing constraints. Comput. Oper. Res. 39, 74–85 (2012)MathSciNetCrossRefMATHGoogle Scholar
  4. 4.
    Kellerer, H., Pferschy, U., Pisinger, D.: Knapsack Problems. Springer, Berlin (2004)CrossRefMATHGoogle Scholar
  5. 5.
    López, C., Beasley, J.E.: A heuristic for the circle packing problem with a variety of containers. Eur. J. Oper. Res. 214(3), 512–525 (2011)MathSciNetCrossRefMATHGoogle Scholar
  6. 6.
    Maranas, C., Floudas, C., Pardalos, P.: New results in the packing of equal circles in a square. Discret. Math. 142(1), 287–293 (1995)MathSciNetCrossRefMATHGoogle Scholar
  7. 7.
    Pisinger, D.: Heuristics for the container loading problem. Eur. J. Oper. Res. 141(2), 382–392 (2002)MathSciNetCrossRefMATHGoogle Scholar
  8. 8.
    Wäscher, G., Haubner, H., Schumann, H.: An improved typology of cutting and packing problems. Eur. J. Oper. Res. 183(3), 1109–1130 (2007)CrossRefMATHGoogle Scholar

Copyright information

© Springer International Publishing AG, part of Springer Nature 2017

Authors and Affiliations

  1. 1.LEMA/ISCAP/IPPS.Mamede InfestaPortugal
  2. 2.LEMA/ISEP/IPPPortoPortugal

Personalised recommendations