An effective heuristic for large-scale capacitated facility location problems

Authors:
Pasquale Avella;Maurizio Boccia;Antonio Sforza;Igor Vasil'Ev
Affiliations:
RCOST--Research Center on Software Technology, Università del Sannio, Benevento, Italy 82100;RCOST--Research Center on Software Technology, Università del Sannio, Benevento, Italy 82100;Dipartimento di Informatica e Sistemistica, Università degli Studi di Napoli "Federico II", Napoli, Italy 80125;Institute of System Dynamics and Control Theory, Siberian Branch of Russian Academy of Sciences, Irkutsk, Russia 664033
Venue:
Journal of Heuristics
Year:
2009

Citing 4
Cited 5

Capacitated facility location: valid inequalities and facets

Mathematics of Operations Research
Algorithms for railway crew management

Mathematical Programming: Series A and B - Special issue: papers from ismp97, the 16th international symposium on mathematical programming, Lausanne EPFL
Capacitated facility location: separation algorithms and computational experience

Mathematical Programming: Series A and B - Special issue on computational integer programming
Analysis of a Local Search Heuristic for Facility Location Problems

Analysis of a Local Search Heuristic for Facility Location Problems

Capacitated clustering problem in computational biology: Combinatorial and statistical approach for sibling reconstruction

Computers and Operations Research
A Lagrangian relaxation approach for a large scale new variant of capacitated clustering problem

Computers and Industrial Engineering
An aggregation heuristic for large scale p-median problem

Computers and Operations Research
A computational study of a nonlinear minsum facility location problem

Computers and Operations Research
Kernel search for the capacitated facility location problem

Journal of Heuristics

Quantified Score

Hi-index	0.00

Visualization

Abstract

The Capacitated Facility Location Problem (CFLP) consists of locating a set of facilities with capacity constraints to satisfy the demands of a set of clients at the minimum cost. In this paper we propose a simple and effective heuristic for large-scale instances of CFLP. The heuristic is based on a Lagrangean relaxation which is used to select a subset of "promising" variables forming the core problem and on a Branch-and-Cut algorithm that solves the core problem. Computational results on very large scale instances (up to 4 million variables) are reported.