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 条

[1] Solving the Balanced Academic Curriculum Problem Using the ACO Metaheuristic
Rubio, Jose-Miguel
Palma, Wenceslao
Rodriguez, Nibaldo
Soto, Ricardo
Crawford, Broderick
Paredes, Fernando
Cabrera, Guillermo
MATHEMATICAL PROBLEMS IN ENGINEERING, 2013, 2013
[2] An electromagnetism metaheuristic for the unicost set covering problem
Naji-Azimi, Zahra
Toth, Paolo
Galli, Laura
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2010, 205 (02) : 290 - 300
[3] Using ACO metaheuristic for MWT problem
Gisela Dorzan, Maria
Olinda Gagliardi, Edilma
Guillermo Leguizamon, Mario
Hernandez Penalver, Gregorio
2011 30TH INTERNATIONAL CONFERENCE OF THE CHILEAN COMPUTER SCIENCE SOCIETY (SCCC), 2012, : 228 - 237
[4] A comparison between ACO algorithms for the set covering problem
Lessing, L
Dumitrescu, I
Stützle, T
ANT COLONY OPTIMIZATION AND SWARM INTELLIGENCE, PROCEEDINGS, 2004, 3172 : 1 - 12
[5] A 2-level Metaheuristic for the Set Covering Problem
Valenzuela, C.
Crawford, B.
Soto, R.
Monfroy, E.
Paredes, F.
INTERNATIONAL JOURNAL OF COMPUTERS COMMUNICATIONS & CONTROL, 2012, 7 (02) : 377 - 387
[6] Solving the Set Covering Problem with Conflicts on Sets: A new parallel GRASP
Carrabs, Francesco
Cerulli, Raffaele
Mansini, Renata
Moreschini, Lorenzo
Serra, Domenico
COMPUTERS & OPERATIONS RESEARCH, 2024, 166
[7] A SET COVERING FORMULATION OF THE MATRIX EQUIPARTITION PROBLEM
NICOLOSO, S
NOBILI, P
LECTURE NOTES IN CONTROL AND INFORMATION SCIENCES, 1992, 180 : 189 - 198
[8] Solving Set Covering Problem with Fireworks Explosion
Crawford, Broderick
Soto, Ricardo
Astudillo, Gonzalo
Olguin, Eduardo
Misra, Sanjay
COMPUTATIONAL SCIENCE AND ITS APPLICATIONS - ICCSA 2016, PT I, 2016, 9786 : 273 - 283
[9] A cultural algorithm for solving the set covering problem
Crawford, Broderick
Lagos, Carolina
Castro, Carlos
Paredes, Fernando
ANALYSIS AND DESIGN OF INTELLIGENT SYSTEMS USING SOFT COMPUTING TECHNIQUES, 2007, 41 : 408 - +
[10] Solving a fuzzy set-covering problem
Hwang, MJ
Chiang, CI
Liu, YH
MATHEMATICAL AND COMPUTER MODELLING, 2004, 40 (7-8) : 861 - 865

← 1 2 3 4 5 →