Brimberg, Jack and Salhi, S. (2019) A general framework for local search applied to the continuous p-median problem. In: Eiselt, H. A. and Marianov, Vladimir, eds. Contributions to Location Analysis. First Edition. International Series in Operations Research & Management Science book series, 281 . Springer, pp. 89-108. ISBN 978-3-030-19110-8. E-ISBN 978-3-030-19111-5. (doi:10.1007/978-3-030-19111-5) (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided) (KAR id:77724)
PDF
Author's Accepted Manuscript
Language: English Restricted to Repository staff only |
|
Contact us about this Publication
|
|
Official URL: https://doi.org/10.1007/978-3-030-19111-5 |
Abstract
This chapter reviews the p-median problem in continuous space with an emphasis on some recent heuristics developed to solve it. These heuristics generally use a well-known local search known as Cooper’s algorithm, which alternately solves the location and allocation phases of the problem. We develop a general framework for unifying the different versions of Cooper’s algorithm and for constructing new ones. Some discussion on degenerate solutions and their relation to saddle points, and the possible exploitation of such solutions, is also given.
Item Type: | Book section |
---|---|
DOI/Identification number: | 10.1007/978-3-030-19111-5 |
Uncontrolled keywords: | continuous p-median problem, local search, degenerate solutions, saddle points |
Divisions: | Divisions > Kent Business School - Division > Department of Analytics, Operations and Systems |
Depositing User: | Said Salhi |
Date Deposited: | 22 Oct 2019 14:28 UTC |
Last Modified: | 05 Nov 2024 12:42 UTC |
Resource URI: | https://kar.kent.ac.uk/id/eprint/77724 (The current URI for this page, for reference purposes) |
- Export to:
- RefWorks
- EPrints3 XML
- BibTeX
- CSV
- Depositors only (login required):