Skip to main content
SpringerLink
Log in

The Two-Dimensional Vector Packing Problem with Courier Cost Structure

  • Conference paper
Recent Trends in Applied Artificial Intelligence (IEA/AIE 2013)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7906))

  • 4060 Accesses

Abstract

The two-dimensional vector packing problem with courier cost structure is a practical problem faced by many manufacturers that ship products using courier service. The manufacturer must ship a number of items using standard-sized cartons, where the cost of a carton quoted by the courier is determined by a piecewise linear function of its weight. The cost function is not necessarily convex or concave. The objective is to pack all items into cartons such that the total delivery cost is minimized while observing both the weight limit and volume capacity constraints. In this study, we investigate solution methods to this problem.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Woeginger, G.J.: There is no asymptotic PTAS for two-dimensional vector packing. Information Processing Letters 64(6), 293–297 (1997)

    Article  MathSciNet  Google Scholar 

  2. Kellerer, H., Kotov, V.: An approximation algorithm with absolute worst-case performance ratio 2 for two-dimensional vector packing. Operations Research Letters 31(1), 35–41 (2003)

    Article  MathSciNet  MATH  Google Scholar 

  3. Spieksma, F.C.R.: A branch-and-bound algorithm for the two-dimensional vector packing problem. Computers & Operations Research 21(1), 19–25 (1994)

    Article  MATH  Google Scholar 

  4. Caprara, A., Toth, P.: Lower bounds and algorithms for the 2-dimensional vector packing problem. Discrete Applied Mathematics 111(3), 231–262 (2001)

    Article  MathSciNet  MATH  Google Scholar 

  5. Anily, S., Bramel, J., Simchi-Levi, D.: Worst-case analysis of heuristics for the bin packing problem with general cost structures. Operations Research 42(2), 287–298 (1994)

    Article  MATH  Google Scholar 

  6. Epstein, L., Levin, A.: Bin packing with general cost structures. Mathematical Programming 132(1-2), 355–391 (2012)

    Article  MathSciNet  MATH  Google Scholar 

  7. Leung, J.Y.T., Li, C.L.: An asymptotic approximation scheme for the concave cost bin packing problem. European Journal of Operational Research 191(2), 582–586 (2008)

    Article  MATH  Google Scholar 

  8. Haouari, M., Serairi, M.: Heuristics for the variable sized bin-packing problem. Computers & Operations Research 36(10), 2877–2884 (2009)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Management Sciences, City University of Hong Kong, Tat Chee Ave, Kowloon Tong, Hong Kong

    Qian Hu, Andrew Lim & Wenbin Zhu

Authors
  1. Qian Hu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Andrew Lim
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Wenbin Zhu
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science, Texas State University, 78666, San Marcos, TX, USA

    Moonis Ali

  2. Agent Systems Research Group, Department of Computer Science, Faculty of Sciences, VU University Amsterdam, De Boelelaan 1081, 1081, Amsterdam, HV, The Netherlands

    Tibor Bosse

  3. Interactive Intelligence Group, Department of Intelligent Systems, Faculty of Electrical Engineering, Mathematics and Computer Science, Delft University of Technology, Mekelweg 4, 2628 CD, Delft, The Netherlands

    Koen V. Hindriks  & Catholijn M. Jonker  & 

  4. Computational Intelligence Group, Department of Computer Science, Faculty of Sciences, VU University Amsterdam, De Boelelaan 1081, 1081 HV, Amsterdam, The Netherlands

    Mark Hoogendoorn

  5. Agent Systems Research Group, Department of Computer Science, Faculty of Sciences, VU University Amsterdam, De Boelelaan 1081, 1081 HV, Amsterdam, The Netherlands

    Jan Treur

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Hu, Q., Lim, A., Zhu, W. (2013). The Two-Dimensional Vector Packing Problem with Courier Cost Structure. In: Ali, M., Bosse, T., Hindriks, K.V., Hoogendoorn, M., Jonker, C.M., Treur, J. (eds) Recent Trends in Applied Artificial Intelligence. IEA/AIE 2013. Lecture Notes in Computer Science(), vol 7906. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-38577-3_22

Download citation

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

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-38576-6

  • Online ISBN: 978-3-642-38577-3

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation