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.
| Originalsprache | Englisch |
|---|---|
| Titel des Sammelwerks | International Symposium on Applications and the Internet. SAINT 2008. |
| Herausgeber*innen | IEEE |
| Erscheinungsort | Turku |
| Seiten | 257 - 260 |
| Publikationsstatus | Veröffentlicht - 1 Nov. 2008 |