Heuristics for Location Models

Jack Brimberg () and John M. Hodgson ()
Additional contact information
Jack Brimberg: Royal Military College of Canada
John M. Hodgson: The University of Alberta

Chapter Chapter 15 in Foundations of Location Analysis, 2011, pp 335-355 from Springer

Abstract: Abstract Location-allocation problems, due to their mathematical complexity, resist exact solutions for problems of more than moderate size. For this and other reasons, heuristic (approximative) approaches are widely used in solving them. This chapter considers the two seminal streams of heuristic solution procedures, both of which remain in use today often in a somewhat altered form. We begin by outlining the location-allocation problem that originally attracted the development of these approaches.

Keywords: Local Search; Facility Location; Variable Neighborhood Search; Partition Method; Network Space (search for similar items in EconPapers)
Date: 2011
References: Add references at CitEc
Citations: View citations in EconPapers (2)

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:isochp:978-1-4419-7572-0_15

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

DOI: 10.1007/978-1-4419-7572-0_15

Access Statistics for this chapter

More chapters in International Series in Operations Research & Management Science from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().