Summary
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
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
1. Balakrishnan A, Magnanti TL, Wong RT (1989) A dual-ascent procedure for large-scale uncapacitated network design. Operations Research 37:716–740
2. Berman O, Ingco DI, Odoni AR (1992) Improving the location of minisum facilities through network modification. Annals of Operations Research 40:1–16
Chen X, Chen B (2007) Approximation algorithms for soft-capacitated facility location in capacitated network design. Algorithmica Online First
4. Current JR (1988) The design of a hierarchical transportation network with transshipment facilities. Transportation Science 22:270–277
5. Current JR, Pirkul H (1991) The hierarchical network design problem with transshipment facilities. European Journal of Operational Research 51:338–347
6. Drezner Z, Wesolowsky GO (2003) Network design: Selection and design of links and facility location. Transportation Research Part A 37:241–256
7. Klincewicz JG (1998) Hub location in backbone/tributary network design: A review. Location Science 6:307–335
8. Melkote S, Daskin MS (2001) An integrated model of facility location and transportation network design. Transportation Research 35:515–538
9. Melkote S, Daskin MS (2001) Capacitated facility location/network design problems. European Journal of Operational Research 129:481–495
Melkote S, Daskin MS (2001) Polynomially solvable cases of combined facility location-network design problems. Technical Report
Melkote S, Daskin MS (1998) The maximum covering facility location-network design problem. Technical Report
12. Ravi R, Sinha A (2006) Approximation algorithms for problems combining facility location and network design. Operations Research 54:73–81
13. Resende MGC, Werneck RF (2007) A fast swap-based local search procedure for location problems. Annals of Operations Research 150:205–230
14. Teitz MB, Bart P (1968) Heuristic methods for estimating the generalized vertex median of a weighted graph. Operations Research 16:955–961
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Cocking, C., Reinelt, G., Pfetsch, M.E. (2009). Heuristics for Budget Facility Location-Network Design Problems with Minisum Objective. In: Fleischmann, B., Borgwardt, KH., Klein, R., Tuma, A. (eds) Operations Research Proceedings 2008., vol 2008. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-00142-0_91
Download citation
DOI: https://doi.org/10.1007/978-3-642-00142-0_91
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-00141-3
Online ISBN: 978-3-642-00142-0
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)