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

• Autor(a) principal: Oliveira, Max Gontijo de
• Data de Publicação: 2012
• Tipo de documento: Dissertação
• Idioma: por
• Título da fonte: Repositório Institucional da UFG
• Texto Completo: http://repositorio.bc.ufg.br/tede/handle/tede/5512
• topic: Localização de facilidades; Algoritmos de cluster; K-means; Facility location; Clustering algorithms; K-means; CIENCIA DA COMPUTACAO::SISTEMAS DE COMPUTACAO

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.