Skip to main content

Warehouse Optimization: Packing-algorithms for goods with complex geometries

  • Conference paper
Operations Research Proceedings 1995

Part of the book series: Operations Research Proceedings ((ORP,volume 1995))

  • 219 Accesses

Abstract

To optimize different work routines in a warehouse simultaneously, one has to tackle several problems from combinatorical optimization such as shortest-path-problems, three-dimensional packing problems and assignment/placement problems. Within the framework of the implementation of an integrated warehouse optimization system we started to deal with the packing problems and their integration into algorithms for vehicle routing problems. In this talk we present a practical packing problem arising from the packing of bath-tubs and other goods with complex geometry on pallets. We model this problem both as a packing problem and as a vehicle routing problem and discuss suitable algorithms and present some computational results.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 54.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 69.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bachern, A., Hochstättier, W. und Malich, M.: The Simulated Trading Heuristic for Solving Vehicle Routing Problems. to appear in: Discrete Applied Mathematics GO-Meeting.

    Google Scholar 

  2. Coffman Jr., E.G., Garey, M.R. and Johnson, D.S.: Approximation algorithms for bin-packingAn updated survey. In: G. Ausiello, N. Lucertini and P. Serafini (eds.): Algorithm design for computer systems design, Springer (1984) 49–106.

    Google Scholar 

  3. Fisher, M.L. and Jaikumar, R.: A generalized assignment heuristic for Vehicle Routing. Networks 11 (1981) 109–124.

    Article  Google Scholar 

  4. Golden, B.L. and Assad, A.A.: Vehicle Routing: Methods and Studies., North-Holland, Amsterdam (1988).

    Google Scholar 

  5. Laporte, G.: The Vehicle Routing Problem: An overview of exact and approximate algorithms. European Journal of Operational Research 59 (1992) 345–358.

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1996 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Schepers, J., Wottawa, M. (1996). Warehouse Optimization: Packing-algorithms for goods with complex geometries. In: Kleinschmidt, P., Bachem, A., Derigs, U., Fischer, D., Leopold-Wildburger, U., Möhring, R. (eds) Operations Research Proceedings 1995. Operations Research Proceedings, vol 1995. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-80117-4_22

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-80117-4_22

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60806-6

  • Online ISBN: 978-3-642-80117-4

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics