Two-phase method and Lagrangian relaxation to solve the Bi-Objective Set Covering Problem - Archive ouverte HAL Access content directly
Journal Articles Annals of Operations Research Year : 2006

Two-phase method and Lagrangian relaxation to solve the Bi-Objective Set Covering Problem

(1) , (1) , (1)
1

Abstract

This paper deals with the Bi-Objective Set Covering Problem, which is a generalization of the well-known Set Covering Problem. The proposed approach is a two-phase heuristic method which has the particularity to be a constructive method using the primal-dual Lagrangian relaxation to solve single objective Set Covering problems. The results show that this algorithm finds several potentially supported and unsupported solutions. A comparison with an exact method (up to a medium size), shows that many Pareto-optimal solutions are retrieved and that the other solutions are well spread and close to the optimal ones. Moreover, the method developed compares favorably with the Pareto Memetic Algorithm proposed by Jaszkiewicz.

Dates and versions

hal-02525221 , version 1 (30-03-2020)

Identifiers

Cite

Christian Prins, Caroline Prodhon, Roberto Wolfler Calvo. Two-phase method and Lagrangian relaxation to solve the Bi-Objective Set Covering Problem. Annals of Operations Research, 2006, 147 (1), pp.23-41. ⟨10.1007/s10479-006-0060-5⟩. ⟨hal-02525221⟩

Collections

CNRS UTT LOSI
13 View
0 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More