loading...
A GRASP Algorithm for the Connected Facility Location Problem
July 28-August 01
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/SAINT.2008.642008 International Symposium on Appli ...
 This Article 
 
PDF
HTML
 
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
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.
Index Terms:
GRASP, Connected Facility Location
Citation:
Alessandro Tomazic, Ivana Ljubic, "A GRASP Algorithm for the Connected Facility Location Problem," saint, pp.257-260, 2008 International Symposium on Applications and the Internet, 2008
Usage of this product signifies your acceptance of the Terms of Use.