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

Imane Hamidi and Djamal Chaabane

International Journal of Multicriteria Decision Making, 2023, vol. 9, issue 4, 281-321

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.

Keywords: multi-objective integer linear programming; MOILP; combinatorial problem; set covering problem; branch and bound; B&B; two-phase method. (search for similar items in EconPapers)
Date: 2023
References: Add references at CitEc
Citations:

Downloads: (external link)
http://www.inderscience.com/link.php?id=134923 (text/html)
Access to full text is restricted to subscribers.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:ids:ijmcdm:v:9:y:2023:i:4:p:281-321

Access Statistics for this article

More articles in International Journal of Multicriteria Decision Making from Inderscience Enterprises Ltd
Bibliographic data for series maintained by Sarah Parker ().