Sciweavers

Share
SAINT
2008
IEEE

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

8 years 8 months ago
Variable Neighborhood Search for a Prize Collecting Capacity Constrained Connected Facility Location Problem
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.
Markus Leitner, Günther R. Raidl
Added 01 Jun 2010
Updated 01 Jun 2010
Type Conference
Year 2008
Where SAINT
Authors Markus Leitner, Günther R. Raidl
Comments (0)
books