Journal
DISCRETE APPLIED MATHEMATICS
Volume 112, Issue 1-3, Pages 73-99Publisher
ELSEVIER SCIENCE BV
DOI: 10.1016/S0166-218X(00)00310-3
Keywords
multicommodity capacitated fixed-charge network design; Lagrangian relaxation; sub-gradient methods; bundle methods
Categories
Ask authors/readers for more resources
To efficiently derive bounds for large-scale instances of the capacitated fixed-charge network design problem, Lagrangian relaxations appear promising. This paper presents the results of comprehensive experiments aimed at calibrating and comparing bundle and subgradient methods applied to the optimization of Lagrangian duals arising from two Lagrangian relaxations. This study substantiates the fact that bundle methods appear superior to subgradient approches because they converge faster and are more robust relative to different relaxations, problem characteristics, and selection of the initial parameter values. It also demonstrates that effective lower bounds may be computed efficiently for large-scale instances of the capacitated fixed-charge network design problem. Indeed, in a fraction of the time required by a standard simplex approach to solve the linear programming relaxation, the methods we present attain very high-quality solutions. (C) 2001 Elsevier Science B.V. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available