Facility Location Problem
Mostrando 1-11 de 11 artigos, teses e dissertações.
-
1. Hierarchical Facility Location Model for allocating cancer treatment units in interior of Rio de Janeiro
Abstract Paper aims This work aims at proposing a mathematical model for allocation of oncological treatment units of SUS. Originality A model of the same architecture was not found in the literature for the delimited problem. Research method The mathematical models of location in the literature were reviewed and based the choice by the two-level hierarch
Prod.. Publicado em: 04/11/2019
-
2. ALGORITMOS PRIMAIS E DUAIS PARA O PROBLEMA DAS P-MEDIANAS / PRIMAL AND DUAL ALGORITHMS FOR THE UNCAPACITED P-MEDIAN PROBLEM
A facility is any center that offers services to a set of clients. It may be, among others, a school, a factory or a depot. Facility location problems are combinatorial optimization problems that handle decisionmaking in respect to the positioning of those services, optimizing some defined criteria. The measures often used to assess the quality of a solution
Publicado em: 2009
-
3. Relaxações e método de decomposição para alguns problemas de localização de facilidades modelados em grafos / Relaxations and decomposition approach for some facility location problems modeled by graphs
Despite the great advances in computational equipment and the best known techniques for solving combinatorial optimization problems, it is not always possible to find the optimum solution to some practical facility location problems in a reasonable computational time, due to their size and classification issues. This thesis explores the representation of pro
IBICT - Instituto Brasileiro de Informação em Ciência e Tecnologia. Publicado em: 03/10/2008
-
4. Algoritmos para o problema de localizaÃÃo simples baseados nas formulaÃÃes clÃssica e canÃnica / Algorithms to the problem of location based on simple formulations classical and canonical
Neste trabalho, estudamos o problema de localizaÃÃo simples (SPLP - Simple Plant Location Problem). Usando a formulaÃÃo matemÃtica clÃssica e uma outra formulaÃÃo proposta recentemente, desenvolvemos vÃrios algoritmos para encontrar limites inferiores e superiores, bem como algoritmos tipo branch-and-bound. Com a formulaÃÃo clÃssica, tais limites
Publicado em: 2008
-
5. Algorithms for classification and partitioning in graphs / Algoritmos para problemas de classificação e particionamento em grafos
We present algorithms for combinatorial optimization NP-hard problems on classification and graph partitioning. The thesis concerns about theory and application and is guided by an approximation algorithms approach, complemented with heuristics and integer programming. We proposed good approximation factor algorithms as well as algorithms that find quality s
Publicado em: 2007
-
6. Uma aplicação do SIG para a localização e alocação de terminais logísticos em áreas urbanas congestionadas / An application of the SIG for the location and allocation of logistics terminals in congested urban areas
O presente trabalho a partir da caracterização da problemática dos transportes na área central de Uberlândia (MG), e com a utilização das ferramentas do software TransCAD (SIG-T), como problema de localização de instalações e roteirização de veículos, buscou-se propor uma alternativa que contribuísse para a distribuição urbana de cargas, pri
Publicado em: 2007
-
7. Busca Tabu aplicada ao problema de localização de facilidades com restrições de capacidade e fonte unica / Tabu search heuristic for the single source capacited facility location problem
Localização de facilidades é uma das atividades da área de logística que envolve decisões do número, localização e tamanho das facilidades a serem usadas. A localização de facilidades é uma questão central no planejamento estratégico de empresas públicas e privadas e está associada à variação da população em uma região, capital de inves
Publicado em: 2007
-
8. HEURÍSTICAS PARA O PROBLEMA DAS P-MEDIANAS CONECTADAS / HEURISTICS FOR THE CONNECTED P-MEDIAN PROBLEM
In this work, the connected p-median and the connected facility location problems are defined. Applications arise in regional planning, design of telecommunications and transportation networks. For the first problem, two integer linear programming formulations are proposed. Adaptations are made in one of these formulations and are used to model the second pr
Publicado em: 2006
-
9. Aproximação e compartilhamento de custos em projeto de redes / Approximation and cost-sharing in network design
We consider the interplay of two areas: combinatorial optimization and cost-sharing in network design problems. In the first, we are interested to find a solution with small cost. In the second we would like to share the solution cost between its users. We present algorithms for the problems Connected Facility Location and Rent-or-Buy . These two problems ar
Publicado em: 2006
-
10. Heuristic location-allocation for facilities location problems / Heurística de localizacão-alocacão para problemas de localizacão de facilidades
New location-allocation heuristic (LAH) algorithms applied in facility location problems are presented in this thesis. Such algorithms approach is based on clustering and its main objective is to find out a facility (object) in a space by minimizing a function. The LAH developed throughout this work was employed in two problems: the first problem is the Maxi
Publicado em: 2002
-
11. Facility location: a review of context-free and EMS models.
EMS location models are those formulated to address specific problems of emergency medical services systems; context-free location models are those developed without reference to particular applications. The literature on these two types of public facility location models is reviewed, and the development of the maximal covering model from several earlier con