IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v300y2022i1p20-34.html

An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs

Author

Listed:
  • Wang, Ting
  • Hu, Qian
  • Lim, Andrew

Abstract

The volumetric weight of a package has become an essential factor in calculating the delivery cost of shipments in the international logistics market. In this work, we extend the two-dimensional vector packing problem by considering a more realistic cost structure, which is a general function of volumetric weight. The problem is to pack a set of different items into some identical bins without violating weight limits and volume capacities so that the total delivery cost is minimized. We develop an exact approach based on a branch-and-price algorithm and subset-row inequalities for the problem. To efficiently solve the pricing problem in column generation, a label-setting algorithm with an effective label dominance rule and a bounding procedure is presented. A stronger label dominance rule is derived for the case where the cost function is convex. The computational results show that the exact method is effective in solving the various test instances of the problem. If the volumetric weight is not considered, the exact method can be adapted to solve the two-dimensional vector packing problem with piecewise linear cost function and outperformed the existing exact algorithm by computing 27 optimal solutions for previously open instances.

Suggested Citation

  • Wang, Ting & Hu, Qian & Lim, Andrew, 2022. "An exact algorithm for two-dimensional vector packing problem with volumetric weight and general costs," European Journal of Operational Research, Elsevier, vol. 300(1), pages 20-34.
    • Handle: RePEc:eee:ejores:v:300:y:2022:i:1:p:20-34
    DOI: 10.1016/j.ejor.2021.10.011
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221721008572
    Download Restriction: Full text for ScienceDirect subscribers only
    File URL: https://libkey.io/10.1016/j.ejor.2021.10.011?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    References listed on IDEAS

    as
    1. Alves, Cláudio & de Carvalho, José Valério & Clautiaux, François & Rietz, Jürgen, 2014. "Multidimensional dual-feasible functions and fast lower bounds for the vector packing problem," European Journal of Operational Research, Elsevier, vol. 233(1), pages 43-63.
    2. Hu, Qian & Lim, Andrew & Zhu, Wenbin, 2015. "The two-dimensional vector packing problem with piecewise linear cost function," Omega, Elsevier, vol. 50(C), pages 43-53.
    3. Hu, Qian & Wei, Lijun & Lim, Andrew, 2018. "The two-dimensional vector packing problem with general costs," Omega, Elsevier, vol. 74(C), pages 59-69.
    4. Shoshana Anily & Julien Bramel & David Simchi-Levi, 1994. "Worst-Case Analysis of Heuristics for the Bin Packing Problem with General Cost Structures," Operations Research, INFORMS, vol. 42(2), pages 287-298, April.
    5. Leung, Joseph Y.-T. & Li, Chung-Lun, 2008. "An asymptotic approximation scheme for the concave cost bin packing problem," European Journal of Operational Research, Elsevier, vol. 191(2), pages 582-586, December.
    6. Heßler, Katrin & Gschwind, Timo & Irnich, Stefan, 2018. "Stabilized branch-and-price algorithms for vector packing problems," European Journal of Operational Research, Elsevier, vol. 271(2), pages 401-419.
    7. Mads Jepsen & Bjørn Petersen & Simon Spoorendonk & David Pisinger, 2008. "Subset-Row Inequalities Applied to the Vehicle-Routing Problem with Time Windows," Operations Research, INFORMS, vol. 56(2), pages 497-511, April.
    8. Chung‐Lun Li & Zhi‐Long Chen, 2006. "Bin‐packing problem with concave costs of bin utilization," Naval Research Logistics (NRL), John Wiley & Sons, vol. 53(4), pages 298-308, June.
    9. Wei, Lijun & Lai, Minghui & Lim, Andrew & Hu, Qian, 2020. "A branch-and-price algorithm for the two-dimensional vector packing problem," European Journal of Operational Research, Elsevier, vol. 281(1), pages 25-35.
    10. Lijun Wei & Zhixing Luo, & Roberto Baldacci & Andrew Lim, 2020. "A New Branch-and-Price-and-Cut Algorithm for One-Dimensional Bin-Packing Problems," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 428-443, April.
    11. Stefan Irnich & Daniel Villeneuve, 2006. "The Shortest-Path Problem with Resource Constraints and k -Cycle Elimination for k (ge) 3," INFORMS Journal on Computing, INFORMS, vol. 18(3), pages 391-406, August.
    12. Hu, Qian & Zhu, Wenbin & Qin, Hu & Lim, Andrew, 2017. "A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function," European Journal of Operational Research, Elsevier, vol. 260(1), pages 70-80.
    13. Silvano Martello & Paolo Toth, 2003. "An Exact Algorithm for the Two-Constraint 0--1 Knapsack Problem," Operations Research, INFORMS, vol. 51(5), pages 826-835, October.
    14. Julien Bramel & WanSoo T. Rhee & David Simchi‐Levi, 1997. "Average‐case analysis of the bin‐packing problem with general cost structures," Naval Research Logistics (NRL), John Wiley & Sons, vol. 44(7), pages 673-686, October.
    Full references (including those not matched with items on IDEAS)

    Citations

    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as


    Cited by:

    1. Haouari, Mohamed & Mhiri, Mariem, 2024. "Lower and upper bounding procedures for the bin packing problem with concave loading cost," European Journal of Operational Research, Elsevier, vol. 312(1), pages 56-69.
    2. Xue Yan & Ting Wang & Xuefei Shi, 2025. "Optimal scheduling on unrelated parallel machines with combinatorial auction," Annals of Operations Research, Springer, vol. 344(2), pages 937-963, January.

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Haouari, Mohamed & Mhiri, Mariem, 2024. "Lower and upper bounding procedures for the bin packing problem with concave loading cost," European Journal of Operational Research, Elsevier, vol. 312(1), pages 56-69.
    2. Hu, Qian & Zhu, Wenbin & Qin, Hu & Lim, Andrew, 2017. "A branch-and-price algorithm for the two-dimensional vector packing problem with piecewise linear cost function," European Journal of Operational Research, Elsevier, vol. 260(1), pages 70-80.
    3. Otto, Alena & Li, Xiyu, 2020. "Product sequencing in multiple-piece-flow assembly lines," Omega, Elsevier, vol. 91(C).
    4. Hu, Qian & Wei, Lijun & Lim, Andrew, 2018. "The two-dimensional vector packing problem with general costs," Omega, Elsevier, vol. 74(C), pages 59-69.
    5. Shaoxiang Zheng & Naiming Xie & Qiao Wu, 2025. "An exact approach for bi-objective non-identical batch processing machines scheduling," Annals of Operations Research, Springer, vol. 346(3), pages 2307-2347, March.
    6. Artur Pessoa & Ruslan Sadykov & Eduardo Uchoa, 2021. "Solving Bin Packing Problems Using VRPSolver Models," SN Operations Research Forum, Springer, vol. 2(2), pages 1-25, June.
    7. Chen, Yanru & Gao, Mujin & Zhang, Zongcheng & Li, Junheng & Wahab, M.I.M. & Jiang, Yangsheng, 2025. "Contextual bandits learning-based branch-and-price-and-cut algorithm for the two-dimensional vector packing problem with conflicts and time windows," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 193(C).
    8. Katrin Heßler & Stefan Irnich & Tobias Kreiter & Ulrich Pferschy, 2020. "Lexicographic Bin-Packing Optimization for Loading Trucks in a Direct-Shipping System," Working Papers 2009, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    9. Yulle G. F. Borges & Vinícius L. Lima & Flávio K. Miyazawa & Lehilton L. C. Pedrosa & Thiago A. Queiroz & Rafael C. S. Schouery, 2024. "Algorithms for the bin packing problem with scenarios," Journal of Combinatorial Optimization, Springer, vol. 48(4), pages 1-28, November.
    10. Julia Wahlen & Timo Gschwind, 2023. "Branch-Price-and-Cut-Based Solution of Order Batching Problems," Transportation Science, INFORMS, vol. 57(3), pages 756-777, May.
    11. Ning Ma & Angjun Tang & Yu Li & Wei Zhang & Fuxin Jiang & Zuzhi Chen, 2026. "Column generation-based diving heuristic and segmentation approach for the micro-service allocation problem with affinity in cloud computing," Operational Research, Springer, vol. 26(2), pages 1-34, June.
    12. Bode, Claudia & Irnich, Stefan, 2014. "The shortest-path problem with resource constraints with (k,2)-loop elimination and its application to the capacitated arc-routing problem," European Journal of Operational Research, Elsevier, vol. 238(2), pages 415-426.
    13. Baldacci, Roberto & Mingozzi, Aristide & Roberti, Roberto, 2012. "Recent exact algorithms for solving the vehicle routing problem under capacity and time window constraints," European Journal of Operational Research, Elsevier, vol. 218(1), pages 1-6.
    14. Timo Gschwind & Stefan Irnich, 2012. "Effective Handling of Dynamic Time Windows and Synchronization with Precedences for Exact Vehicle Routing," Working Papers 1211, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    15. Leonardo Lozano & Daniel Duque & Andrés L. Medaglia, 2016. "An Exact Algorithm for the Elementary Shortest Path Problem with Resource Constraints," Transportation Science, INFORMS, vol. 50(1), pages 348-357, February.
    16. Braune, Roland, 2019. "Lower bounds for a bin packing problem with linear usage cost," European Journal of Operational Research, Elsevier, vol. 274(1), pages 49-64.
    17. Claudia Bode & Stefan Irnich, 2012. "Cut-First Branch-and-Price-Second for the Capacitated Arc-Routing Problem," Operations Research, INFORMS, vol. 60(5), pages 1167-1182, October.
    18. Nikolaus Furian & Michael O’Sullivan & Cameron Walker & Eranda Çela, 2021. "A machine learning-based branch and price algorithm for a sampled vehicle routing problem," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 43(3), pages 693-732, September.
    19. Li, Weidong & Ou, Jinwen, 2025. "The generalized assignment problem with fixed processing times and uniform processing costs to minimize total cost," European Journal of Operational Research, Elsevier, vol. 327(2), pages 420-431.
    20. Said Dabia & Stefan Ropke & Tom van Woensel, 2019. "Cover Inequalities for a Vehicle Routing Problem with Time Windows and Shifts," Transportation Science, INFORMS, vol. 53(5), pages 1354-1371, September.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:eee:ejores:v:300:y:2022:i:1:p:20-34. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Catherine Liu (email available below). General contact details of provider: http://www.elsevier.com/locate/eor .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.