11,579 research outputs found
Joint Facility and Demand Location Problem
In typical applications of facility location problems, the location of demand
is assumed to be an input to the problem. The demand may be fixed or dynamic,
but ultimately outside the optimizers control. In contrast, there are settings,
especially in humanitarian contexts, in which the optimizer decides where to
locate a demand node. In this work, we introduce an optimization framework for
joint facility and demand location. As examples of our general framework, we
extend the well-known k-median and k-center problems into joint facility and
demand location problems (JFDLP) and formulate them as integer programs. We
propose a local search heuristic based on network flow. We apply our heuristic
to a hurricane evacuation response case study. Our results demonstrate the
challenging nature of these simultaneous optimization problems, especially when
there are many potential locations. The local search heuristic is most
promising when the the number of potential locations is large, while the number
of facility and demand nodes to be located is small.Comment: 20 pages, 7 figure
Recommended from our members
Improvements and comparison of heuristics for solving the uncapacitated multisource Weber problem
Copyright @ 2000 INFORMSThe multisource Weber problem is to locate simultaneously m facilities in the Euclidean plane to minimize the total transportation cost for satisfying the demand of n fixed users, each supplied from its closest facility. Many heuristics have been proposed for this problem, as well as a few exact algorithms. Heuristics are needed to solve quickly large problems and to provide good initial solutions for exact algorithms. We compare various heuristics, i.e., alternative location-allocation (Cooper 1964), projection (Bongartz et al. 1994), Tabu search (Brimberg and Mladenovic 1996a), p-Median plus Weber (Hansen ct al. 1996), Genetic search and several versions of Variable Neighbourhood search. Based on empirical tests that are reported, it is found that most traditional and some recent heuristics give poor results when the number of facilities to locate is large and that Variable Neighbourhood search gives consistently best results, on average, in moderate computing time.This study was supported by the Department
of National Defence (Canada) Academic Research; Office of Naval Research Grant N00014-92-J-1194, Natural Sciences and Engineering Research Council of Canada Grant GPO 105574 and Fonds pour la Formation des Chercheurs et l’Aide a la Recherche Grant 32EQ 1048; and by an International Postdoctoral Fellowship of the Natural Sciences and Engineering Research Council
of Canada, Grant OGPOO 39682
Algorithms For Clustering Problems:Theoretical Guarantees and Empirical Evaluations
Clustering is a classic topic in combinatorial optimization and plays a central role in many areas, including data science and machine learning. In this thesis, we first focus on the dynamic facility location problem (i.e., the facility location problem in evolving metrics). We present a new LP-rounding algorithm for facility location problems, which yields the first constant factor approximation algorithm for the dynamic facility location problem. Our algorithm installs competing exponential clocks on clients and facilities, and connects every client by the path that repeatedly follows the smallest clock in the neighborhood. The use of exponential clocks gives rise to several properties that distinguish our approach from previous LP-roundings for facility location problems. In particular, we use \emph{no clustering} and we enable clients to connect through paths of \emph{arbitrary lengths}. In fact, the clustering-free nature of our algorithm is crucial for applying our LP-rounding approach to the dynamic problem.
Furthermore, we present both empirical and theoretical aspects of the -means problem. The best known algorithm for -means with a provable guarantee is a simple local-search heuristic that yields an approximation guarantee of , a ratio that is known to be tight with respect to such methods. We overcome this barrier by presenting a new primal-dual approach that enables us (1) to exploit the geometric structure of -means and (2) to satisfy the hard constraint that at most clusters are selected without deteriorating the approximation guarantee. Our main result is a -approximation algorithm with respect to the standard LP relaxation. Our techniques are quite general and we also show improved guarantees for the general version of -means where the underlying metric is not required to be Euclidean and for -median in Euclidean metrics.
We also improve the running time of our algorithm to almost linear running time and still maintain a provable guarantee. We compare our algorithm with {\sc K-Means++} (a widely studied algorithm) and show that we obtain better accuracy with comparable and even better running time
Tight Analysis of a Multiple-Swap Heuristic for Budgeted Red-Blue Median
Budgeted Red-Blue Median is a generalization of classic -Median in that
there are two sets of facilities, say and , that can
be used to serve clients located in some metric space. The goal is to open
facilities in and facilities in for
some given bounds and connect each client to their nearest open
facility in a way that minimizes the total connection cost.
We extend work by Hajiaghayi, Khandekar, and Kortsarz [2012] and show that a
multiple-swap local search heuristic can be used to obtain a
-approximation for Budgeted Red-Blue Median for any constant
. This is an improvement over their single swap analysis and
beats the previous best approximation guarantee of 8 by Swamy [2014].
We also present a matching lower bound showing that for every ,
there are instances of Budgeted Red-Blue Median with local optimum solutions
for the -swap heuristic whose cost is
times the optimum solution cost. Thus, our analysis is tight up to the lower
order terms. In particular, for any we show the single-swap
heuristic admits local optima whose cost can be as bad as times
the optimum solution cost
Approximation Algorithms for Minimum-Load k-Facility Location
We consider a facility-location problem that abstracts settings where the cost of serving the clients assigned to a facility is incurred by the facility. Formally, we consider the minimum-load k-facility location (MLkFL) problem, which is defined as follows. We have a set F of facilities, a set C of clients, and an integer k > 0. Assigning client j to a facility f incurs a connection cost d(f, j). The goal is to open a set F\u27 of k facilities, and assign each client j to a facility f(j) in F\u27 so as to minimize maximum, over all facilities in F\u27, of the sum of distances of clients j assigned to F\u27 to F\u27. We call
this sum the load of facility f. This problem was studied under the name of min-max star cover in [6, 2], who (among other results) gave bicriteria approximation algorithms for MLkFL for when F = C. MLkFL is rather poorly understood, and only an O(k)-approximation is currently known for MLkFL, even for line metrics. Our main result is the first polynomial time approximation scheme (PTAS) for MLkFL on line metrics (note that no non-trivial true approximation of any kind was known for this metric). Complementing this, we prove that MLkFL is strongly NP-hard on line metrics. We also devise a quasi-PTAS for MLkFL on tree metrics. MLkFL turns out to be surprisingly challenging even on line metrics, and resilient to attack by the variety of techniques that have been successfully applied to facility-location problems. For instance, we show that: (a) even a configuration-style LP-relaxation has a bad integrality gap; and (b) a multi-swap k-median style local-search heuristic has a bad locality gap. Thus, we need to devise various novel techniques to attack MLkFL. Our PTAS for line metrics consists of two main ingredients. First, we prove that there always exists a near-optimal solution possessing some nice structural properties. A novel aspect of this proof is that we first move to a mixed-integer LP (MILP) encoding the problem, and argue that a MILP-solution minimizing a certain potential function possesses the desired structure, and then use a rounding algorithm for the generalized-assignment problem to "transfer" this structure to the rounded integer solution. Complementing this, we show that these structural properties enable one to find such a structured solution via dynamic programming
Lotsize optimization leading to a -median problem with cardinalities
We consider the problem of approximating the branch and size dependent demand
of a fashion discounter with many branches by a distributing process being
based on the branch delivery restricted to integral multiples of lots from a
small set of available lot-types. We propose a formalized model which arises
from a practical cooperation with an industry partner. Besides an integer
linear programming formulation and a primal heuristic for this problem we also
consider a more abstract version which we relate to several other classical
optimization problems like the p-median problem, the facility location problem
or the matching problem.Comment: 14 page
Recommended from our members
Primal-dual variable neighborhood search for the simple plant-location problem
Copyright @ 2007 INFORMSThe variable neighborhood search metaheuristic is applied to the primal simple plant-location problem and to a reduced dual obtained by exploiting the complementary slackness conditions. This leads to (i) heuristic resolution of (metric) instances with uniform fixed costs, up to n = 15,000 users, and m = n potential locations for facilities with an error not exceeding 0.04%; (ii) exact solution of such instances with up to m = n = 7,000; and (iii) exact solutions of instances with variable fixed costs and up to m = n = 15, 000.This work is supported by NSERC Grant 105574-02; NSERC Grant OGP205041; and partly by the Serbian Ministry of Science, Project 1583
New Approximability Results for the Robust k-Median Problem
We consider a robust variant of the classical -median problem, introduced
by Anthony et al. \cite{AnthonyGGN10}. In the \emph{Robust -Median problem},
we are given an -vertex metric space and client sets . The objective is to open a set of
facilities such that the worst case connection cost over all client sets is
minimized; in other words, minimize . Anthony
et al.\ showed an approximation algorithm for any metric and
APX-hardness even in the case of uniform metric. In this paper, we show that
their algorithm is nearly tight by providing
approximation hardness, unless . This hardness result holds even for uniform and line
metrics. To our knowledge, this is one of the rare cases in which a problem on
a line metric is hard to approximate to within logarithmic factor. We
complement the hardness result by an experimental evaluation of different
heuristics that shows that very simple heuristics achieve good approximations
for realistic classes of instances.Comment: 19 page
A regret model applied to the facility location problem with limited capacity facilities
This article addresses issues related to location and allocation problems. Herein, we intend to demonstrate the influence of congestion, through the random number generation, of such systems in final solutions. An algorithm is presented which, in addition to the GRASP, incorporates the Regret with the pminmax method to evaluate the heuristic solution obtained with regard to its robustness for different scenarios. Taking as our point of departure the Facility Location Problem proposed by Balinski [27], an alternative perspective is added associating regret values to particular solutions.N/
- …