Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem

Authors:
Markus Leitner;Günther R. Raidl
Affiliations:
-;-
Venue:
SAINT '08 Proceedings of the 2008 International Symposium on Applications and the Internet
Year:
2008

Citing 0
Cited 2

Branch-and-Cut-and-Price for Capacitated Connected Facility Location

Journal of Mathematical Modelling and Algorithms
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

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a Variable Neighborhood Search approach for a network design problem occurring in real world when the bandwidth of an existing network shall be enhanced. Using two different neighborhood structures we show that a carefully designed combination of a metaheuristic and an exact method based on integer linear programming is able to improve solution quality compared to using heuristic methods only.