IDEAS home Printed from https://ideas.repec.org/a/eee/ejores/v256y2017i2p392-403.html
   My bibliography  Save this article

Lower bounds and algorithms for the minimum cardinality bin covering problem

Author

Listed:
  • Walter, Rico
  • Lawrinenko, Alexander

Abstract

This paper introduces the minimum cardinality bin covering problem where we are given m identical bins with capacity C and n indivisible items with integer weights wj(j=1,…,n). The objective is to minimize the number of items packed into the m bins so that the total weight of each bin is at least equal to C. We discuss reduction criteria, derive several lower bound arguments and propose construction heuristics as well as a powerful subset sum-based improvement algorithm that is even optimal when m=2. Moreover, we present a tailored branch-and-bound method which is able to solve instances with up to 20 bins and several hundreds of items within a reasonable amount of time. In a comprehensive computational study on a wide range of randomly generated instances, our algorithmic approach proved to be much more effective than a commercial solver.

Suggested Citation

  • Walter, Rico & Lawrinenko, Alexander, 2017. "Lower bounds and algorithms for the minimum cardinality bin covering problem," European Journal of Operational Research, Elsevier, vol. 256(2), pages 392-403.
  • Handle: RePEc:eee:ejores:v:256:y:2017:i:2:p:392-403
    DOI: 10.1016/j.ejor.2016.06.068
    as

    Download full text from publisher

    File URL: http://www.sciencedirect.com/science/article/pii/S0377221716305288
    Download Restriction: Full text for ScienceDirect subscribers only

    File URL: https://libkey.io/10.1016/j.ejor.2016.06.068?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.

    References listed on IDEAS

    as
    1. Fleszar, Krzysztof & Charalambous, Christoforos, 2011. "Average-weight-controlled bin-oriented heuristics for the one-dimensional bin-packing problem," European Journal of Operational Research, Elsevier, vol. 210(2), pages 176-184, April.
    2. Vijayakumar, Bharathwaj & Parikh, Pratik J. & Scott, Rosalyn & Barnes, April & Gallimore, Jennie, 2013. "A dual bin-packing approach to scheduling surgical cases at a publicly-funded hospital," European Journal of Operational Research, Elsevier, vol. 224(3), pages 583-591.
    3. Labbe, Martine & Laporte, Gilbert & Martello, Silvano, 2003. "Upper bounds and algorithms for the maximum cardinality bin packing problem," European Journal of Operational Research, Elsevier, vol. 149(3), pages 490-498, September.
    4. Scheithauer, Guntram & Terno, Johannes, 1995. "The modified integer round-up property of the one-dimensional cutting stock problem," European Journal of Operational Research, Elsevier, vol. 84(3), pages 562-571, August.
    5. Marco E. Lübbecke & Jacques Desrosiers, 2005. "Selected Topics in Column Generation," Operations Research, INFORMS, vol. 53(6), pages 1007-1023, December.
    6. Gregory Dobson, 1982. "Worst-Case Analysis of Greedy Heuristics for Integer Programming with Nonnegative Data," Mathematics of Operations Research, INFORMS, vol. 7(4), pages 515-531, November.
    7. Peeters, Marc & Degraeve, Zeger, 2006. "Branch-and-price algorithms for the dual bin packing and maximum cardinality bin packing problem," European Journal of Operational Research, Elsevier, vol. 170(2), pages 416-439, April.
    Full references (including those not matched with items on IDEAS)

    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. Delorme, Maxence & Iori, Manuel & Martello, Silvano, 2016. "Bin packing and cutting stock problems: Mathematical models and exact algorithms," European Journal of Operational Research, Elsevier, vol. 255(1), pages 1-20.
    2. Vadim M. Kartak & Artem V. Ripatti, 2019. "Large proper gaps in bin packing and dual bin packing problems," Journal of Global Optimization, Springer, vol. 74(3), pages 467-476, July.
    3. 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.
    4. Martinovic, J. & Scheithauer, G., 2016. "Integer linear programming models for the skiving stock problem," European Journal of Operational Research, Elsevier, vol. 251(2), pages 356-368.
    5. John Martinovic & Guntram Scheithauer, 2018. "Combinatorial investigations on the maximum gap for skiving stock instances of the divisible case," Annals of Operations Research, Springer, vol. 271(2), pages 811-829, December.
    6. Katrin Heßler & Timo Gschwind & Stefan Irnich, 2017. "Stabilized Branch-and-Price Algorithms for Vector Packing Problems," Working Papers 1713, Gutenberg School of Management and Economics, Johannes Gutenberg-Universität Mainz.
    7. Babak Akbarzadeh & Ghasem Moslehi & Mohammad Reisi-Nafchi & Broos Maenhout, 2020. "A diving heuristic for planning and scheduling surgical cases in the operating room department with nurse re-rostering," Journal of Scheduling, Springer, vol. 23(2), pages 265-288, April.
    8. John Martinovic & Guntram Scheithauer, 2016. "The proper relaxation and the proper gap of the skiving stock problem," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 84(3), pages 527-548, December.
    9. Sebastian Kraul & Markus Seizinger & Jens O. Brunner, 2023. "Machine Learning–Supported Prediction of Dual Variables for the Cutting Stock Problem with an Application in Stabilized Column Generation," INFORMS Journal on Computing, INFORMS, vol. 35(3), pages 692-709, May.
    10. Christensen, Tue R.L. & Labbé, Martine, 2015. "A branch-cut-and-price algorithm for the piecewise linear transportation problem," European Journal of Operational Research, Elsevier, vol. 245(3), pages 645-655.
    11. Ogbe, Emmanuel & Li, Xiang, 2017. "A new cross decomposition method for stochastic mixed-integer linear programming," European Journal of Operational Research, Elsevier, vol. 256(2), pages 487-499.
    12. François Clautiaux & Cláudio Alves & José Valério de Carvalho & Jürgen Rietz, 2011. "New Stabilization Procedures for the Cutting Stock Problem," INFORMS Journal on Computing, INFORMS, vol. 23(4), pages 530-545, November.
    13. de Lima, Vinícius L. & Alves, Cláudio & Clautiaux, François & Iori, Manuel & Valério de Carvalho, José M., 2022. "Arc flow formulations based on dynamic programming: Theoretical foundations and applications," European Journal of Operational Research, Elsevier, vol. 296(1), pages 3-21.
    14. Omid Shahvari & Rasaratnam Logendran & Madjid Tavana, 2022. "An efficient model-based branch-and-price algorithm for unrelated-parallel machine batching and scheduling problems," Journal of Scheduling, Springer, vol. 25(5), pages 589-621, October.
    15. Ann-Kathrin Rothenbächer & Michael Drexl & Stefan Irnich, 2018. "Branch-and-Price-and-Cut for the Truck-and-Trailer Routing Problem with Time Windows," Transportation Science, INFORMS, vol. 52(5), pages 1174-1190, October.
    16. Oliver Faust & Jochen Gönsch & Robert Klein, 2017. "Demand-Oriented Integrated Scheduling for Point-to-Point Airlines," Transportation Science, INFORMS, vol. 51(1), pages 196-213, February.
    17. Ibrahim Muter & Tevfik Aytekin, 2017. "Incorporating Aggregate Diversity in Recommender Systems Using Scalable Optimization Approaches," INFORMS Journal on Computing, INFORMS, vol. 29(3), pages 405-421, August.
    18. André Rossi & Alok Singh & Marc Sevaux, 2021. "Focus distance-aware lifetime maximization of video camera-based wireless sensor networks," Journal of Heuristics, Springer, vol. 27(1), pages 5-30, April.
    19. Flötteröd, Gunnar, 2017. "A search acceleration method for optimization problems with transport simulation constraints," Transportation Research Part B: Methodological, Elsevier, vol. 98(C), pages 239-260.
    20. Renaud Chicoisne, 2023. "Computational aspects of column generation for nonlinear and conic optimization: classical and linearized schemes," Computational Optimization and Applications, Springer, vol. 84(3), pages 789-831, April.

    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:256:y:2017:i:2:p:392-403. 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.