Abordagens heurísticas aplicadas ao Problema da Alocação Dinâmica de Espaços.

• Ano de defesa: 2013
• Autor(a) principal: Costa, Wagner Silva
• Tipo de documento: Dissertação
• Tipo de acesso: Acesso aberto
• Idioma: por
• Instituição de defesa: Universidade Federal da Paraí­ba; BR; Informática; Programa de Pós Graduação em Informática; UFPB
• Palavras-chave em Português: Ciência da computação; Modelagem em programa linear inteira; Grafos de dependências; General Responsibility Assignment Software Pattens - GRASP; modeling in integer linear programming; dependency graphs; issue of resource allocation; GRASP; CNPQ::CIENCIAS EXATAS E DA TERRA::CIENCIA DA COMPUTACAO
• Link de acesso: https://repositorio.ufpb.br/jspui/handle/tede/6082

The Dynamic Allocation Problem Spaces (DSAP) is recent literature, and was inspired by the need to minimize the distances between requested resources for the execution of activities in nuclear power plants. There are similarities of the problem with projects in which the movement of resources generates costs for the final planning, or in cases where congestion of these resources is not advisable, as in large buildings or works in mining. It is necessary, the use of these approximation methods considered to be NP hard. For this, a new constructive heuristic is proposed using integer linear programming model based on activity streams that incorporate information from the graph of dependencies between activities, and then an application of the hybrid GRASP meta-heuristic is discussed. The computational results show that this approach is able to obtain high-quality solutions.