Skip to main content

A survey of solution methods for the continuous location allocation problem

Brimberg, Jack, Hansen, Pierre, Mladonovic, Nenad, Salhi, Said (2008) A survey of solution methods for the continuous location allocation problem. International Journal of Operations Research, 5 (1). pp. 1-12. ISSN 0711-2440. (Access to this publication is currently restricted. You may be able to access a copy if URLs are provided) (KAR id:26008)

This is the latest version of this item.

PDF
Language: English

Restricted to Repository staff only
Contact us about this Publication
[thumbnail of Salhi_Survey_of_solution_methods.pdf]

Abstract

In this survey, we examine an important class of facility location problems known as the multisource Weber

problem (also referred to as the continuous location-allocation problem). We also show how recent advances in the use of

metaheuristic rules have significantly improved the ability to solve problems of this type. The new solution methods are

discussed for both the well known multisource Weber problem and its counterpart the capacitated case. Research issues

which we believe to be worthwhile exploring in future are also highlighted.

Item Type: Article
Uncontrolled keywords: Location, Continuous space, Heuristics * Corresponding
Subjects: Q Science > Operations Research - Theory
Divisions: Divisions > Kent Business School - Division > Department of Analytics, Operations and Systems
Depositing User: Said Salhi
Date Deposited: 02 Nov 2010 15:16 UTC
Last Modified: 06 Oct 2021 11:04 UTC
Resource URI: https://kar.kent.ac.uk/id/eprint/26008 (The current URI for this page, for reference purposes)
Salhi, Said: https://orcid.org/0000-0002-3384-5240

Available versions of this item

  • A survey of solution methods for the continuous location allocation problem. (deposited 02 Nov 2010 15:16) [Currently Displayed]
  • Depositors only (login required):