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 条

[1] An Immune-Inspired Algorithm for the Set Cover Problem
Joshi, Ayush
Rowe, Jonathan E.
Zarges, Christine
PARALLEL PROBLEM SOLVING FROM NATURE - PPSN XIII, 2014, 8672 : 243 - 251
[2] An immune-inspired algorithm for the set cover problem
1600, Springer Verlag (8672):
[3] A novel numerical optimization algorithm inspired from weed colonization
Mehrabian, A. R.
Lucas, C.
ECOLOGICAL INFORMATICS, 2006, 1 (04) : 355 - 366
[4] Set-weighted games and their application to the cover problem
Gusev, Vasily V.
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2023, 305 (01) : 438 - 450
[5] A Primal-Dual Randomized Algorithm for the Online Weighted Set Multi-cover Problem
Chen, Wenbin
Li, Fufang
Qi, Ke
Liu, Miao
Tang, Maobin
THEORY AND APPLICATIONS OF MODELS OF COMPUTATION, TAMC 2020, 2020, 12337 : 60 - 68
[6] An effective algorithm for the minimum set cover problem
Zhang, Pei
Wang, Rong-Long
Wu, Chong-Guang
Okazaki, Kozo
PROCEEDINGS OF 2006 INTERNATIONAL CONFERENCE ON MACHINE LEARNING AND CYBERNETICS, VOLS 1-7, 2006, : 3032 - +
[7] Preserving approximation in the Min-Weighted Set Cover Problem
Gambosi, G
Protasi, M
Talamo, M
DISCRETE APPLIED MATHEMATICS, 1997, 73 (01) : 13 - 22
[8] An effective algorithm for minimum weighted vertex cover problem
Balaji, S.
Swaminathan, V.
Kannan, K.
World Academy of Science, Engineering and Technology, 2010, 43 : 315 - 319
[9] An effective algorithm for minimum weighted vertex cover problem
Balaji, S.
Swaminathan, V.
Kannan, K.
International Journal of Computational and Mathematical Sciences, 2010, 4 (01): : 34 - 38
[10] A PARALLEL ALGORITHM FOR THE MINIMUM WEIGHTED VERTEX COVER PROBLEM
LIKAS, A
STAFYLOPATIS, A
INFORMATION PROCESSING LETTERS, 1995, 53 (04) : 229 - 234

← 1 2 3 4 5 →