Heuristics for Budget Facility Location-Network Design Problems with Minisum Objective

In this paper we present the first heuristics for discrete budget facility location{network design with minisum objective. Simple greedy heuristics, a custom heuristic that separates the problems of facility location and network design, a basic local search, and simulated annealing heuristics using two different kinds of neighborhoods are developed. The results of each heuristic are compared with known optimal solutions to a series of test problems

[1]  H. Pirkul,et al.  The hierarchical network design problem with transshipment facilities , 1991 .

[2]  Mauricio G. C. Resende,et al.  A fast swap-based local search procedure for location problems , 2007, Ann. Oper. Res..

[3]  John R. Current.  The Design of a Hierarchical Transportation Network with Transshipment Facilities , 1988, Transp. Sci..

[4]  Mark S. Daskin,et al.  AN INTEGRATED MODEL OF FACILITY LOCATION AND TRANSPORTATION NETWORK DESIGN , 2001 .

[5]  J. Current,et al.  Theory and methodology , 1991 .

[6]  Zvi Drezner,et al.  NETWORK DESIGN: SELECTION AND DESIGN OF LINKS AND FACILITY LOCATION , 2003 .

[7]  Xujin Chen,et al.  Approximation Algorithms for Soft-Capacitated Facility Location in Capacitated Network Design , 2007, Algorithmica.

[8]  R. Ravi,et al.  Approximation Algorithms for Problems Combining Facility Location and Network Design , 2006, Oper. Res..

[9]  J. G. Klincewicz,et al.  HUB LOCATION IN BACKBONE/TRIBUTARY NETWORK DESIGN: A REVIEW , 1998 .

[10]  Polly Bart,et al.  Heuristic Methods for Estimating the Generalized Vertex Median of a Weighted Graph , 1968, Oper. Res..

[11]  Mark S. Daskin,et al.  Capacitated facility location/network design problems , 2001, Eur. J. Oper. Res..

[12]  Thomas L. Magnanti,et al.  A Dual-Ascent Procedure for Large-Scale Uncapacitated Network Design , 1989, Oper. Res..

[13]  Oded Berman,et al.  Improving the location of minisum facilities through network modification , 1993, Ann. Oper. Res..