Using binary Fruit Fly algorithm for solving the Set Covering Problem

被引：0

作者：

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

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

Torres-Rojas, Claudio ^{[1
]}

Pena, Cristian ^{[1
]}

Riquelme-Leiva, Marco ^{[1
]}

Johnson, Franklin ^{[1
,6
]}

Paredes, Fernando ^{[7
]}

机构：

[1] Pontificia Univ Catolica Valparaiso, Valparaiso, Chile

[2] Univ Finis Terrae, Santiago, Chile

[3] Univ San Sebastian, Santiago, Chile

[4] Univ Autonoma Chile, Santiago, Chile

[5] Univ Cent Chile, Santiago, Chile

[6] Univ Playa Ancha, Valparaiso, Chile

[7] Univ Diego Portales, Santiago, Chile

来源：

2015 10TH IBERIAN CONFERENCE ON INFORMATION SYSTEMS AND TECHNOLOGIES (CISTI) | 2015年

关键词：

fruit fly optimization algorithm; set covering problem; transfer functions; metaheuristics; REGRESSION NEURAL-NETWORK; OPTIMIZATION ALGORITHM; MODEL;

D O I：

暂无

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Many practical applications are used in set covering problems (SCP), in this research, we used to solve SCP: the binary Fruit Fly Optimization algorithms. This algorithm is divided in four phases: initiation, smell based search local vision based search and global vision based search. The metaheuristic is based by the knowledge from the foraging behavior of fruit-flies in finding food. The algorithm used a probability vector to improve the exploration. The tests were performed with eight different transfer functions and an elitist selection method. The test results show the effectiveness of the algorithm proposed.

引用

页数：4

共 50 条

[41] A genetic algorithm for the set covering problem
AlSultan, KS
Hussain, MF
Nizami, JS
JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, 1996, 47 (05) : 702 - 709
[42] Binary Bat Algorithms for the Set Covering Problem
Crawford, Broderick
Soto, Ricardo
Olea, Claudia
Johnson, Franklin
Paredes, Fernando
2015 10TH IBERIAN CONFERENCE ON INFORMATION SYSTEMS AND TECHNOLOGIES (CISTI), 2015,
[43] Solving the blocking flow shop scheduling problem with makespan using a modified fruit fly optimisation algorithm
Han, Yuyan
Gong, Dunwei
Li, Junqing
Zhang, Yong
INTERNATIONAL JOURNAL OF PRODUCTION RESEARCH, 2016, 54 (22) : 6782 - 6797
[44] A restart local search algorithm for solving maximum set k-covering problem
Yiyuan Wang
Dantong Ouyang
Minghao Yin
Liming Zhang
Yonggang Zhang
Neural Computing and Applications, 2018, 29 : 755 - 765
[45] A restart local search algorithm for solving maximum set k-covering problem
Wang, Yiyuan
Ouyang, Dantong
Yin, Minghao
Zhang, Liming
Zhang, Yonggang
NEURAL COMPUTING & APPLICATIONS, 2018, 29 (10): : 755 - 765
[46] Solving the Set Covering Problem Using Cat Swarm Optimization Algorithm with a Variable Mixture Rate and Population Restart
Crawford, Broderick
Soto, Ricardo
Caballero, Hugo
APPLIED COMPUTATIONAL INTELLIGENCE AND MATHEMATICAL METHODS: COMPUTATIONAL METHODS IN SYSTEMS AND SOFTWARE 2017, VOL. 2, 2018, 662 : 156 - 166
[47] Solving the thoracic inverse problem in the fruit fly
Pons, Arion
Perl, Illy
Ben-Dov, Omri
Maya, Roni
Beatus, Tsevi
BIOINSPIRATION & BIOMIMETICS, 2023, 18 (04)
[48] EVOLVING SUPPORT VECTOR MACHINE USING MODIFIED FRUIT FLY OPTIMIZATION ALGORITHM AND GENETIC ALGORITHM FOR BINARY CLASSIFICATION PROBLEM
Ye, Fei
Lou, Xin-Yuan
Han, Min
2016 13TH INTERNATIONAL COMPUTER CONFERENCE ON WAVELET ACTIVE MEDIA TECHNOLOGY AND INFORMATION PROCESSING (ICCWAMTIP), 2016, : 38 - 46
[49] The Set Covering Problem Solved by the Binary Teaching-learning-based Optimization Algorithm
Crawford, Broderick
Soto, Ricardo
Aballay Leiva, Felipe
Johnson, Franklin
Paredes, Fernando
2015 10TH IBERIAN CONFERENCE ON INFORMATION SYSTEMS AND TECHNOLOGIES (CISTI), 2015,
[50] A Binary Multi-Verse Optimizer Algorithm applied to the Set Covering problem.
Valenzuela, Matias
Pena, Alvaro
Lopez, Luis
Pinto, Hernan
2017 4TH INTERNATIONAL CONFERENCE ON SYSTEMS AND INFORMATICS (ICSAI), 2017, : 513 - 518

← 1 2 3 4 5 →