An algorithm for approximating the Pareto set of the multiobjective set covering problem

Weerasena L., Wiecek M. M., SOYLU B.

ANNALS OF OPERATIONS RESEARCH, cilt.248, ss.493-514, 2017 (SCI-Expanded) identifier identifier

  • Yayın Türü: Makale / Tam Makale
  • Cilt numarası: 248
  • Basım Tarihi: 2017
  • Doi Numarası: 10.1007/s10479-016-2229-x
  • Dergi Adı: ANNALS OF OPERATIONS RESEARCH
  • Derginin Tarandığı İndeksler: Science Citation Index Expanded (SCI-EXPANDED), Scopus
  • Sayfa Sayıları: ss.493-514
  • Anahtar Kelimeler: Multiobjective set covering problem, Heuristics, Local branching, Tree-based search, MULTIPLE-OBJECTIVE METAHEURISTICS, NEIGHBORHOOD SEARCH, LOCAL SEARCH, RELAXATION, SOLVE
  • Erciyes Üniversitesi Adresli: Evet

Özet

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.