Lagrangean Relaxation with Clusters for the Uncapacitated Facility Location Problem
نویسندگان
چکیده
A good strategy for the solution of a large-scale problem is its division into small ones. In this context, this work explores the lagrangean relaxation with clusters (LagClus) that can be applied to combinatorial problems modeled by conflict graphs. By partitioning and removing the edges that connect the clusters of vertices, the conflict graph is divided in subgraphs with the same characteristics of the whole problem. When relaxing the removed edges in the lagrangean way, subproblems are solved and better limits than the traditional lagrangean relaxation are obtained. This work applies the LagClus to the Uncapacitated Facility Location Problem (UFLP).
منابع مشابه
Approximate k-MSTs and k-Steiner Trees via the Primal-Dual Method and Lagrangean Relaxation
Garg [10] gives two approximation algorithms for the minimum-cost tree spanning k vertices in an undirected graph. Recently Jain and Vazirani [15] discovered primal-dual approximation algorithms for the metric uncapacitated facility location and k-median problems. In this paper we show how Garg’s algorithms can be explained simply with ideas introduced by Jain and Vazirani, in particular via a ...
متن کاملCuckoo search via Levy flights applied to uncapacitated facility location problem
Facility location problem (FLP) is a mathematical way to optimally locate facilities within a set of candidates to satisfy the requirements of a given set of clients. This study addressed the uncapacitated FLP as it assures that the capacity of every selected facility is finite. Thus, even if the demand is not known, which often is the case, in reality, organizations may still be able to take s...
متن کاملThe Dynamic Uncapacitated Hub Location Problem
This paper presents a dynamic (or multi-period) hub location problem. It proposes a branch-and-bound algorithm that uses a Lagrangean relaxation to obtain lower and upper bounds at the nodes of the tree. The Lagrangean function exploits the structure of the problem and can be decomposed into smaller subproblems which can be solved efficiently. In addition, some reduction procedures based on the...
متن کاملLower Bounding Procedures for the Single Allocation Hub Location Problem
This paper proposes a new lower bounding procedure for the Uncapacitated Single Allocation p-Hub Median Problem based on Lagrangean relaxation. For solving the resulting Lagrangean subproblem, the given problem structure is exploited: it can be decomposed into smaller subproblems that can be solved efficiently by combinatorial algorithms. Our computational experiments for some benchmark instanc...
متن کاملComparison of formulations for the two-level uncapacitated facility location problem with single assignment constraints
We consider the two-level uncapacitated facility location problem with single assignment constraints (TUFLP-S), an extension of the uncapacitated facility location problem. We present six mixed-integer programming models for the TUFLP-S based on reformulation techniques and on the relaxation of the integrality of some of the variables associated with location decisions. We compare the models by...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2006