Paper Info
Title
An algorithm for approximating the Pareto set of the multiobjective set covering problem.
Abstract
The multiobjective set covering problem (MOSCP), a challenging combinatorial optimization problem, has received limited attention in the literature. This paper presents a heuristic algorithm to approximate the Pareto set of the MOSCP. The proposed algorithm applies a local branching approach on a tree structure and is enhanced with a node exploration strategy specially developed for the MOSCP. The main idea is to partition the search region into smaller subregions based on the neighbors of a reference solution and then to explore each subregion for the Pareto points of the MOSCP. Numerical experiments for instances with two, three and four objectives set covering problems are reported. Results on a performance comparison with benchmark algorithms from the literature are also included and show that the new algorithm is competitive and performs best on some instances.
Year
DOI
Venue
2017
https://doi.org/10.1007/s10479-016-2229-x
Annals OR
Keywords
Field
DocType
Multiobjective set covering problem,Heuristics,Local branching,Tree-based search
Set cover problem,Mathematical optimization,Heuristic (computer science),Algorithm,Heuristics,Tree structure,Partition (number theory),Mathematics,Pareto principle,Covering problems,Branching (version control)
Journal
Volume
Issue
ISSN
248
1-2
0254-5330
Citations 
PageRank 
References 
1
0.36
10
Authors
3
Name
Order
Citations
PageRank
Lakmali Weerasena110.36
Margaret M. Wiecek221322.90
Banu Soylu3826.17