The Set Covering Problem Solved by the Binary Teaching-learning-based Optimization Algorithm

被引：0

作者：

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

Soto, Ricardo ^{[1
,7
]}

Aballay Leiva, Felipe ^{[1
,4
]}

Johnson, Franklin ^{[1
,5
]}

Paredes, Fernando ^{[6
]}

机构：

[1] Pontificia Univ Catolica Valparaiso, Valparaiso, Chile

[2] Univ San Sebastian, Santiago, Chile

[3] Univ Cent Chile, Santiago, Chile

[4] Univ Autonoma Chile, Santiago, Chile

[5] Univ Playa Ancha, Valparaiso, Chile

[6] Univ Diego Portales, Santiago, Chile

[7] Univ Cient Sur, Lima, Peru

来源：

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

关键词：

Set Covering Problem; Binary Teaching-learning-based optimization algorithm (BTLBO); Optimization Problem; Metaheuristic;

D O I：

暂无

中图分类号：

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

学科分类号：

0812 ;

摘要：

The Set Covering Problem (SCP) is a representation of a kind of combinatorial optimization problem which has been applied in several problems in the real world. In this work is used the binary version of Teaching-Learning-Based Optimization algorithm (TLBO), which works with two phases known as teacher and learner phases in this way emulates the behaviour into a classroom, besides this problem is solved with eight different transfer functions and five discretization methods all of them altogether to solve The Set Covering Problem from the OR-Library.

引用

页数：4

共 8 条

[1]

[Anonymous], 1990, GUIDE THEORY NP COMP

[2]

BALAS E, 1980, MATH PROGRAM STUD, V12, P37, DOI 10.1007/BFb0120886

[3] A genetic algorithm for the set covering problem [J].