Por favor, use este identificador para citar o enlazar este ítem:
http://repositorio.ufc.br/handle/riufc/12633| Tipo: | Artigo de Evento |
| Título : | A Binary particle swarm optimization algorithm for a variant of the maximum covering problem |
| Autor : | Prata, Bruno de Athayde Sousa, Jorge Pinho de Dias, Teresa Galvão |
| Palabras clave : | Heurística;Otimização |
| Fecha de publicación : | 2009 |
| Editorial : | European Meeting of Metaheuristics |
| Citación : | 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 |
| Aparece en las colecciones: | GESLOG - Trabalhos apresentados em eventos |
Ficheros en este ítem:
| Fichero | Descripción | Tamaño | Formato | |
|---|---|---|---|---|
| 2009_eve_baprata.pdf | 127,97 kB | Adobe PDF | Visualizar/Abrir |
Los ítems de DSpace están protegidos por copyright, con todos los derechos reservados, a menos que se indique lo contrario.