IDEAS home Printed from https://ideas.repec.org/a/taf/tprsxx/v56y2018i4p1581-1592.html
   My bibliography  Save this article

MIP-based constructive heuristics for the three-dimensional Bin Packing Problem with transportation constraints

Author

Listed:
  • Célia Paquay
  • Sabine Limbourg
  • Michaël Schyns
  • José Fernando Oliveira

Abstract

This article is about seeking a good feasible solution in a reasonable amount of computation time to the three-dimensional Multiple Bin Size Bin Packing Problem (MBSBPP). The MBSBPP studied considers additional constraints encountered in real world air transportation situations, such as cargo stability and the particular shape of containers. This MBSBPP has already been formulated as a Mixed Integer linear Programming problem, but as yet only poor results have been achieved for even fairly small problem sizes. The goal of the work this paper describes is to develop heuristics that are able to quickly provide good initial feasible solutions for the MBSBPP. Three methodologies are considered, which are based on the decomposition of the original problem into easier subproblems: the matheuristics Relax-and-Fix, Insert-and-Fix and Fractional Relax-and-Fix. They have been parametrised on real data sets and then compared to each other. In particular, two of these techniques show promising results in reasonable computational times.

Suggested Citation

  • Célia Paquay & Sabine Limbourg & Michaël Schyns & José Fernando Oliveira, 2018. "MIP-based constructive heuristics for the three-dimensional Bin Packing Problem with transportation constraints," International Journal of Production Research, Taylor & Francis Journals, vol. 56(4), pages 1581-1592, February.
    • Handle: RePEc:taf:tprsxx:v:56:y:2018:i:4:p:1581-1592
    DOI: 10.1080/00207543.2017.1355577
    as

    Download full text from publisher

    File URL: http://hdl.handle.net/10.1080/00207543.2017.1355577
    Download Restriction: Access to full text is restricted to subscribers.
    File URL: https://libkey.io/10.1080/00207543.2017.1355577?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 search for a different version of it.

    Citations

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


    Cited by:

    1. Jianyu Long & Zhong Zheng & Xiaoqiang Gao & Panos M. Pardalos & Wanzhe Hu, 2020. "An effective heuristic based on column generation for the two-dimensional three-stage steel plate cutting problem," Annals of Operations Research, Springer, vol. 289(2), pages 291-311, June.
    2. Rakiz, Asma & Absi, Nabil & Fenies, Pierre, 2023. "Comparing approaches for a multi-level planning problem in a mining industry," International Journal of Production Economics, Elsevier, vol. 265(C).
    3. Li, Yantong & Chu, Feng & Côté, Jean-François & Coelho, Leandro C. & Chu, Chengbin, 2020. "The multi-plant perishable food production routing with packaging consideration," International Journal of Production Economics, Elsevier, vol. 221(C).
    4. Tseremoglou, Iordanis & Bombelli, Alessandro & Santos, Bruno F., 2022. "A combined forecasting and packing model for air cargo loading: A risk-averse framework," Transportation Research Part E: Logistics and Transportation Review, Elsevier, vol. 158(C).
    5. Brandt, Felix & Nickel, Stefan, 2019. "The air cargo load planning problem - a consolidated problem definition and literature review on related problems," European Journal of Operational Research, Elsevier, vol. 275(2), pages 399-410.
    6. Silva, Elsa & Ramos, António G. & Oliveira, José F., 2018. "Load balance recovery for multi-drop distribution problems: A mixed integer linear programming approach," Transportation Research Part B: Methodological, Elsevier, vol. 116(C), pages 62-75.
    7. Xiangling Zhao & Yun Dong & Lei Zuo, 2023. "A Combinatorial Optimization Approach for Air Cargo Palletization and Aircraft Loading," Mathematics, MDPI, vol. 11(13), pages 1-16, June.

    More about this item

    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:taf:tprsxx:v:56:y:2018:i:4:p:1581-1592. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Chris Longhurst (email available below). General contact details of provider: http://www.tandfonline.com/TPRS20 .

    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.