IDEAS home Printed from https://ideas.repec.org/a/ids/ijmcdm/v9y2023i4p281-321.html
   My bibliography  Save this article

A two-phase method based on the branch and bound algorithm for solving the bi-objective set covering problem

Author

Listed:
  • Imane Hamidi
  • Djamal Chaabane

Abstract

Multicriteria set covering problem (SCP) is classified in the category of NP-hard combinatorial optimisation problems. In this paper, we propose a new exact approach to solve the bi-objective set covering problem (BOSCP); where branch and bound (B&B) technique is the pivot of the procedure skeleton, in both phases. We focus, particularly, on the second phase where a new branching architecture and a new priority order of branching variables are introduced. A rich set of experiments containing a numerical illustration and some MCDM-benchmark BOSCP instances are used to validate our developed method. Some comparisons to an existing two-phase method have been done using the MCDM-benchmark BOSCP instances.

Suggested Citation

  • Imane Hamidi & Djamal Chaabane, 2023. "A two-phase method based on the branch and bound algorithm for solving the bi-objective set covering problem," International Journal of Multicriteria Decision Making, Inderscience Enterprises Ltd, vol. 9(4), pages 281-321.
    • Handle: RePEc:ids:ijmcdm:v:9:y:2023:i:4:p:281-321
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=134923
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    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:ids:ijmcdm:v:9:y:2023:i:4:p:281-321. 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: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=350 .

    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.