Sistema de localização de facilidades: uma abordagem para mensuração de pontos de demanda e localização de facilidades

• Ano de defesa: 2012
• Autor(a) principal: Oliveira, Max Gontijo de
• Orientador(a): Carvalho, Cedric Luiz de
• Banca de defesa: Carvalho, Cedric Luiz de, Soares, Telma Woerle de Lima, Rodrigues, Cássio Leonardo, Alves, Antônio César Baleeiro
• Tipo de documento: Dissertação
• Tipo de acesso: Acesso aberto
• Idioma: por
• Instituição de defesa: Universidade Federal de Goiás
• Programa de Pós-Graduação: Programa de Pós-graduação em Ciência da Computação (INF)
• Departamento: Instituto de Informática - INF (RG)
• País: Brasil
• Palavras-chave em Português: Localização de facilidades; Algoritmos de cluster; K-means
• Palavras-chave em Inglês: Facility location; Clustering algorithms; K-means
• Área do conhecimento CNPq: CIENCIA DA COMPUTACAO::SISTEMAS DE COMPUTACAO
• Link de acesso: http://repositorio.bc.ufg.br/tede/handle/tede/5512

Several organizations need to solve the problem of locate and allocate facilities within a geographic area. There are location/allocation problems in various situations, like the distribution of police cars, ambulances, taxi drivers, bus stops among other numerous situations where the location of such facilities is strategic for organization. In location/allocation problems, usually is necessary allocate each demand point to the closest facility. So, each facility will be located in the center of demand points, considering the demand as weight. However, the majority of the real location problems have capacity constraint. Therefore, each facility has a certain capacity based on the type of demand. Facility location problems can be continuous or discrete. In continuous problems (also called Weber problem with multiple sources), any point in the plane is a potential site for the instalation of the facility. There are several approaches for working with continuous models. Furthermore, there are many others works approaches presenting models with capacity constraint. But most of these approaches turns the continous model to a discrete model. The objective of this work thesis is to present an approach to distribution of facilities in instances of the capacitated facility location problem. A case study will be presented with the purpose of evaluating the results.