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

Cara Cocking (), Gerhard Reinelt () and Marc E. Pfetsch ()
Additional contact information
Cara Cocking: University of Heidelberg, Department of Computer Science
Gerhard Reinelt: University of Heidelberg, Department of Computer Science
Marc E. Pfetsch: University of Heidelberg, Department of Computer Science

Chapter 91 in Operations Research Proceedings 2008, 2009, pp 563-568 from Springer

Abstract: 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

Keywords: Network Design; Facility Location; Facility Location Problem; Network Design Problem; Simulated Annealing Heuristic (search for similar items in EconPapers)
Date: 2009
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-642-00142-0_91

Ordering information: This item can be ordered from
http://www.springer.com/9783642001420

DOI: 10.1007/978-3-642-00142-0_91

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().