Examinando por Autor "Aballay, F."

Mostrando 1 - 1 de 1
  • Miniatura
    ÍtemAcceso Abierto
    A teaching-learning-based optimization algorithm for solving set covering problems
    (Springer Verlag, 2015) Crawford, B.; Soto, R.; Aballay, F.; Misra, S.; Johnson, F.; Paredes, F.
    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 we used a binary version of Teaching-Learning-Based Optimization (TLBO) algorithm to solve SCP, works with two phases known: teacher and learner; emulating the behavior into a classroom. The proposed algorithm has been tested on 65 benchmark instances. The results show that it has the ability to produce solutions competitively. © Springer International Publishing Switzerland 2015.