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 条

[21] Fixed Set Search Applied to the Minimum Weighted Vertex Cover Problem
Jovanovic, Raka
Voss, Stefan
ANALYSIS OF EXPERIMENTAL ALGORITHMS, SEA2 2019, 2019, 11544 : 490 - 504
[22] An evolutionary game algorithm for minimum weighted vertex cover problem
Li, Yalun
Chai, Zhengyi
Ma, Hongling
Zhu, Sifeng
SOFT COMPUTING, 2023, 27 (21) : 16087 - 16100
[23] A modified greedy algorithm for dispersively weighted 3-set cover
Fujito, Toshihiro
Okumura, Tsuyoshi
DISCRETE APPLIED MATHEMATICS, 2006, 154 (09) : 1392 - 1400
[24] An evolutionary game algorithm for minimum weighted vertex cover problem
Yalun Li
Zhengyi Chai
Hongling Ma
Sifeng Zhu
Soft Computing, 2023, 27 : 16087 - 16100
[25] A DNA based evolutionary algorithm for the minimal set cover problem
Liu, WB
Zhu, XG
Xu, GD
Zhang, Q
Gao, L
ADVANCES IN INTELLIGENT COMPUTING, PT 2, PROCEEDINGS, 2005, 3645 : 80 - 89
[26] A greedy set cover algorithm for the IMRT beam selection problem
Clark, V
Deasy, J
MEDICAL PHYSICS, 2004, 31 (06) : 1855 - 1855
[27] A New Approximation Algorithm for k-Set Cover Problem
Essa, Hanaa A. E.
Abd El-Latif, Yasser M.
Ali, Salwa M.
Khamis, Soheir M.
ARABIAN JOURNAL FOR SCIENCE AND ENGINEERING, 2016, 41 (03) : 935 - 940
[28] Approximation algorithm for the partial set multi-cover problem
Shi, Yishuo
Ran, Yingli
Zhang, Zhao
Willson, James
Tong, Guangmo
Du, Ding-Zhu
JOURNAL OF GLOBAL OPTIMIZATION, 2019, 75 (04) : 1133 - 1146
[29] A succinct and approximate greedy algorithm for the Minimum Set Cover Problem
Delgado, Jorge
Ferrada, Hector
Navarro, Cristobal A.
JOURNAL OF COMPUTATIONAL SCIENCE, 2024, 81
[30] A New Approximation Algorithm for k-Set Cover Problem
Hanaa A. E. Essa
Yasser M. Abd El-Latif
Salwa M. Ali
Soheir M. Khamis
Arabian Journal for Science and Engineering, 2016, 41 : 935 - 940

← 1 2 3 4 5 →