Improved Local Search for Universal Facility Location
نویسندگان
چکیده
We consider the universal facility location problem in which the goal is to assign clients to facilities in order to minimize the sum of connection and facility costs. The connection cost is proportional to the distance each client has to travel to its assigned facility, whereas the cost of a facility is a non-decreasing function depending on the number of clients assigned to the facility. This model generalizes several variants of facility location problems. We present a (5.83 + ) approximation algorithm for this problem based on local search technique.
منابع مشابه
From stars to comets: Improved local search for universal facility location
We improve the approximation ratio for the Universal Facility Location Problem to 6.702 by a local search algorithm with an extended pivot operation. 1 The Universal Facility Location Problem Many approximation algorithms for various facility location problems have been proposed recently. See Vygen [2005] for a survey. A quite general problem, generalizing many others considered previously, has...
متن کاملA Multiexchange Local Search Algorithm for the Capacitated Facility Location Problem
We present a multiexchange local search algorithm for approximating the capacitated facility location problem (CFLP), where a new local improvement operation is introduced that possibly exchanges multiple facilities simultaneously. We give a tight analysis for our algorithm and show that the performance guarantee of the algorithm is between 3+ 2√2− and 3+ 2√2+ for any given constant > 0. The pr...
متن کاملUniversal Facility Location
In the Universal Facility Location problem we are given a set of demand points and a set of facilities. The goal is to assign the demands to facilities in such a way that the sum of service and facility costs is minimized. The service cost is proportional to the distance each unit of demand has to travel to its assigned facility, whereas the facility cost of each facility i depends on the amoun...
متن کاملA Simulated Annealing Algorithm within the Variable Neighbourhood Search Framework to Solve the Capacitated Facility Location-Allocation Problem
In this study, we discuss the capacitated facility location-allocation problem with uncertain parameters in which the uncertainty is characterized by given finite numbers of scenarios. In this model, the objective function minimizes the total expected costs of transportation and opening facilities subject to the robustness constraint. To tackle the problem efficiently and effectively, an effici...
متن کاملSolving the competitive facility location problem considering the reactions of competitor with a hybrid algorithm including Tabu Search and exact method
In this paper, a leader–follower competitive facility location problem considering the reactions of the competitors is studied. A model for locating new facilities and determining levels of quality for the facilities of the leader firm is proposed. Moreover, changes in the location and quality of existing facilities in a competitive market where a competitor offers the same goods or services ar...
متن کامل