Cat swarm optimization with different binarization methods for solving set covering problems
| dc.contributor.author | Crawford, B. | es_ES |
| dc.contributor.author | Soto, R. | es_ES |
| dc.contributor.author | Berrios N. | es_ES |
| dc.contributor.author | Olguín, E. | es_ES |
| dc.date.accessioned | 6/22/2022 14:20 | |
| dc.date.accessioned | 2022-06-22T20:03:33Z | |
| dc.date.available | 6/22/2022 14:20 | |
| dc.date.available | 2022-06-22T20:03:33Z | |
| dc.date.issued | 2016 | |
| dc.description.abstract | In this paper, we present a Binary cat swarm optimization for solving the Set covering problem. The Set covering problem is a well-known NP-hard problem with many practical applications, including those involving scheduling, production planning and location problems. Binary cat swarm optimization is a recent swarm metaheuristic technique based on the behaviour of discrete cats. Domestic cats show the ability to hunt and are curious about moving objects. The cats have two modes of behavior: seeking mode and tracing mode. Moreover, eight different transfer functions and five discretization techniques are considered for solving the binary problem. We illustrate this approach with 65 instances of the problem and select the best transfer function and discretization technique to solve this problem. © Springer International Publishing Switzerland 2016. | es_ES |
| dc.format | application/pdf | es_ES |
| dc.identifier.doi | 10.1007/978-3-319-33625-1_46 | es_ES |
| dc.identifier.uri | https://doi.org/10.1007/978-3-319-33625-1_46 | |
| dc.language.iso | en_US | es_ES |
| dc.publisher | Springer Verlag | es_ES |
| dc.publisher.country | DE | es_ES |
| dc.relation.ispartof | Advances in Intelligent Systems and Computing | es_ES |
| dc.rights | info:eu-repo/semantics/closedAccess | es_ES |
| dc.source | Advances in Intelligent Systems and Computing | es_ES |
| dc.subject | Computer Science | es_ES |
| dc.subject | Engineering | es_ES |
| dc.subject.ocde | http://purl.org/pe-repo/ocde/ford#2.02.04 | es_ES |
| dc.title | Cat swarm optimization with different binarization methods for solving set covering problems | es_ES |
| dc.type | info:eu-repo/semantics/conferenceObject | es_ES |
| dc.type.version | info:eu-repo/semantics/publishedVersion | es_ES |
Archivos
Bloque original
1 - 1 de 1
Cargando...
- Nombre:
- 31. Cat swarm optimization with different binarization methods for solving set covering problems.pdf
- Tamaño:
- 167.8 KB
- Formato:
- Adobe Portable Document Format