A local branching heuristic for the capacitated fixed-charge network design problem

Authors:
Inmaculada Rodríguez-Martín;Juan José Salazar-González
Affiliations:
DEIOC, Facultad de Matemáticas, Universidad de La Laguna, 38271 La Laguna, Tenerife, Spain;DEIOC, Facultad de Matemáticas, Universidad de La Laguna, 38271 La Laguna, Tenerife, Spain
Venue:
Computers and Operations Research
Year:
2010

Citing 9
Cited 2

Bundle-based relaxation methods for multicommodity capacitated fixed charge network design

Discrete Applied Mathematics - Special issue on the combinatorial optimization symposium
A Simplex-Based Tabu Search Method for Capacitated Network Design

INFORMS Journal on Computing
Cycle-Based Neighbourhoods for Fixed-Charge Capacitated Multicommodity Network Design

Operations Research
A Lagrangian Heuristic Based Branch-and-Bound Approach for the Capacitated Network Design Problem

Operations Research
A Slope Scaling/Lagrangean Perturbation Heuristic with Long-Term Memory for Multicommodity Capacitated Fixed-Charge Network Design

Journal of Heuristics
A local branching heuristic for mixed-integer programs with 2-level variables, with an application to a telecommunication network design problem

Networks
A first multilevel cooperative algorithm for capacitated multicommodity network design

Computers and Operations Research - Anniversary focused issue of computers & operations research on tabu search
Variable neighborhood search and local branching

Computers and Operations Research
A survey on benders decomposition applied to fixed-charge network design problems

Computers and Operations Research

A Simplex-based simulated annealing algorithm for node-arc capacitated multicommodity network design

Applied Soft Computing
A cutting plane algorithm for the Capacitated Connected Facility Location Problem

Computational Optimization and Applications

Quantified Score

Hi-index	0.01

Visualization

Abstract

We describe in this article a new heuristic approach for the capacitated fixed-charge network design problem. This is a well known NP-hard problem that has been extensively studied. We propose to use local branching to tackle it. Local branching is a novel metaheuristic technique presented by Fischetti and Lodi [Local branching. Mathematical Programming Series B 2003;98:23-47] that utilizes a general MIP solver to explore neighborhoods. Our implementation is tested on a large set of benchmark instances. The results show that the method outperforms the best heuristic approaches found in the literature.