A GRASP Algorithm for the Connected Facility Location Problem

Authors:
Alessandro Tomazic;Ivana Ljubic
Affiliations:
-;-
Venue:
SAINT '08 Proceedings of the 2008 International Symposium on Applications and the Internet
Year:
2008

Citing 0
Cited 5

Dual-Based Local Search for the Connected Facility Location and Related Problems

INFORMS Journal on Computing
Branch-and-Cut-and-Price for Capacitated Connected Facility Location

Journal of Mathematical Modelling and Algorithms
MIP modeling of incremental connected facility location

INOC'11 Proceedings of the 5th international conference on Network optimization
Variable neighborhood and greedy randomized adaptive search for capacitated connected facility location

EUROCAST'11 Proceedings of the 13th international conference on Computer Aided Systems Theory - Volume Part I
Layered Graph Approaches to the Hop Constrained Connected Facility Location Problem

INFORMS Journal on Computing

Quantified Score

Hi-index	0.00

Visualization

Abstract

We apply a Greedy Randomized Adaptive Search Procedure (GRASP) to solve the Connected Facility Location Problem heuristically. Diversification property is assured by applying a randomized greedy algorithm to construct feasible solutions in a multi-start fashion. Intensification elements are guaranteed due to two facility-based local search techniques. The computational study is conducted on a parameterized set of randomly generated benchmark instances. The obtained results reflect the quality of the proposed approach with respect to both, the quality of solutions and the computational effort, by comparison with lower bounds obtained from a Branch-and-Cut framework.