| Autor: |
Hamidi, Imane, Chaabane, Djamal |
| Zdroj: |
International Journal of Multicriteria Decision Making; 2023, Vol. 9 Issue: 4 p281-321, 41p |
| Abstrakt: |
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. |
| Databáze: |
Supplemental Index |
| Externí odkaz: |
|
