IDEAS home Printed from https://ideas.repec.org/a/inm/orijoc/v33y2021i3p949-962.html
   My bibliography  Save this article

The Quadratic Multiknapsack Problem with Conflicts and Balance Constraints

Author

Listed:
  • Philippe Olivier

    (Polytechnique Montréal, Montréal, Québec H3J 3A7, Canada)

  • Andrea Lodi

    (Polytechnique Montréal, Montréal, Québec H3J 3A7, Canada)

  • Gilles Pesant

    (Polytechnique Montréal, Montréal, Québec H3J 3A7, Canada)

Abstract

The quadratic multiknapsack problem consists of packing a set of items of various weights into knapsacks of limited capacities with profits being associated with pairs of items packed into the same knapsack. This problem has been solved by various heuristics since its inception, and more recently it has also been solved with an exact method. We introduce a generalization of this problem that includes pairwise conflicts as well as balance constraints, among other particularities. We present and compare constraint programming and integer programming approaches for solving this generalized problem. Summary of Contribution : The quadratic multiknapsack problem consists of packing a set of items of various weights into knapsacks of limited capacities -- with profits being associated with pairs of items packed into the same knapsack. This problem has been solved by various heuristics since its inception, and more recently it has also been solved with an exact method. We introduce a generalization of this problem which includes pairwise conflicts as well as balance constraints, among other particularities. We present and compare constraint programming and integer programming approaches for solving this generalized problem. The problem we address is clearly in the core of the operations research applications in which subsets have to be built and, in particular, we add the concept of fairness to the modeling and solution process by computationally evaluating techniques to take fairness into account. This is clearly at the core of computational evaluation of algorithms.

Suggested Citation

  • Philippe Olivier & Andrea Lodi & Gilles Pesant, 2021. "The Quadratic Multiknapsack Problem with Conflicts and Balance Constraints," INFORMS Journal on Computing, INFORMS, vol. 33(3), pages 949-962, July.
    • Handle: RePEc:inm:orijoc:v:33:y:2021:i:3:p:949-962
    DOI: 10.1287/ijoc.2020.0983
    as

    Download full text from publisher

    File URL: http://dx.doi.org/10.1287/ijoc.2020.0983
    Download Restriction: no
    File URL: https://libkey.io/10.1287/ijoc.2020.0983?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
    ---><---

    References listed on IDEAS

    as
    1. Ruslan Sadykov & François Vanderbeck, 2013. "Bin Packing with Conflicts: A Generic Branch-and-Price Algorithm," INFORMS Journal on Computing, INFORMS, vol. 25(2), pages 244-255, May.
    2. C Mullinax & M Lawley, 2002. "Assigning patients to nurses in neonatal intensive care," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 53(1), pages 25-35, January.
    3. Rhyd Lewis & Fiona Carroll, 2016. "Creating seating plans: a practical application," Journal of the Operational Research Society, Palgrave Macmillan;The OR Society, vol. 67(11), pages 1353-1362, November.
    4. David Bergman, 2019. "An Exact Algorithm for the Quadratic Multiknapsack Problem with an Application to Event Seating," INFORMS Journal on Computing, INFORMS, vol. 31(3), pages 477-492, July.
    5. Natashia Boland & Hadi Charkhgard & Martin Savelsbergh, 2015. "A Criterion Space Search Algorithm for Biobjective Integer Programming: The Balanced Box Method," INFORMS Journal on Computing, INFORMS, vol. 27(4), pages 735-754, November.
    6. Gilles Pesant, 2015. "Achieving Domain Consistency and Counting Solutions for Dispersion Constraints," INFORMS Journal on Computing, INFORMS, vol. 27(4), pages 690-703, November.
    7. Natashia Boland & Hadi Charkhgard & Martin Savelsbergh, 2015. "A Criterion Space Search Algorithm for Biobjective Mixed Integer Programming: The Triangle Splitting Method," INFORMS Journal on Computing, INFORMS, vol. 27(4), pages 597-618, November.
    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. Atashpaz Gargari, Masoud & Sahraeian, Rashed, 2023. "An exact criterion space search method for a bi-objective nursing home location and allocation problem," Mathematics and Computers in Simulation (MATCOM), Elsevier, vol. 206(C), pages 166-180.
    2. Yıldız, Gazi Bilal & Soylu, Banu, 2019. "A multiobjective post-sales guarantee and repair services network design problem," International Journal of Production Economics, Elsevier, vol. 216(C), pages 305-320.
    3. Fattahi, Ali & Turkay, Metin, 2018. "A one direction search method to find the exact nondominated frontier of biobjective mixed-binary linear programming problems," European Journal of Operational Research, Elsevier, vol. 266(2), pages 415-425.
    4. Masar Al-Rabeeah & Santosh Kumar & Ali Al-Hasani & Elias Munapo & Andrew Eberhard, 2019. "Bi-objective integer programming analysis based on the characteristic equation," International Journal of System Assurance Engineering and Management, Springer;The Society for Reliability, Engineering Quality and Operations Management (SREQOM),India, and Division of Operation and Maintenance, Lulea University of Technology, Sweden, vol. 10(5), pages 937-944, October.
    5. Soylu, Banu & Katip, Hatice, 2019. "A multiobjective hub-airport location problem for an airline network design," European Journal of Operational Research, Elsevier, vol. 277(2), pages 412-425.
    6. Seyyed Amir Babak Rasmi & Ali Fattahi & Metin Türkay, 2021. "SASS: slicing with adaptive steps search method for finding the non-dominated points of tri-objective mixed-integer linear programming problems," Annals of Operations Research, Springer, vol. 296(1), pages 841-876, January.
    7. Hongming Li & Xintao Li, 2022. "A Branch-and-Bound Algorithm for the Bi-Objective Quay Crane Scheduling Problem Based on Efficiency and Energy," Mathematics, MDPI, vol. 10(24), pages 1-20, December.
    8. Saharnaz Mehrani & Carlos Cardonha & David Bergman, 2022. "Models and Algorithms for the Bin-Packing Problem with Minimum Color Fragmentation," INFORMS Journal on Computing, INFORMS, vol. 34(2), pages 1070-1085, March.
    9. William Pettersson & Melih Ozlen, 2020. "Multiobjective Integer Programming: Synergistic Parallel Approaches," INFORMS Journal on Computing, INFORMS, vol. 32(2), pages 461-472, April.
    10. Özlem Karsu & Hale Erkan, 2020. "Balance in resource allocation problems: a changing reference approach," OR Spectrum: Quantitative Approaches in Management, Springer;Gesellschaft für Operations Research e.V., vol. 42(1), pages 297-326, March.
    11. Hadi Charkhgard & Mahdi Takalloo & Zulqarnain Haider, 2020. "Bi-objective autonomous vehicle repositioning problem with travel time uncertainty," 4OR, Springer, vol. 18(4), pages 477-505, December.
    12. Halvorsen-Weare, Elin E. & Savelsbergh, Martin W.P., 2016. "The bi-objective mixed capacitated general routing problem with different route balance criteria," European Journal of Operational Research, Elsevier, vol. 251(2), pages 451-465.
    13. Daniel Jornada & V. Jorge Leon, 2020. "Filtering Algorithms for Biobjective Mixed Binary Linear Optimization Problems with a Multiple-Choice Constraint," INFORMS Journal on Computing, INFORMS, vol. 32(1), pages 57-73, January.
    14. Gabriele Eichfelder & Tobias Gerlach & Leo Warnow, 2024. "A test instance generator for multiobjective mixed-integer optimization," Mathematical Methods of Operations Research, Springer;Gesellschaft für Operations Research (GOR);Nederlands Genootschap voor Besliskunde (NGB), vol. 100(1), pages 385-410, August.
    15. Sierra-Altamiranda, Alvaro & Charkhgard, Hadi & Eaton, Mitchell & Martin, Julien & Yurek, Simeon & Udell, Bradley J., 2020. "Spatial conservation planning under uncertainty using modern portfolio theory and Nash bargaining solution," Ecological Modelling, Elsevier, vol. 423(C).
    16. Przybylski, Anthony & Gandibleux, Xavier, 2017. "Multi-objective branch and bound," European Journal of Operational Research, Elsevier, vol. 260(3), pages 856-872.
    17. Konur, Dinçer & Campbell, James F. & Monfared, Sepideh A., 2017. "Economic and environmental considerations in a stochastic inventory control model with order splitting under different delivery schedules among suppliers," Omega, Elsevier, vol. 71(C), pages 46-65.
    18. Acuna, Jorge A. & Zayas-Castro, José L. & Charkhgard, Hadi, 2020. "Ambulance allocation optimization model for the overcrowding problem in US emergency departments: A case study in Florida," Socio-Economic Planning Sciences, Elsevier, vol. 71(C).
    19. Hadi Charkhgard & Martin Savelsbergh & Masoud Talebian, 2018. "Nondominated Nash points: application of biobjective mixed integer programming," 4OR, Springer, vol. 16(2), pages 151-171, June.
    20. Boland, Natashia & Charkhgard, Hadi & Savelsbergh, Martin, 2017. "The Quadrant Shrinking Method: A simple and efficient algorithm for solving tri-objective integer programs," European Journal of Operational Research, Elsevier, vol. 260(3), pages 873-885.

    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:inm:orijoc:v:33:y:2021:i:3:p:949-962. 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: Chris Asher (email available below). General contact details of provider: https://edirc.repec.org/data/inforea.html .

    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.