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.

• Type: Conference
• Year: 2008
• Where: SAINT
• Authors: Markus Leitner, Günther R. Raidl
• Keywords: Integer Linear Programming, Internet Technology, Network Design Problem, SAINT 2008, Variable Neighborhood Search