A Weed Colonization Inspired Algorithm for the Weighted Set Cover Problem

被引：0

作者：

Crawford, Broderick ^{[1
,2
,3
]}

Soto, Ricardo ^{[1
,4
]}

Fuenzalida Legue, Ismael ^{[1
]}

Misra, Sanjay ^{[5
]}

Olgu, Eduardo ^{[2
]}

机构：

[1] Pontificia Univ Catolica Valparaiso, Valparaiso 2362807, Chile

[2] Univ San Sebastian, Fac Ingn & Tecnol, Bellavista 7, Santiago 8420524, Chile

[3] Univ Cent Chile, Santiago 8370178, Chile

[4] Univ Cient Sur, Lima 18, Peru

[5] Covenant Univ, Ogun 110001, Nigeria

来源：

COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2016, PT V | 2016年 / 9790卷

关键词：

Invasive Weed Optimization; Set covering problem; Combinatorial optimization; LOCATION; MODEL;

D O I：

10.1007/978-3-319-42092-9_11

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

The Weighted Set Cover Problem (SCP) is a popular optimization problem that has been applied to different industrial applications, including scheduling, manufacturing, service planning and location problems. It consists in to find low cost solutions covering a set of requirements or needs. In this paper, we solve the SCP using a recent nature inspired algorithm: Invasive Weed Optimization (IWO). IWO imitates the invasive behavior of real weeds: natural reproduction and selection where the best weed has more chance of reproduction. We test our approach using known ORLIB test problems for the SCP. The computational results show that the IWO metaheuristic can find very good results.

引用

页码：129 / 138

页数：10

共 50 条

[31] Approximation algorithm for the partial set multi-cover problem
Yishuo Shi
Yingli Ran
Zhao Zhang
James Willson
Guangmo Tong
Ding-Zhu Du
Journal of Global Optimization, 2019, 75 : 1133 - 1146
[32] An exact algorithm for finding cancer driver somatic genome alterations: the weighted mutually exclusive maximum set cover problem
Songjian Lu
Gunasheil Mandava
Gaibo Yan
Xinghua Lu
Algorithms for Molecular Biology, 11
[33] An exact algorithm for finding cancer driver somatic genome alterations: the weighted mutually exclusive maximum set cover problem
Lu, Songjian
Mandava, Gunasheil
Yan, Gaibo
Lu, Xinghua
ALGORITHMS FOR MOLECULAR BIOLOGY, 2016, 11
[34] An evolutionary algorithm for the robust maximum weighted independent set problem
Klobucar, Ana
Manger, Robert
AUTOMATIKA, 2020, 61 (04) : 523 - 536
[35] Efficient network algorithms for two special cases of the weighted set cover problem
Tayyebi, Javad
Mohammadi, Abumoslem
INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE AND ENGINEERING MANAGEMENT, 2018, 13 (03) : 209 - 214
[36] An ant-algorithm for the weighted minimum hitting set problem
Cincotti, A
Cutello, V
Pappalardo, F
PROCEEDINGS OF THE 2003 IEEE SWARM INTELLIGENCE SYMPOSIUM (SIS 03), 2003, : 1 - 5
[37] An approximation algorithm for weighted weak vertex cover problem in undirected graphs
Zhang, Y
Zhu, H
COMPUTING AND COMBINATORICS, PROCEEDINGS, 2004, 3106 : 143 - 150
[38] A LINEAR-TIME APPROXIMATION ALGORITHM FOR THE WEIGHTED VERTEX COVER PROBLEM
BARYEHUDA, R
EVEN, S
JOURNAL OF ALGORITHMS, 1981, 2 (02) : 198 - 203
[39] Solving the Set Covering Problem with a Binary Black Hole Inspired Algorithm
Rubio, Alvaro Gomez
Crawford, Broderick
Soto, Ricardo
Olguin, Eduardo
Misra, Sanjay
Jaramillo, Adrian
Villablanca, Sebastian Mansilla
Salas, Juan
COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2016, PT I, 2016, 9786 : 207 - 219
[40] A modified greedy algorithm for the set cover problem with weights 1 and 2
Toshihiro, F
Okumura, T
ALGORITHMS AND COMPUTATION, PROCEEDINGS, 2001, 2223 : 670 - 681

← 1 2 3 4 5 →