A survey of solution methods for the continuous location allocation problem

Brimberg, J. and Hansen, P. and Mladonovic, N. and Salhi, S. (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 restricted)

This is the latest version of this item.

PDF
Restricted to Repository staff only
Contact us about this Publication Download (323kB)
[img]

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: Faculties > Social Sciences > Kent Business School > Management Science
Depositing User: Said Salhi
Date Deposited: 02 Nov 2010 15:16
Last Modified: 06 Sep 2011 05:41
Resource URI: http://kar.kent.ac.uk/id/eprint/26008 (The current URI for this page, for reference purposes)

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

Downloads

Downloads per month over past year