We give a concentration inequality for stochastic version of the facility location problem. show objective Cn=minF?[0,1]2?|F|+?x?Xminf?F??x?f? is concentrated in an interval length O(n1/6) and E[Cn]=?(n2/3) if input X consists i.i.d. uniform points unit square. Our main tool to use geometric quantity, previously used design approximation algorithms problem, analyze martingale process. Many our ...

The capacitated mobile facility location problem (CMFLP) arises in logistics planning of community outreach programs delivered via mobile facilities. It adds capacity restrictions to the mobile facility location problem introduced previously by Demaine et al. [2009], thereby extending the problem to a practical setting. In the problem, one seeks to relocate (or move) a set of existing facilitie...

• Let L be a set of locations. • Let F ⊂ L be a set of potential facility locations. • Let C ⊂ L be a set of clients (cities). • Let c : L × L → R ∀i, j ∈ L be a distance function. Alternatively think of the function as describing the cost of assigning city j to facility i. • Let f : F → R ∀i ∈ F be a cost function describing the cost of opening a facility at i. • Let φ : C → F ∀j ∈ C be an ass...

This study presents an endeavor to determine an optimal solution for the obnoxious facility location problem. Obnoxious materials are those which may cause harm to the health of human beings and pollute the environment. The obnoxious material management is a significant environmental issue. Since the social economical growth encourages to establishment of industrialization. While the waste mate...

In this paper we propose the Online Connected Facility Location problem (OCFL), which is an online version of the Connected Facility Location problem (CFL). The CFL is a combination of the Uncapacitated Facility Location problem (FL) and the Steiner Tree problem (ST). We give a randomized O(log n)-competitive algorithm for the OCFL via the sample-and-augment framework of Gupta, Kumar, Pál, and ...

This work deals with a facility location problem in which location and allocation (transportation) policy is defined in two stages such that a first-stage solution should be robust against the possible realizations (scenarios) of the input data that can only be revealed in a second stage. This solution should be robust enough so that it can be recovered promptly and at low cost in the second st...

Three types of fuzzy random programming for capacitated location-allocation problem with fuzzy random demands are proposed according to different criteria, including the expected value model, chanceconstrained programming and dependent-chance programming. Finally, integrating the network simplex algorithm, fuzzy random simulation and genetic algorithm, a hybrid intelligent algorithm is produced...

We consider a generalization of the discrete Voronoi game, in which consumers with positive purchase power who are located on the vertices of a network wish to connect to the nearest facility. Knowing this, competitive players locate their facilities on vertices, trying to capture the largest possible market share. We study conditions that guarantee the existence of a pure strategy Nash equilib...

The p-facility Hu location problem aims at locating facilities on a competitive environment so as to maximize the market share. While it has been deeply studied in the eld of continuous location, in this paper we study the p-facility Hu location problem on networks formulated as a Mixed Integer Nonlinear Programming problem that can be solved by a branch and bound algorithm. We propose two appr...

In this paper, we present an approximation algorithm achieving approximation guarantee of 2 for the classical uncapacitated facility location problem. The distinguishing feature of our designed algorithm is the overall low running time of ( log ) O m m , where c f m n n = × , c n and f n are the number of cities and facilities. Though the approximation factor is 1.61 in Ref.[1], whereas the run...