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 条

[41] An Approximation Algorithm for P-prize-collecting Set Cover Problem
Guo, Jin-Shuang
Liu, Wen
Hou, Bo
JOURNAL OF THE OPERATIONS RESEARCH SOCIETY OF CHINA, 2023, 11 (01) : 207 - 217
[42] Algorithm for Solving the Generalized Set Cover Problem for a Special Class of Problems
Zykina A.V.
Munko V.V.
Journal of Mathematical Sciences, 2022, 267 (4) : 519 - 528
[43] An Approximation Algorithm for P-prize-collecting Set Cover Problem
Jin-Shuang Guo
Wen Liu
Bo Hou
Journal of the Operations Research Society of China, 2023, 11 : 207 - 217
[44] An algorithm for the weighted stable set problem in claw-free graphs with
Nobili, Paolo
Sassano, Antonio
MATHEMATICAL PROGRAMMING, 2017, 164 (1-2) : 157 - 165
[45] Closed circle DNA algorithm of maximum weighted independent set problem
Li, Qingyan
Yin, Zhixiang
Chen, Min
Advances in Intelligent Systems and Computing, 2013, 212 : 113 - 121
[46] THE ONLINE SET COVER PROBLEM
Alon, Noga
Awerbuch, Baruch
Azar, Yossi
Buchbinder, Niv
Naor, Joseph
SIAM JOURNAL ON COMPUTING, 2009, 39 (02) : 361 - 370
[47] The pipelined set cover problem
Munagala, K
Babu, S
Motwani, R
Widom, J
DATABASE THEORY - ICDT 2005, PROCEEDINGS, 2005, 3363 : 83 - 98
[48] The set cover with pairs problem
Hassin, R
Segev, D
FSTTCS 2005: FOUNDATIONS OF SOFTWARE TECHNOLOGY AND THEORETICAL COMPUTER SCIENCE, PROCEEDINGS, 2005, 3821 : 164 - 176
[49] Algorithms for connected set cover problem and fault-tolerant connected set cover problem
Zhang, Zhao
Gao, Xiaofeng
Wu, Weili
THEORETICAL COMPUTER SCIENCE, 2009, 410 (8-10) : 812 - 817
[50] Using a Social Media Inspired Optimization Algorithm to Solve the Set Covering Problem
Crawford, Broderick
Soto, Ricardo
Cabrera, Guillermo
Salas-Fernandez, Agustin
Paredes, Fernando
SOCIAL COMPUTING AND SOCIAL MEDIA: DESIGN, HUMAN BEHAVIOR AND ANALYTICS, SCSM 2019, PT I, 2019, 11578 : 43 - 52

← 1 2 3 4 5 →