A GRASP Algorithm for the Connected Facility Location Problem

Alessandro Tomazic; I. Lubic

A GRASP Algorithm for the Connected Facility Location Problem

Alessandro Tomazic
, I. Lubic

Institute for Statistics and Mathematics

Publication: Chapter in book/Conference proceeding › Contribution to conference proceedings

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.

Original language	English
Title of host publication	International Symposium on Applications and the Internet. SAINT 2008.
Editors	IEEE
Place of Publication	Turku
Pages	257 - 260
Publication status	Published - 1 Nov 2008

Cite this

@inproceedings{e82145107bcf48398f458fc7e81406f6,

title = "A GRASP Algorithm for the Connected Facility Location Problem",

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.",

author = "Alessandro Tomazic and I. Lubic",

year = "2008",

month = nov,

day = "1",

language = "English",

isbn = "978-0-7695-3297-",

pages = "257 -- 260",

editor = "IEEE",

booktitle = "International Symposium on Applications and the Internet. SAINT 2008.",

}

TY - GEN

T1 - A GRASP Algorithm for the Connected Facility Location Problem

AU - Tomazic, Alessandro

AU - Lubic, I.

PY - 2008/11/1

Y1 - 2008/11/1

N2 - 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.

AB - 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.

M3 - Contribution to conference proceedings

SN - 978-0-7695-3297-

SP - 257

EP - 260

BT - International Symposium on Applications and the Internet. SAINT 2008.

A2 - IEEE, null

CY - Turku

ER -