A Binary particle swarm optimization algorithm for a variant of the maximum covering problem

Use este identificador para citar ou linkar para este item: http://repositorio.ufc.br/handle/riufc/12633

Registro completo de metadados

Campo DC	Valor	Idioma
dc.contributor.author	Prata, Bruno de Athayde	-
dc.contributor.author	Sousa, Jorge Pinho de	-
dc.contributor.author	Dias, Teresa Galvão	-
dc.date.accessioned	2015-06-05T15:36:45Z	-
dc.date.available	2015-06-05T15:36:45Z	-
dc.date.issued	2009	-
dc.identifier.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.	pt_BR
dc.identifier.uri	http://www.repositorio.ufc.br/handle/riufc/12633	-
dc.description.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	pt_BR
dc.language.iso	en	pt_BR
dc.publisher	European Meeting of Metaheuristics	pt_BR
dc.subject	Heurística	pt_BR
dc.subject	Otimização	pt_BR
dc.title	A Binary particle swarm optimization algorithm for a variant of the maximum covering problem	pt_BR
dc.type	Artigo de Evento	pt_BR
Aparece nas coleções:	GESLOG - Trabalhos apresentados em eventos

Arquivos associados a este item:

Arquivo	Descrição	Tamanho	Formato
2009_eve_baprata.pdf		127,97 kB	Adobe PDF	Visualizar/Abrir