Binarization functions for Shuffled Frog Leaping Algorithm can solve the Set Covering Problem [Funciones de binarización para el Algoritmo del Salto de la Rana que resuelve el Problema de Cobertura de Conjunto]

Conference Paper

Fecha

2015

Registro en:

https://hdl.handle.net/20.500.12728/4168

https://repositorioslatinoamericanos.uchile.cl/handle/2250/5145388

Autor

Crawford B.

Soto R.

Peña C.

Riquelme-Leiva M.

Torres-Rojas C.

Johnson F.

Paredes F.

Institución

Universidad Autónoma de Chile

Materias

Set Covering Problem

Shuffled Frog Leaping Algorithm

Discrete event simulation

Information systems

Binary representations

Discretization method

Meta heuristics

Optimization problems

Set covering problem

Shuffled frog leaping algorithm (SFLA)

Social behavior

Problem solving

Mostrar el registro completo del ítem