The Impact of a New Formulation When Solving the Set Covering Problem Using the ACO Metaheuristic

被引：2

作者：

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

Soto, Ricardo ^{[1
,4
,5
]}

Palma, Wenceslao ^{[1
]}

Paredes, Fernando ^{[6
]}

Johnson, Franklin ^{[1
,7
]}

Norero, Enrique ^{[8
]}

机构：

[1] Pontificia Univ Catolica Valparaiso, Valparaiso, Chile

[2] Univ Finis Terrae, Providencia, Chile

[3] Univ San Sebastian, Santiago, Chile

[4] Univ Autonoma Chile, Santiago, Chile

[5] Univ Cent Chile, Santiago, Chile

[6] Univ Diego Portales, Escuela Ingn Ind, Santiago, Chile

[7] Univ Playa Ancha, Dept Computac & Informat, Valparaiso, Chile

[8] Univ Santo Tomas, Fac Ingn, Escuela Ingn, Vina Del Mar, Chile

来源：

MODELLING, COMPUTATION AND OPTIMIZATION IN INFORMATION SYSTEMS AND MANAGEMENT SCIENCES - MCO 2015 - PT II | 2015年 / 360卷

关键词：

Set Covering Problem; Ant Colony Optimization; Metaheuristics; ALGORITHM; OPTIMIZATION; COLONY;

D O I：

10.1007/978-3-319-18167-7_19

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

The Set Covering Problem (SCP) is a well-known NP hard discrete optimization problem that has been applied to a wide range of industrial applications, including those involving scheduling, production planning and location problems. The main difficulties when solving the SCP with a metaheuristic approach are the solution infeasibility and set redundancy. In this paper we evaluate a state of the art new formulation of the SCP which eliminates the need to address the infeasibility and set redundancy issues. The experimental results, conducted on a portfolio of SCPs from the Beasley's OR-Library, show the gains obtained when using a new formulation to solve the SCP using the ACO metaheuristic.

引用

页码：209 / 218

页数：10

共 50 条

[31] Harmony Search Algorithm for Solving Set-Covering Problem
Salas, Juan
Crawford, Broderick
Soto, Ricardo
Gomez Rubio, Alvaro
Jaramillo, Adrian
Mansilla Villablanca, Sebastian
Olguin, Eduardo
TRENDS IN APPLIED KNOWLEDGE-BASED SYSTEMS AND DATA SCIENCE, 2016, 9799 : 917 - 930
[32] Application of hybrid evolutionary algorithm for solving the Set Covering Problem
Lin, Geng
MODERN COMPUTER SCIENCE AND APPLICATIONS II (MCSA 2017), 2017, : 46 - 52
[33] On a linearization technique for solving the quadratic set covering problem and variations
Pooja Pandey
Abraham P. Punnen
Optimization Letters, 2017, 11 : 1357 - 1370
[34] Ant-Line: A Line-Oriented ACO Algorithm for the Set Covering Problem
Mulati, Mauro Henrique
Constantino, Ademir Aparecido
2011 30TH INTERNATIONAL CONFERENCE OF THE CHILEAN COMPUTER SCIENCE SOCIETY (SCCC), 2012, : 265 - 274
[35] Metaheuristic link prediction (MLP) using AI based ACO-GA optimization model for solving vehicle routing problem
Revanna J.K.C.
Al-Nakash N.Y.B.
International Journal of Information Technology, 2023, 15 (7) : 3425 - 3439
[36] A binary monkey search algorithm variation for solving the set covering problem
Crawford, Broderick
Soto, Ricardo
Olivares, Rodrigo
Embry, Gabriel
Flores, Diego
Palma, Wenceslao
Castro, Carlos
Paredes, Fernando
Rubio, Jose-Miguel
NATURAL COMPUTING, 2020, 19 (04) : 825 - 841
[37] Application of the Artificial Bee Colony Algorithm for Solving the Set Covering Problem
Crawford, Broderick
Soto, Ricardo
Cuesta, Rodrigo
Paredes, Fernando
SCIENTIFIC WORLD JOURNAL, 2014,
[38] Biogeography-Based Optimization Algorithm for Solving the Set Covering Problem
Crawford, Broderick
Soto, Ricardo
Riquelme, Luis
Olguin, Eduardo
ARTIFICIAL INTELLIGENCE PERSPECTIVES IN INTELLIGENT SYSTEMS, VOL 1, 2016, 464 : 273 - 283
[39] NuSC: An Effective Local Search Algorithm for Solving the Set Covering Problem
Luo, Chuan
Xing, Wenqian
Cai, Shaowei
Hu, Chunming
IEEE TRANSACTIONS ON CYBERNETICS, 2024, 54 (03) : 1403 - 1416
[40] 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

← 1 2 3 4 5 →