Please use this identifier to cite or link to this item:
http://repositorio.ufc.br/handle/riufc/12633| Type: | Artigo de Evento |
| Title: | A Binary particle swarm optimization algorithm for a variant of the maximum covering problem |
| Authors: | Prata, Bruno de Athayde Sousa, Jorge Pinho de Dias, Teresa Galvão |
| Keywords: | Heurística;Otimização |
| Issue Date: | 2009 |
| Publisher: | European Meeting of Metaheuristics |
| Citation: | PRATA, B. A. ; SOUSA, J. P. ; DIAS, T. G. A Binary particle swarm optimization algorithm for a variant of the maximum covering problem. In: EUROPEAN MEETING OF METAHEURISTICS, 2009, Porto. Anais... Porto: 2009. p. 1-7. |
| Abstract: | The Maximum Covering Problem (MCP) is a widely studied Combinatorial Optimization problem, with several applications, such as facility location (including health centers, emergency vehicles and commercial bank branches) and scheduling ( exible manufacturing systems, mass transit services, telecommunications)[1], [3], [4]. Practical instances of the problem are in general quite di cult to solve. Thus, approximate heuristic methods are used to achieve satisfactory solutions in acceptable computational times |
| URI: | http://www.repositorio.ufc.br/handle/riufc/12633 |
| Appears in Collections: | GESLOG - Trabalhos apresentados em eventos |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| 2009_eve_baprata.pdf | 127,97 kB | Adobe PDF | View/Open |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.